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

Python
1

Tell us what’s happening:

Hi all! :wave: I’m working on “Learn Recursion by Solving the Tower of Hanoi Puzzle”, but my test fails. The error says:
You should print the current move number at each iteration.

Expected Output:

{'A': [3, 2, 1], 'B': [], 'C': []}
Move 1
Move 2
Move 3
Move 4
Move 5
Move 6
Move 7

Issue: Test still fails. Am I missing something? :thinking:

Your code so far

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


# User Editable Region

def move(n, source, auxiliary, target):
    # display starting configuration
    print(rods)
    for i in range(number_of_moves):
        print(f"Move {i + 1}")

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

Challenge Information:

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

2

Try to take the instructions purely literally. Don’t add anything extra, just follow the instruction in the most simple way you can.

If you add extra things, the test won’t expect it. All the instructions are asking is to print a number.

1 Like
3

Thanks! That was the issue. Keeping it simple worked.