/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 vote156 views1 answer
Set icon title tkinter
Python
0 vote144 views2 answers
Numpy array into tuple
Python
0 vote125 views1 answer
Cbv uk django
Python
0 vote141 views1 answer
Reportlab python add font style
Python
3 votes155 views1 answer
What is cpython
Python
4 votes137 views2 answers
Python check if exe is running
Python
47 votes152 views6 answers
Random float python
Python
2 votes142 views2 answers
Scipy cosine similarity
Python
2 votes196 views1 answer
Flask minimul app
Python Flask
1 vote135 views1 answer
Flask api response code
Python