Learn Recursion by Solving the Tower of Hanoi Puzzle - Step 52

Python
1

Tell us what’s happening:

my code runs perfectly but does not pass, i dont know what wrong i did.

Your code so far


# User Editable Region

NUMBER_OF_DISKS = 4
A = list(range(NUMBER_OF_DISKS, 0, -1))
B = []
C = []


def move(n, source, auxiliary, target):
    if n > 0:
        # move n - 1 disks from source to auxiliary, so they are out of the way
        move(n - 1, source, target, auxiliary)
        
        # move the nth disk from source to target
        target.append(source.pop())
        
        # display our progress
        print(f'A: {A}, B: {B}, C: {C}\n')
        
        # move the n - 1 disks that we left on auxiliary onto target
        move(n - 1,  auxiliary, source, target)
              
# initiate call from source A to target C with auxiliary B
move(NUMBER_OF_DISKS, A, B, C)

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/131.0.0.0 Safari/537.36

Challenge Information:

Learn Recursion by Solving the Tower of Hanoi Puzzle - Step 52

2

What is the error/hint message you are getting which prevent from passing

3

Your code works fine but the test want you to have a different print call:

You should modify your print() call to print A, B, C, instead of the rods object. Keep the newline character in the print() call.

I guess instructions could be modified to clarify that from the beginning or the test could be modified to accept this answer too.