/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 vote143 views1 answer
ImportError: cannot import name 'Request' from 'urllib2' (unknown location)
Python
1 vote149 views1 answer
Python shortest path of list of nodes site:stackoverflow.com
Python
0 vote162 views1 answer
Matplotlib display axis in scientific notation
Python
3 votes147 views2 answers
Python list comma separated string
Python
42 votes163 views6 answers
Pickle dump
Python
0 vote142 views1 answer
How to add a command to button in a loop tkinter python
Python
-1 vote147 views1 answer
How to add a linebreak in python
Python
46 votes308 views5 answers
How to check uppercase in python
Python
14 votes146 views2 answers
Two groupby pandas
Python
0 vote154 views2 answers
Convert pandas data frame to latex file
Python