/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

-2 votes126 views2 answers
Save turtle programming python
Python
0 vote130 views1 answer
How to check if given primary key exists in django model
Python
37 votes120 views6 answers
How to install pip ubuntu python2
Python
1 vote122 views1 answer
Internet Explorer Selenium
Python
0 vote120 views2 answers
Call for a last number in series python
Python
-1 vote131 views1 answer
Tkinter triangle
Python
0 vote114 views1 answer
Python input byte array
Python
0 vote142 views1 answer
Current page django
Python Django
-1 vote126 views1 answer
Pandas subtract days from date
Python
2 votes135 views1 answer
Python dictionary multiple same keys
Python