/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

6 votes248 views2 answers
Multiple plot in one figure python
Python
0 vote237 views1 answer
Discord.py - change the default help command
Python
36 votes236 views6 answers
Remove letter from string python
Python
28 votes258 views2 answers
Pandas replace nan with value above
Python
1 vote258 views7 answers
Java to python
Python
0 vote244 views1 answer
No lapack/blas resources found scipy
Python
0 vote250 views1 answer
How to add base map in pyqgis
Python
0 vote246 views1 answer
Speak by a discord bot in python
Python
4 votes202 views2 answers
How to remove all elements from dictionary python
Python
1 vote306 views1 answer
Sum values in django models
Python