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

Python
1

Tell us what’s happening:

I’m not sure what I’m missing in this step. I’ve tried the newline character both on it’s own and in a string (\n and ‘\n’).

Your code so far


# User Editable Region

NUMBER_OF_DISKS = 4

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


def move(n, source, auxiliary, target):
    if n > 0:
        # 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
        A[target].append(A[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/120.0.0.0 Safari/537.36 Edg/120.0.0.0

Challenge Information:

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

2

Hi @Mikie22

Try it with:

You should have target.append(source.pop()) in your code.

Happy coding

3

Thank you! I thought that an already existing line covered that, but it didn’t.

1 Like
4

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