/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 vote261 views1 answer
Line plot python only years datetime index
Python
0 vote222 views1 answer
How to send variable to python using xlwings
Python
4 votes222 views2 answers
Python map input
Python
0 vote224 views2 answers
List from comma separated string python
Python
0 vote246 views1 answer
Sumif in python on a column and create new column
Python
13 votes238 views6 answers
Python format decimal
Python
0 vote215 views1 answer
Django ninja "schema"
Python
16 votes265 views6 answers
Fillna with mean pandas
Python
0 vote222 views1 answer
Remove stopwords from list of strings python
Python
3 votes243 views6 answers
How to import nltk
Python