/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

9 votes189 views2 answers
Python check if number is in range
Python
1 vote156 views1 answer
Python information
Python
4 votes104 views1 answer
Install unittest python
Python
0 vote163 views2 answers
Python def example
Python
6 votes225 views1 answer
How to open any program on python
Python
20 votes163 views1 answer
ParserError: Error tokenizing data. C error: Expected 1 fields in line 87, saw 2
Python
0 vote154 views1 answer
Align columns to left pandas python
Python
0 vote162 views2 answers
Fill missing values with 0
Python
1 vote148 views1 answer
Dataframe describe in pandas problems
Python
0 vote145 views1 answer
File "<ipython-input-12-48c6c043344b>", line 29 coin = random.randint(0,1) ^ IndentationError: expected an indented block
Python