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

Python
1

Tell us what’s happening:

I do not understand the problem here. I have copied the function. I have changed the name, and I got rid from the first comment off, and it is not good yet.

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):
    # display starting configuration

    if remainder == 1:
            #print(f'Move {i + 1} allowed between {source} and {target}')
        forward = False
        if not rods[target]:
                forward = True
        elif rods[source] and rods[source][-1] < rods[target][-1]:
                forward = True
        if forward:
                print(f'Moving disk {rods[source][-1]} from {source} to {target}')
                rods[target].append(rods[source].pop())
        else:
                print(f'Moving disk {rods[target][-1]} from {target} to {source}')
                rods[source].append(rods[target].pop())

            # display our progress
        print(rods)    

def move(n, source, auxiliary, target):
    # display starting configuration
    print(rods)
    for i in range(number_of_moves):
        remainder = (i + 1) % 3
        

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

Challenge Information:

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

2

Hi @santiagodeleondecar1

image
image327×102 1.82 KB

An error message is thrown in the console.

Happy coding

3 

```
def make_allowed_move(rod1, rod2):
    
        if remainder == 1:
                print(f'Move {i + 1} allowed between {source} and {target}')
                forward = False
                if not rods[target]:
                    forward = True
                elif rods[source] and rods[source][-1] < rods[target][-1]:
                    forward = True
                if forward:
                    print(f'Moving disk {rods[source][-1]} from {source} to {target}')
                    rods[target].append(rods[source].pop())
                else:
                    print(f'Moving disk {rods[target][-1]} from {target} to {source}')
                    rods[source].append(rods[target].pop())

                # display our progress
                print(rods)
        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}')        
        

def move(n, source, auxiliary, target):
    for i in range(number_of_moves):
        remainder = (i + 1) % 3
    # display starting configuration
    #print(rods)
    pass
move(NUMBER_OF_DISKS, 'A', 'B', 'C')  
```
4

image
image1841×664 88.9 KB

5

If you are still having problems, please post your full code, not a screen grab.

Check the console for any messages.

Describe the issue so people on the forum can assist you.

Happcy

1 Like