**From New Scientist #2728, 3rd October 2009** [link]

Joe’s puzzle was no rollover for Penny. Joe drew a mini-chess board on a card and made a dice with the letters ENIGMA in place of the numbers. Penny had to select a letter and then place the dice on the X with the selected letter on the top. Then she moved the dice, by rolling it (rotating it by 90 degrees), from square to square to the corresponding lettered square on the right of the board, finishing with the selected letter on top. For each letter the number of moves had to be a minimum. What are the minimum number of moves for each of the letters E, N, I, G, M and A?

[enigma1565]

### Like this:

Like Loading...

*Related*

The following Python program implements a depth first search and runs in 124ms.

Solution:The minimum number of moves for each letter are: E=10, N=9, I=8, G=7, M=8, A=7.