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

Python
1

Tell us what’s happening:

It says that I should call move(n - 1, auxiliary, source, target) at the end of your my function. But it keeps wrong, also I can’t find the right order for the arguments ;-; what should I do?

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 the nth disk from source to target
        rods[target].append(rods[source].pop())
        
        # display our progress
        print(rods, '\n')
        move(n - 1, source, target, auxiliary)

# 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/122.0.0.0 Safari/537.36

Challenge Information:

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

2

I would put the original code back - you need to add one new line and delete zero old lines.

On this new line, you should call move(n - 1, ....) with source, auxiliary, target in the right order.

1 Like
3

What does this ’ you need to add one new line and delete zero old lines’ mean?

4

‘delete’ means to remove. You should not remove anything. I don’t know how to explain ‘add’

5

If you have a question about a specific challenge as it relates to your written code for that challenge and need some help, click the Ask for Help button located on the challenge (it looks like a question mark). This button only appears if you have tried to submit an answer at least three times.

The Ask for Help button will create a new topic with all code you have written and include a link to the challenge also. You will still be able to ask any questions in the post before submitting it to the forum.

Thank you.