/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

1 vote122 views1 answer
Create a response object python
Python
-1 vote286 views2 answers
Django forms error customize
Python Django
0 vote165 views1 answer
Python tokenize sentence italian spacy
Python
1 vote234 views1 answer
Df.select_dtypes
Python
0 vote169 views1 answer
Protocol buffers python
Python
2 votes178 views1 answer
Python pi value
Python
4 votes293 views4 answers
How to change django admin text
Python Django
0 vote171 views1 answer
Ipython.display latex in the IDE like spyder
Python
5 votes116 views1 answer
Get hour in python
Python
0 vote171 views8 answers
Convert code c++ to python online
Python