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

Python
1

Tell us what’s happening:

Describe your issue in detail here.

Hello I have tested some codes out but I couldn’t find the solution, I followed what the hint gave me but it is apperantly still wrong, can anyone help?

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': []
}

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

# User Editable Region

            if not rods[target]:
                forward = True
            elif rods[source] != [] and rods[source][-1] < rods[target][-1]:
                forward = True

# 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')

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/122.0.0.0 Safari/537.36

Challenge Information:

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

2

You appear to have created this post without editing the template. Please edit your post to Tell us what’s happening in your own words.

3 
rods[source] != []

Can you think of a simpler way to write this?

It’s similar to how this expresses “if rods[target] is not true”, you didn’t need to make a comparison:

if not rods[target]:
4

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