The first solution to this exhaustive search problem was found in 1874 by using determinants.
The first solution to this exhaustive search problem was found in 1874 by using determinants. First created in 1850 by Franz Nauck, it was found that given a standard arrangement, there are 92 solutions. A different number of solutions, however, will be present for nonstandard arrangements, such as George Polya's toroidal board. A traditional problem in computer science is, for ten points, which problem that places eight chess pieces on an eight by eight board such that no piece occupies the same row, column, or diagonal.
The first solution to this exhaustive search problem was found in 1874 by using determinants.
The {Eight Queens} Problem