The goal of the

Queens problem is to arrange

Queens on an

chessboard such that no Queen attacks another. Fermat's

theorem states that each prime of the form

can be written as a sum of two squares. A class of solutions to the

Queens problem corresponds to such decompositions. For example,

. Place a Queen in the center of a

board. Move 2 squares over, 3 squares up, and place a Queen on the resulting square. Keep moving and placing Queens on the board in this manner, identifying the top and bottom edges as well as the right and left edges of the board.