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

Python
1

Tell us what’s happening:

Please kindly help me to complete my code to stuck in this step

Your code so far


# User Editable Region

NUMBER_OF_DISKS = 5
A = list(range(NUMBER_OF_DISKS, 0, -1))
B = []
C = []

def move(n, source, auxiliary, target):
    if n <= 0:
        return
        # move n - 1 disks from source to auxiliary, so they are out of the way
        move(n - 1, source, target, auxiliary)
        # move the nth disk from source to target
        target.append(source.pop())
        # display our progress
        print(A, B, C, '\n')
        # move the n - 1 disks that we left on auxiliary onto target
        move(n - 1,  auxiliary, source, target)
# initiate call from source A to target C with auxiliary B
move(NUMBER_OF_DISKS, A, B, C)

# User Editable Region

Your browser information:

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

Challenge Information:

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

2024-07-12_164529
2024-07-12_164529734×389 17.2 KB

2

Hey there. Well, the error is telling you exactly what is wrong:

“You should reduce the indentation level of all the code after the return statement”

3

i tried to reduce indent level, but not yet complete. let plz guide

4

show me your new code then. because for me it is working after reducing indent level.