/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

0 vote277 views1 answer
Split string with first numerical value in python
Python
5 votes307 views1 answer
Pynput.keyboard.Key
Python
13 votes321 views3 answers
How to change character in string python
Python
1 vote300 views2 answers
Find all unique items in dictionary value python
Python
43 votes335 views6 answers
Python array to string
Python
0 vote341 views1 answer
Django update request.post
Python Django
0 vote333 views1 answer
Como filtrar los vacios, NaN, null en python
Python
0 vote372 views1 answer
No module named 'flask_jwt_extended'
Python Flask
0 vote366 views1 answer
Colab erase recycle bin drive
Python
0 vote259 views4 answers
Django forms I cannot save picture file
Python