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

Python
1

Tell us what’s happening:

Describe your issue in detail here.

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

Challenge Information:

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

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

Hey, how can I help? It doesn’t seem you tried to do what the instructions ask in this step.

4

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