/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 vote297 views1 answer
Remove bg from pic using pthon
Python
3 votes312 views2 answers
Change django administration text
Python
1 vote310 views1 answer
Django ModelChoiceField value not id
Python
1 vote289 views1 answer
Fatal error detected failed to execute script
Python
0 vote297 views1 answer
Showing specific columns pandas
Python
0 vote291 views2 answers
Headers cors
Python
0 vote332 views1 answer
Isolationforest estimators
Python
1 vote288 views1 answer
Circular array python
Python
7 votes313 views4 answers
XLRDError: Excel xlsx file; not supported
Python
0 vote327 views1 answer
Extrapolate python
Python