/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 vote132 views1 answer
How To Encrypt a Python String
Python
2 votes92 views2 answers
Python telegram bot send message
Python
0 vote138 views1 answer
How to load .mat file and convert it to .csv file?
Python
0 vote158 views1 answer
Search object in array python
Python
2 votes133 views1 answer
How to install from url in python
Python
1 vote148 views2 answers
Conditional and in python
Python
0 vote139 views1 answer
Split a string into N equal parts.
Python
-1 vote127 views2 answers
Split long list into chunks of 100
Python
49 votes120 views6 answers
Plot using matplotlib
Python
0 vote133 views1 answer
Python string equals
Python