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

[savvcenkoks]

Tell us what’s happening:

Здравствуйте, уже какие сутки пытаюсь решить эту задачу, но все не получается.
// running tests 1. You should move the code nested inside the first

if

statement (except the first

print()

call) to your new function. // tests completed // console output {‘A’: [3, 2, 1], ‘B’: , ‘C’: } Move 1 allowed between A and C Moving disk 1 from A to C {‘A’: [3, 2], ‘B’: , ‘C’: [1]} Move 2 allowed between A and B Move 3 allowed between B and C Move 4 allowed between A and C Moving disk 1 from C to A {‘A’: [3, 2, 1], ‘B’: , ‘C’: } Move 5 allowed between A and B Move 6 allowed between B and C Move 7 allowed between A and C Moving disk 1 from A to C {‘A’: [3, 2], ‘B’: , ‘C’: [1]}

Не могу понять в чем проблема, буду благодарна за любую помощь

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 make_allowed_move(rod1, rod2):
    forward = False
    if not rods[rod2]:
       forward = True
    elif rods[rod1] and rods[rod1][-1] < rods[rod2][-1]:
        forward = True
    if forward:
        print(f'Moving disk {rods[rod1][-1]} from {rod1} to {rod2}')
        rods[rod2].append(rods[rod1].pop())
    else:
        print(f'Moving disk {rods[rod2][-1]} from {rod2} to {rod1}')
        rods[rod1].append(rods[rod2].pop())

    print(rods)

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}')
            make_allowed_move(source, target)

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

Challenge Information:

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

freeCodeCamp.org