/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 vote139 views1 answer
How to send jobs to queue dynamically
Python
0 vote143 views1 answer
Pytorch torchaudio torchvision cu113
Python
0 vote299 views1 answer
~
Python
1 vote165 views1 answer
Pyhton turtle delete
Python
73 votes134 views1 answer
Pip install error
Python
0 vote141 views1 answer
Python chunks iterator
Python
11 votes153 views2 answers
Python program to print list without brackets
Python
32 votes345 views3 answers
Convert list into integer python
Python
0 vote134 views1 answer
Python for skip header line
Python
0 vote146 views1 answer
Atan of number python
Python