/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 vote178 views1 answer
Dimension of an indez pandas
Python
7 votes136 views1 answer
Numpy array with specific value
Python
0 vote122 views1 answer
Class indexing
Python
10 votes124 views4 answers
Write text in list to text file python
Python
5 votes209 views1 answer
Add bearer token in python request
Python
0 vote137 views2 answers
How to Send WhatsApp API using python
Python
9 votes141 views1 answer
Create models in django
Python
6 votes186 views1 answer
Jupyter pdataframe max rows
Python
0 vote143 views1 answer
Django template child data in nested loop
Python
0 vote136 views1 answer
Numpy stack arrays vertically
Python