The Eight Queens Problem

The eight queens problem is a well-known example of the use of recursion and backtracking algorithms. It is stated as follows: "Eight queens are to be placed on a chess board such that no queen threatens any other queen." There are 92 solutions, and the above Java applet computes and illustrates them.

Steve can't resist boasting that this web page and applet were mentioned in the June 1998 edition of BYTE Magazine (on page 84).


Back to home page.