This page allows you to try three different variations of the ancient 'Towers of Hanoi' puzzle. This puzzle is strictly one-dimensional though, and is therefore slightly easier to complete.
Click on any of the links at the top of the page to reveal (or hide) more information about this calculator.
Caveats:
If you are reading this paragraph, then you probably don't have JavaScript installed/enabled on your computer.
At this point in time everything on this site is dependant on JavaScript.
Given enough time and money it is hoped to develop a version in the future which will be able to operate independently.
Since JavaScript runs on your own computer, rather than on this server, it has been possible to set up this site much more quickly than if a server-side language was used, and it is possible to serve far more pages with the available bandwidth.
If you think that you can assist with this project in any way, then please visit the Support section and leave a message.
Definitions:
None.
Formulae:
There are no relevant formulae to list.
Rules / Instructions
The aim of this puzzle is to get all of the yellow pieces on the left hand side of the board over to the right hand side to replace the black pieces, and vice versa.
The rules to be followed are:
Only one piece may move at a time.
A piece may move into an adjacent square (if that square is empty.)
A piece may 'jump' one other piece, of either colour.
To play the game simply click on the piece that you wish to move.
(There is only ever one place that the piece can be moved to.)
But first, click on "Clear Board" below: