The original problem:
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens attack each other.
http://en.wikipedia.org/wiki/Eight_queens
In this version, we need to place as many queens as possible on an NxN board, such that each queen will threaten at most ONE other queen. We ask to prove an upper bound and give a solution matching it for the standard 8x8 board as well as for a 30x30 board.
No comments:
Post a Comment