Learn / Library / Brainteasers
Rolling a die across a tray
A standard die has opposite faces summing to . It sits on the north-west corner cell of a tray with rows and columns, with on top, on the north-facing side and on the east-facing side. One move rolls the die over one of its bottom edges onto the neighbouring cell to the north, south, east or west, staying inside the tray. What is the minimum number of moves needed for the die to stand on the south-east corner cell with on top?
Checking an answer needs JavaScript. The hint and the solution open without it.
Hint
Count the moves needed just to reach the corner, and check whether a shortest route can possibly show the face you want on top.
Solution
- The corner is rows down and columns across, so at least rolls are needed, and since each roll changes the cell by one step the number of rolls is odd.
- A route of exactly rolls consists of rolls south and rolls east in some order; trying all orders gives the top faces , , , and and never .
- So rolls are not enough, and the next possible length is .
- Rolling south, east, north, east, south, east, south gives the top faces , , , , , , after the successive rolls, so it ends on the corner with on top.
- The minimum number of moves is .
Answer: