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

Tell us what’s happening:

I seem to have the correct line of code but it isnt passing the test.

Your code so far

NUMBER_OF_DISKS = 4
rods = {
    'A': list(range(NUMBER_OF_DISKS, 0, -1)),
    'B': [],
    'C': []
}


/* User Editable Region */

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, auxiliary, target)
        
        # display starting configuration
        rods[target].append(rods[source].pop())
        print(rods, '\n')

              

/* User Editable Region */

# initiate call from source A to target C with auxiliary B
move(NUMBER_OF_DISKS, 'A', 'B', 'C')

Your browser information:

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

Challenge Information:

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

Hello oluf,

The logic is correct, but it’s not part of displaying the starting configuration. It wants you to write it above the last comment.

1 Like

I see…it works now, Thanks

1 Like