DE-BUNDESWETTBEWERB 2005 Problem 1
- Round 1
In the centre of a chessboard lies a dice that is to be moved across the board in a sequence of moves.
One move consists of the following three steps:
- The dice has to be turned with an arbitrary side on top,
- then it has to be moved by the shown number of points to the right or left
- and finally moved by the concealed number of points upwards or downwards. The attained square is the starting square for the next move.
Which squares of the chessboard can be reached in a finite sequence of such moves?
Dataset text AI-MO AoPS. Quoted with source.
Official text: Bundeswettbewerb Mathematik 2005 official paper, page 1.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.