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

my bad stil struggling
need help on step 16 again

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):
        pass???

# 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/121.0.0.0 Safari/537.36 OPR/107.0.0.0

Challenge Information:

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

I did it lol
– removed –

Please don’t post solutions, thanks!

1 Like

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.