/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

19 votes98 views1 answer
Python string cut left
Python
42 votes114 views6 answers
Pandas dataframe
Python
0 vote131 views1 answer
Fast comand exit python windows
Python
0 vote95 views1 answer
No default language could be detected for django app
Python
5 votes108 views3 answers
Strptime python
Python
30 votes116 views6 answers
Get python version in code
Python
0 vote114 views1 answer
Python for loop practice problems
Python
0 vote97 views1 answer
Rotate an image python keras
Python
0 vote110 views1 answer
Encrypt password with sha512 + python
Python
47 votes106 views3 answers
String to array python
Python