Constructing Solutions

What are all of the ways can one put $n$ queens on an $n \times n$ chessboard so that no two queens attack each other

Parameters

Filters

Displaying 5 of 5 algorithms


Dijkstra	1972	$O(n!)$	$O(n)$
Method of determinants	1874	$O(n!)$
Gunther Determinants solution	1874	$O(n!)$	$O(n!)$
Naive + 1 queen per row restriction	1850	$O(n!)$	$O(n)$
Naive Algorithm	1848	$O(n^n)$	$O(n)$

Insuffient Data to display table

Insuffient Data to display table