/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

1 vote385 views1 answer
Model evaluate function
Python
0 vote337 views1 answer
File handling in python append byte
Python
1 vote347 views1 answer
How to make a kivy label multiline text
Python
2 votes335 views1 answer
Hyperlinks in jupyter notebook
Python
2 votes351 views1 answer
How to represent equation in Pytho
Python
70 votes343 views2 answers
Run a for loop in python
Python
18 votes353 views5 answers
Discord.py get user input
Python
11 votes357 views4 answers
Length of string python
Python
8 votes363 views1 answer
Python startswith
Python
-1 vote337 views1 answer
Python date from yy/mm/dd to yy-mm-dd
Python