/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 vote232 views1 answer
How to display printed values without scientific notation python
Python
8 votes224 views3 answers
Python datetime to unix timestamp
Python
1 vote252 views2 answers
GuruTheCoder
Python
0 vote236 views1 answer
Python fill string with spaces to length
Python
8 votes223 views1 answer
Python find runtime
Python
1 vote230 views1 answer
How to Convert Strings to Datetime in Pandas DataFrame
Python
0 vote218 views1 answer
Jouer à Snake
Python
39 votes237 views4 answers
Round down number python
Python
0 vote227 views1 answer
Dataframe number of unique rows
Python
0 vote225 views1 answer
Python default summary statistics for all columns
Python