/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 votes206 views3 answers
Python remove empty list
Python
0 vote210 views1 answer
How to add a key and a value to a dictionary in python\
Python
0 vote203 views1 answer
Python utf upper()
Python
0 vote193 views1 answer
Matplotlib rc params
Python
0 vote197 views1 answer
Printed in a comma-separated sequence on a single line.
Python
1 vote210 views1 answer
Google colab save faild
Python
1 vote207 views2 answers
Count elements in columns pandas
Python
1 vote243 views1 answer
Passing user instance django form submission
Python Django
0 vote232 views1 answer
Python pair two lists into a dictionary
Python
3 votes198 views1 answer
Count number items in list python
Python