Tool/Solver to generate moves for The Tower of Hanoi game, a kind of puzzle-game using increasing size stacked discs that the player need to move following some rules.
Hanoï Tower Solver - dCode
Tag(s) : Board Games
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Tool/Solver to generate moves for The Tower of Hanoi game, a kind of puzzle-game using increasing size stacked discs that the player need to move following some rules.
The game consists of a round of 7 discs stacked in decreasing size (the largest at the bottom) along an axis.
The goal is to move these 7 disks on a second vertical axis via a third following two rules:
- Only move one disc at a time
- Never put disk on a disk smaller than it.
The smallest disk is noted 1, 2 the next and so on. Each move consists of changing position of the disk n in the only remaining position that is possible (following the rules).
Example: 1,2,1,3 consists in moving the disc 1 to another axis, then the disc 2, then again the disc 1 and finally the disc 3. The target position is implicit, either there is only one possible position, or there are 2 possible positions but the following movement prohibits one of the 2 positions.
Play Hanoï tower online here : here (link)
The tower of Hanoi brain puzzle game was invented by a Frenchman: Édouard Lucas
dCode retains ownership of the online 'Hanoï Tower Solver' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (PHP, Java, C#, Python, Javascript, Matlab, etc.) no data, script or API access will be for free, same for Hanoï Tower Solver download for offline use on PC, tablet, iPhone or Android !
Please, check our community Discord for help requests!