/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 vote296 views1 answer
Maximum number of guests on cruise at an instance tcs
Python
1 vote283 views1 answer
Py get mouse coordinates
Python
0 vote265 views1 answer
Compter des valeur consecutives en python
Python
0 vote257 views1 answer
Python getattr function
Python
11 votes262 views4 answers
Python get random character from string
Python
0 vote255 views1 answer
Python generate sine wave pyaudio
Python
0 vote280 views1 answer
Python make an object hashable
Python
1 vote271 views1 answer
Check if can convert to float python
Python
80 votes260 views3 answers
Python remove last part of string
Python
0 vote265 views1 answer
Try open file
Python