The Spin-out Puzzle
This puzzle was invented by William Keiser. The goal is to remove the slider. This can be done by turning all disks horizontal. Because of the relationship of the disk, they can only be turned is a specific sequence.
The Spin-out solution code sequence is exactly the same as the Gray binary code. This is the binary counting system, named after Frank Gray. gray created this code in 1930, which is still used today as a base for electronical switching and computer logic.
Scroll down for the solution.
| '0' means disk is in vertical position, '1' means disk is in horizontal position. the red number indicates the changing disk. | |||||||||
| 0000000 | 0000001 | 0000101 | 0000110 | 0000111 | 0010111 | 0010110 | 0010100 | 0010101 | 0010001 |
| 0010000 | 0010010 | 0010011 | 0011011 | 0011010 | 0011000 | 0011001 | 0011101 | 0011100 | 0011110 |
| 0011111 | 1011111 | 1011110 | 1011100 | 1011101 | 1011001 | 1011000 | 1011010 | 1011011 | 1010011 |
| 1010010 | 1010000 | 1010001 | 1010101 | 1010100 | 1010110 | 1010111 | 1000111 | 1000110 | 1000100 |
| 1000101 | 1000001 | 1000000 | 1000010 | 1000011 | 1001011 | 1001010 | 1001000 | 1001001 | 1001101 |
| 1001100 | 1001110 | 1001111 | 1101111 | 1101110 | 1101100 | 1101101 | 1101001 | 1101000 | 1101010 |
| 1101011 | 1100011 | 1100010 | 1100000 | 1100001 | 1100101 | 1100100 | 1100110 | 1100111 | 1110111 |
| 1110110 | 1110100 | 1110101 | 1110001 | 1110000 | 1110010 | 1110011 | 1111011 | 1111010 | 1111000 |
| 1111001 | 1111101 | 1111100 | 1111110 | 1111111 |
total number of moves: 85. |
||||