/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

6 votes195 views1 answer
Run py file in another py file
Python
0 vote159 views1 answer
Difference in django project view and app view
Python
36 votes169 views6 answers
Requirement.txt for python
Python
8 votes157 views5 answers
Django message framework
Python
0 vote207 views1 answer
Logarithmic scale fitting python
Python
51 votes168 views6 answers
Open and read a file in python
Python
0 vote170 views1 answer
Datetime day deutsch python
Python
0 vote197 views1 answer
How to make a config txt file on python
Python
0 vote173 views1 answer
Remove occurence of character from string python
Python
0 vote131 views1 answer
Error: getaddrinfo ENOTFOUND www.python.org www.python.org:443 Downloading Python failed. Error: { Error: getaddrinfo ENOTFOUND www.python.org www.python.org:443
Python