SOLUTION: On an infinite chessboard a game is played as follows. At the start {{{n^2}}} pieces are arranged in an
n x n block of adjoining squares, one piece on each square. A move in the g
Algebra ->
Permutations
-> SOLUTION: On an infinite chessboard a game is played as follows. At the start {{{n^2}}} pieces are arranged in an
n x n block of adjoining squares, one piece on each square. A move in the g
Log On
Question 1172762: On an infinite chessboard a game is played as follows. At the start pieces are arranged in an
n x n block of adjoining squares, one piece on each square. A move in the game is a jump in a horizontal or vertical direction over an adjacent occupied square to an unoccupied square immediately beyond. The piece which has been jumped over is removed. Find those values of n for which the game can end with only one piece remaining on the board. Answer by ikleyn(52780) (Show Source):
