Queens Puzzle

Queens Puzzle

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Summary: Any computer programme capable of solving the famous 'Queens Puzzle' efficiently, would be so powerful, it would be capable of solving tasks currently considered impossible
Devised in 1850, the Queens Puzzle originally challenged a player to place eight queens on a standard chessboard so that no two queens could attack each other.
The experiments will compare the convergence of the algorithms on the 8 Queens puzzle to extend the results of the AI techniques on the solution for the N puzzle
As we have seen in the studies of on the N Puzzle as well as the 8 Queens puzzle, the A* is seen to perform best, with its heuristics and faster convergence at cheaper cost and therefore conclude that the A* search is best suited for solving issues of this nature.