/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 vote143 views1 answer
Check if any entries arte none
Python
5 votes146 views1 answer
Python check file extension
Python
16 votes145 views6 answers
Pandas merge multiple dataframes
Python
7 votes146 views2 answers
Python encode comment
Python
6 votes186 views3 answers
Pandas to csv without header
Python
1 vote143 views1 answer
Typage in python
Python
1 vote145 views1 answer
Pandas pad method
Python
0 vote145 views3 answers
Python multiplication table while loop
Python
1 vote161 views1 answer
Django add to cart
Python
0 vote161 views1 answer
Randomly splits this DataFrame with the provided weights
Python