Tower of Hanoi Puzzle - Step 24

Python
1

i wish i knew what was happening everything seems to point me to this being the solution but this and any variation of this i use does not seem to do it

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': []
}

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}')
            forward = False

# User Editable Region

            if not rods[target]:
                forward = True
            elif rods[source][-1] < rods[target][-1]:
                forward = True

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

Challenge Information:

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

2

Hi @ControllerJunkie

Here is a post from yesterday that you may find helpful.

Happy coding

3

i have gone over that post already, as well as the other one(s) im not exactly sure why im so hard stuck on this i really have not had a problem getting through any step on any of the courses so far without being able to figure it out or use the forms for help to guide me or use

4

when the source list is not empty

I don’t see where you are checking this

5

i figured it out, after alot of pain and suffering im just an idiot

6

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