/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

12 votes237 views4 answers
Dictionary append value python
Python
2 votes260 views1 answer
Python how to get the last element in a list
Python
5 votes243 views1 answer
Get request body flask
Python
0 vote232 views1 answer
Get length of a tuple in python
Python
1 vote257 views1 answer
Python array spread
Python
0 vote222 views1 answer
Pandas dataframe unique multiple columns
Python
6 votes261 views6 answers
Tuple in python
Python
1 vote257 views1 answer
Reading the data
Python
0 vote243 views1 answer
Sqlalchemy datetime default now create table
Python
2 votes238 views1 answer
Spyder - comment banch of codee
Python