/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 vote354 views1 answer
Fetch image url discord py
Python
8 votes303 views2 answers
List of single item repeated python
Python
0 vote332 views1 answer
How to find permutation of numbers in python
Python
-1 vote252 views1 answer
Image analysis python
Python
0 vote331 views1 answer
Use get method request html page python
Python
0 vote317 views1 answer
Git ignore everything but python files
Python
11 votes347 views4 answers
Python remove empty values from list
Python
0 vote305 views1 answer
Lamda in f string
Python
0 vote275 views2 answers
Initialize boolean list of size python
Python
0 vote295 views1 answer
Aiohttp specify app IP
Python