/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 vote256 views1 answer
Python slack webhook
Python
0 vote278 views2 answers
Problems on loops and if else statements
Python
0 vote257 views1 answer
Python get volume free space
Python
1 vote288 views1 answer
AttributeError: 'ElementTree' object has no attribute 'getiterator'
Python
15 votes241 views3 answers
Get the current year in python
Python
-1 vote271 views1 answer
Python all any example
Python
0 vote273 views1 answer
My pygame window wont stay open
Python
1 vote273 views1 answer
Passing Functions Around python
Python
0 vote311 views2 answers
Nameerror name 'defaultdict' is not defined
Python
0 vote306 views1 answer
Flask app with spark
Python Flask