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

Python
1

Tell us what’s happening:

hi! i’m having trouble passing the code on step 17. even though my imput is exactly what the excercise is asking for.
thanks in advance!

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):
        if(i + 1) % 3 == 1:
            print(f'Move {i + 1} allowed between {source} and {target}')

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

Challenge Information:

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

2

If you add space before opening parenthesis in the if condition, it will pass.

Would you be interested in creating an issue for this problem on the freeCodeCamp GitHub repository?