/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 votes221 views1 answer
How to make discord.py rewrite bot dm someone
Python
0 vote203 views1 answer
File "main.py", line 11 if message.author == client.user: ^ IndentationError: expected an indented block
Python
0 vote205 views1 answer
Disbale tkinter textbox
Python
3 votes213 views1 answer
Python count number of unique elements in a list
Python
1 vote213 views1 answer
How to print list without for loop python
Python
0 vote217 views2 answers
How to install python 2
Python
0 vote241 views1 answer
2nd to last index python
Python
0 vote201 views1 answer
Django jinja else if template tags
Python
4 votes202 views2 answers
Python get current user windows
Python
0 vote220 views1 answer
Compile python to exe bash
Python