/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 vote335 views2 answers
Generate random token or id in django
Python
0 vote338 views1 answer
Numpy python 3.10
Python
31 votes425 views1 answer
Flask vs django
Python Django
2 votes328 views2 answers
How to take input in python3 separated by space
Python
0 vote348 views1 answer
Find index of values greater than python
Python
2 votes315 views1 answer
Change size of selenium window
Python
1 vote330 views1 answer
Get all h1 beautifulsoup
Python
11 votes334 views4 answers
Python create environment variable
Python
0 vote358 views1 answer
Select values for row matching condition
Python
1 vote342 views2 answers
Dataframe all companies except
Python