/Python/Python towers of hanoi recursive

Python towers of hanoi recursive

# Python towers of hanoi recursive
def hanoiArray(n):

    def move(n, start=1, end=3):
        if n > 0:
            ans.append(move(n-1, start, 6 - start - end))
            pegs[end-1].append(pegs[start-1].pop())
            move(n-1, 6 - start - end, end)
        return str(pegs)

    ans, pegs = [], [list(range(n, 0, -1)), [], []]
    ans.append(move(n))
    return '\n'.join(ans)

Similar codes

1 vote330 views2 answers
Find all unique items in dictionary value python
Python
1 vote363 views1 answer
Godot spawn object
Python
18 votes316 views5 answers
Python auto clicker
Python
0 vote350 views1 answer
Pytest suppress errors
Python
-2 votes346 views1 answer
How to check if a string contains spaces in python
Python
0 vote367 views1 answer
Find maximum element in stack
Python
1 vote406 views1 answer
AttributeError: 'ElementTree' object has no attribute 'getiterator'
Python
20 votes334 views2 answers
How to import csv in pandas
Python
0 vote345 views1 answer
Start loop at 1 python
Python
0 vote363 views1 answer
Is str in pzthon
Python