/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

1 vote194 views1 answer
Remainder identifying python
Python
0 vote187 views1 answer
Python from string to bytes to hex
Python
0 vote198 views1 answer
Cv2 get framerete video
Python
0 vote241 views1 answer
Staff user is not restricting permission in django
Python Django
3 votes209 views2 answers
Vertical line in matplotlib
Python
1 vote194 views1 answer
Flask set cookie
Python
-1 vote169 views1 answer
Image analysis python
Python
0 vote218 views2 answers
Python diccionario setdefault
Python
3 votes206 views2 answers
How to add list numbers in python
Python
0 vote182 views1 answer
Sys.maxsize in python
Python