/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 vote311 views1 answer
R how to merge data frames
Python
7 votes289 views3 answers
How to update list in python
Python
2 votes336 views1 answer
Python check my gpu
Python
0 vote334 views1 answer
Log of number python
Python
0 vote327 views3 answers
Mechanize python fill
Python
1 vote574 views2 answers
SyntaxError: Non-UTF-8 code starting with
Python
0 vote439 views1 answer
Unzipping the value using zip() python
Python
0 vote321 views1 answer
BusyIndicator Import
Python
0 vote276 views1 answer
How to plot multiple images in python
Python
8 votes374 views4 answers
Normalize data python pandas
Python