/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

0 vote184 views1 answer
How to write flow of execution in python
Python
0 vote171 views1 answer
Return positon of ele in list python
Python
0 vote184 views1 answer
Add variable to print python
Python
0 vote190 views1 answer
Python fibonacci sequence for loop
Python
2 votes191 views2 answers
Pyinstaller exe version info
Python
2 votes195 views4 answers
Python hash
Python
0 vote229 views1 answer
Python pick one item from list
Python
0 vote185 views2 answers
How to map longitude and latitude in python
Python
0 vote191 views1 answer
Python indian currency formatter
Python
1 vote209 views1 answer
Python delete text in text file
Python