Funny movement, but no tour possible
Source:
June 14, 2006
quadraticsmodular arithmetic
Problem Statement
Let and be two horizontal neighbouring squares on a chess board, on the left and on the right. On the left square there is a stone that shall be moved around the board. The following moves are allowed:
1) move it one square upwards
2) move it one square to the right
3) move it one square down and one square to the left (diagonal movement)
Example: you can get from to , and .
Show that for no there is tour visting every square exactly once and ending in .