HANOI TOWERS GAME HISTOTY SERIES

The easiest way to play the game is to use a single disk: To fix that, let's walk through a handful of examples and see how a typical game with these conditions is played. These conditions probably don't make a whole lot of sense. You can use any tower other than the one you started from as your destination, but we'll use Tower #3. Victory is achieved when all of the starting disks are arranged in their same starting order on a destination tower.You can only place a smaller disk on top of a larger disk.At each move, you take the disk from the top of any of the stacks and place it on another tower.This seems pretty straightforward, but there are a few conditions that make things frustratingly complex: At the end, the stack of disks are shifted over to the last pillar:

HANOI TOWERS GAME HISTOTY SERIES

You have a series of disks and three pillars:Īt the beginning, all of the disks are stacked on top of each other and start off in the first pillar. The objective of this puzzle is pretty simple. Besides being a really cool puzzle, it has a lot of practical (and historical!) significance as we learn about recursion.īefore we get to the programming side of things, let's first get a good idea of what the monks were trying to do. The Towers of Hanoi, Recursion, and the End of the Worldīy kirupa | filed under Data Structures and AlgorithmsĪs puzzles go, nobody really did it better than the monks who came up with the one we are going to learn about, the Towers of Hanoi.

Hanoi towers game histoty