Tower of Hanoi, Day 7

tower_of_hanoi.rb

#Tower of Hanoi

#     Recursive solution:
# http://www.sparknotes.com/cs/recursion/examples/section6.rhtml 

def toh(n, source = 'A', temp = 'B', dest = 'C')  
  toh(n - 1, source, dest, temp) if n > 1  # move all n - 1 disks to temp pole
  puts "Move top disc #{n}: #{source} => #{dest}." # move bottom disk to destination pole
  toh(n - 1, temp, source, dest) if n > 1  # move all n - 1 disks to destination pole
end