/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

19 votes160 views6 answers
Python tkinter window size
Python
1 vote160 views1 answer
Python read integer from stdin
Python
0 vote175 views2 answers
Convert decimal to float in python
Python
2 votes161 views1 answer
Dataframe get list of index vlaues
Python
0 vote185 views1 answer
Set a random seed
Python
2 votes152 views2 answers
How to multiply a text in python
Python
0 vote170 views1 answer
Add comma to csv in pandas
Python
7 votes181 views5 answers
Convert categorical variable to numeric python
Python
0 vote195 views1 answer
List Creating List
Python
0 vote170 views1 answer
Xargs to copy file from text files to another directory
Python