Eight Queens Problem
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other.
Thus, the perfect solution requires that no two queens share the same row, column, or diagonal.
Pictured: A perfect solution
Purpose.
The Eight Queens Solution Test Project was designed to test the solutions given by the Artificial Bee Colony Algorithm implementation, when applied to the eight-queens chess problem.
Why Bother?
Since Max Bezzell published the eight queens problem in 1848, many mathematicians have worked on the puzzle and its modifications. The problem can be quite computationally expensive, as there are 4,426,165,368 possible arrangements of eight queens on an 8x8 board, but only 92 distinct solutions.
The Artificial Bee Colony Algorithm is an evolutionary algorithm that simulates the behavior of bees when seeking good food sources, using the models to solve real world and abstract problems.