/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

56 votes110 views6 answers
How to open a file with python
Python
2 votes127 views2 answers
Anaconda python 3.6 download
Python
0 vote109 views1 answer
Keras conv2d batchnorm
Python
35 votes115 views6 answers
Generate random string python
Python
12 votes107 views3 answers
How to update python raspberry pi
Python
38 votes107 views6 answers
Pip is not recognized as an internal or external command
Python
0 vote115 views1 answer
Japanese translator google
Python
6 votes116 views4 answers
To_frame pandas
Python
-2 votes118 views1 answer
Do i need do some set when i use GPU to train tensorflow model
Python
12 votes108 views6 answers
Print()
Python