Authored by Nonki Takahashi
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed , otherwise it is open .
The 8-Queens problem in chess is to place 8 queens on a chess board such that none of the queens is threatening any of the others. The problem is to input the 8 columns of the queens on the rows of a chess board, with 1 being the first column and 8 being the last, e.g. 1 2 3 4 5 6 7 8 means the queens are along the diagonal, which would not be a valid solution.
More Info about this problem
Write a program to test a user input guess.
Examples:
- Enter board configuration: 2 4 6 8 3 1 7 5 - This is a valid configuration (as above).
- Enter board configuration: 1 8 2 5 3 7 4 6 - This is NOT a valid configuration.
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.