/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

13 votes162 views3 answers
Python http server command line
Python
1 vote168 views2 answers
Get user ip address django
Python
0 vote174 views1 answer
Pandas eliminar filas de un dataframe con una condicion
Python
8 votes119 views1 answer
How to get specific columns in df
Python
0 vote185 views1 answer
"api_view" is not defined django
Python Django
22 votes156 views6 answers
Try catch python
Python
0 vote170 views1 answer
Lists and for loops
Python
9 votes156 views2 answers
Tar unpack to folder
Python
0 vote164 views1 answer
A GDAL API version must be specified. Provide a path to gdal-config using a GDAL_CONFIG environment variable or use a GDAL_VERSION environment variable.
Python
2 votes184 views2 answers
Difference between = and is not python
Python