Tower of Hanoi

Hanoi Tower


🧩 Algorithm

The objective of the game is to move the entire stack to another rod, obeying the following simple rules:

  1. Only one disk can be moved at a time.
  2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
  3. No larger disk may be placed on top of a smaller disk.


🧩 Example


I take an integer as a input, that represents the number of disks. Let’s say 2.


I need to have the steps (the moves) of each disk to know how to solve the Tower of Hanoi:

# Move from A to C
# Move from A to B
# Move from C to B


I move the first disk (so the smallest) from A to C. Then I can place the biggest disk directly to the destination rod (B). And then, place the smallest (waiting in C) on top of the biggest in B.

🧩 Code

This can be solved using recursion such as:

def hanoi_tower(n, source = 'A', destination = 'B', auxiliary = 'C')
  return unless n

  if n == 1
    puts "Move from #{source} to #{destination}"
    # Step 1 − Move n-1 disks from source to aux
    hanoi_tower(n-1, source, auxiliary, destination)

    # Step 2 − Move nth disk from source to dest
    puts "Move from #{source} to #{destination}"

    # Step 3 − Move n-1 disks from aux to dest
    hanoi_tower(n-1, auxiliary, destination, source)

🧩 Source code

here :)