Search⌘ K
AI Features
Home
Courses
Discover Ruby Programming Through Fun Examples

Solution: Tower of Hanoi

Explore solving the Tower of Hanoi using Ruby recursion and backtracking. This lesson guides you through the recursive base case, disk movements, and tracking steps, helping you master problem-solving with core Ruby programming techniques.

We'll cover the following...

Tower of Hanoi

Ruby 3.1.2
@move_logs = [] # save your move logs in this array
def solve_tower_hanoi(n, src_peg = "peg-A", spr_peg = "peg-B", des_peg = "peg-C")
    if n > 0 # if there is a disk
        solve_tower_hanoi(n-1, src_peg, des_peg, spr_peg)
        @move_logs << "Moved disk-#{n} from #{src_peg} to #{des_peg}"
        solve_tower_hanoi(n-1, spr_peg, src_peg, des_peg)
        
    end
end
...