# Learn Recursion by Solving the Tower of Hanoi Puzzle - Step 27

### Tell us what’s happening:

I don’t understand why my code is not passing.
I even checked other posts in the forum for the same step.
It seems I’ve done what I should, still not passing.
Probably something I’ve missed somewhere.
I can’t seem to see or find what I’ve missed.

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

def move(n, source, auxiliary, target):
# display starting configuration
print(rods)
for i in range(number_of_moves):
remainder = (i + 1) % 3
if remainder == 1:
print(f'Move {i + 1} allowed between {source} and {target}')
forward = False
if not rods[target]:
forward = True
elif rods[source] and rods[source][-1] < rods[target][-1]:
forward = True

# User Editable Region

if forward:
print(f'Moving disk {rods[source][-1]} from {source} to {target}')
rods[target].append(rods[source].pop())
else:
print(f'Moving disk {rods[target][-1]} from {target} to {source}')
rods[source].append(rods[target].pop())

# User Editable Region

elif remainder == 2:
print(f'Move {i + 1} allowed between {source} and {auxiliary}')
elif remainder == 0:
print(f'Move {i + 1} allowed between {auxiliary} and {target}')

# initiate call from source A to target C with auxiliary B
move(NUMBER_OF_DISKS, 'A', 'B', 'C')

User Agent is: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/16.3 Safari/605.1.15

### Challenge Information:

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

I moved the lines back and forth in the indentation, actually nothing changed, but now it worked suddenly so thank you.

Should I remove this post? As in to not post solutions?

Here was the problem:

No, don’t need to remove in this case, thanks for asking though

1 Like

I saw where the issue was eventually too.
Thank you so much! New to this.

1 Like