The eight queens puzzle is the problem of placing eight queens on an 8×8 chessboard such that no two queens attack each other. Several algorithms that can solve this puzzle exist, but this visualizer uses the Hill Climbing algorithm (local search) to find a solution.
See the visualizer in action here!
