/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 vote111 views1 answer
Export python pandas dataframe as json file
Python
0 vote135 views1 answer
Pandas split dataframe into chunks with a condition
Python
0 vote123 views1 answer
Pyqt menubar example
Python
5 votes135 views2 answers
Forgot django admin password
Python Django
0 vote112 views1 answer
Python input for competitive programming
Python
5 votes115 views4 answers
Django get or 404
Python
-1 vote115 views1 answer
How to convert one dimensional array into two dimensional array
Python
0 vote117 views1 answer
Fastapi upload file save
Python
1 vote126 views4 answers
Flask activ environment
Python
0 vote113 views1 answer
Create a new list from a list when a certain condition is met
Python