/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 vote176 views1 answer
Python: Sending a variable to another script
Python
0 vote183 views1 answer
Jupyter notebook check memory usage
Python
0 vote198 views2 answers
Install kivyMD from git
Python
0 vote217 views1 answer
Django swagger settings https
Python Django
4 votes196 views2 answers
Sqlite to pandas
Python
0 vote179 views1 answer
Saaaaaaaaaaaaa
Python
0 vote176 views1 answer
No limit row pandas
Python
1 vote182 views1 answer
Tkinter app icon
Python
0 vote187 views1 answer
Python pandas remove non-numeric characters from multiple columns
Python
0 vote194 views1 answer
Reading a cell from another cell in colab
Python