Tower of Hanoi Problem: Need Help with Recursive Solution

Question

Hey everyone,

I've been working on the classic Tower of Hanoi problem, and I'm stuck on implementing the recursive solution. I have been referring to the article on the Algorithm for Tower of Hanoi, but I'm still having some trouble understanding how to code it correctly.

Here's the code I've attempted so far:

zpython
def tower_of_hanoi(n, source, destination, auxiliary):
    if n > 0:
        # Move n-1 disks from source to auxiliary
        tower_of_hanoi(n-1, source, auxiliary, destination)

        # Move the nth disk from source to destination
        print("Move disk", n, "from", source, "to", destination)

        # Move the n-1 disks from auxiliary to destination
        tower_of_hanoi(n-1, auxiliary, destination, source)

# Test the function
n = 3
tower_of_hanoi(n, 'A', 'C', 'B')
 

However, when I run this code, the output doesn't seem to be correct. The order of disk movements is not as expected. I'm not sure what I'm doing wrong here.

Could someone please help me understand what's going wrong with my code? Am I missing any crucial steps or making a logical mistake?

If possible, could someone provide a corrected version of the code that properly solves the Tower of Hanoi problem?

Thank you in advance for your assistance!