/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 vote95 views1 answer
Determine how 2 string si equal py
Python
10 votes112 views6 answers
Variable in python
Python
1 vote102 views1 answer
Les librairies python a maitriser pour faire du machine learning
Python
0 vote77 views1 answer
Unique file name in django
Python Django
0 vote95 views1 answer
"serializers" is not defined
Python
0 vote116 views1 answer
Python boto3 ypload_file to s3
Python
14 votes136 views5 answers
How to create requirements.txt django
Python Django
9 votes130 views2 answers
Keras model save
Python
0 vote90 views1 answer
Import data from website pandas python medium
Python
8 votes106 views1 answer
Python ubuntu check if a key is pressed
Python