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

Python
1

Tell us what’s happening:

my code prints the right result I believe, but I don’t know why it wont accept my answer? I already tried googling, checking previous posts, and asking AI

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(1, number_of_moves + 1):
        print(i)

# 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 (X11; CrOS x86_64 14541.0.0) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/130.0.0.0 Safari/537.36

Challenge Information:

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

2

python is a 0-indexed language, that means that you start counting from 0
your loop should start from 0, not 1

3

if you meant that I should change my for to: for i in range(0, number_of_moves + 1):
that also doesn’t work

4

Welcome to the forum @jakejacquino

Why are you adding 1 to number_of_moves?

Happy coding