/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 vote258 views1 answer
Get key from dict python
Python
0 vote258 views1 answer
OpenPyXl Get Sheet Names
Python
2 votes309 views1 answer
Django create model from dictionary
Python
2 votes292 views1 answer
Python print dictionary line by line
Python
3 votes260 views2 answers
To extract out only year month from a date column in pandas
Python
0 vote273 views2 answers
How to download file in python
Python
2 votes284 views2 answers
Pyinstaller exe version info
Python
0 vote281 views1 answer
Add rectangle matplotlib
Python
1 vote300 views2 answers
Add a value to an existing field in pandas dataframe after checking conditions
Python
1 vote261 views1 answer
Python tkinter listbox click event
Python