/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

-2 votes280 views1 answer
Ex; jva loop array
Python
11 votes312 views1 answer
How to make an argument optional in python
Python
2 votes295 views1 answer
Readline in a file
Python
0 vote362 views1 answer
Setting flask app environment variable
Python Flask
0 vote281 views1 answer
Natural language processing with python
Python
5 votes290 views2 answers
Python tkinter text get
Python
10 votes316 views5 answers
Discord.py reply to message
Python
0 vote376 views1 answer
How to calculate log 10 in python
Python
0 vote291 views1 answer
How to make a python file that prints out a random element from a list
Python
0 vote303 views1 answer
How to access rows and columns indexing numpy
Python