/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 vote125 views1 answer
Logartim normalization python pandas
Python
0 vote82 views1 answer
Python read textfile
Python
0 vote137 views1 answer
Check accessability of the file
Python
0 vote134 views1 answer
To see what string accept
Python
0 vote128 views1 answer
How to fill an array with consecutive numbers python
Python
0 vote154 views1 answer
Keras unbalanced data
Python
0 vote121 views1 answer
Read JSON files with automatic schema inference
Python
1 vote126 views1 answer
Django populate choice field from database
Python
0 vote132 views1 answer
Python time function duration and memory usage
Python
0 vote139 views1 answer
Python assert is datetime
Python