Search for a tool
Hanoï Tower Solver

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.

Results

Hanoï Tower Solver -

Tag(s) : Board Games

Share
Share
dCode and more

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!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Feedback and suggestions are welcome so that dCode offers the best 'Hanoï Tower Solver' tool for free! Thank you!

Hanoï Tower Solver

Moves List Generator


See also: Permutations

Answers to Questions (FAQ)

What are the Hanoi Towers? (Definition)

The tower of Hanoi (or the towers of Hanoi or the problem of the Benares temple, or the towers of Brahma) is the name given to a puzzle-type puzzle game made up of discs of increasing diameters to form a tower.

What are the game rules of Hanoi Tower?

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.

What is the notation used?

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.

Where to play Hanoi Tower online?

Play Hanoï tower online here: here

Who invented the Hanoi Tower?

The tower of Hanoi brain puzzle game was invented by a Frenchman: Édouard Lucas

Source code

dCode retains ownership of the "Hanoï Tower Solver" source code. Except explicit open source licence (indicated Creative Commons / free), the "Hanoï Tower Solver" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Hanoï Tower Solver" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Hanoï Tower Solver" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.

Cite dCode

The copy-paste of the page "Hanoï Tower Solver" or any of its results, is allowed (even for commercial purposes) as long as you credit dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Hanoï Tower Solver on dCode.fr [online website], retrieved on 2024-07-18, https://www.dcode.fr/hanoi-tower-solver

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Feedback and suggestions are welcome so that dCode offers the best 'Hanoï Tower Solver' tool for free! Thank you!


https://www.dcode.fr/hanoi-tower-solver
© 2024 dCode — El 'kit de herramientas' definitivo para resolver todos los juegos/acertijos/geocaching/CTF.
 
Feedback