/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

35 votes214 views5 answers
Python logging levels
Python
0 vote207 views1 answer
Structural pattern matching python
Python
-1 vote281 views2 answers
If __name__=='__main__':
Python
0 vote203 views1 answer
Python global site packages
Python
1 vote191 views1 answer
Filter dataframe columns vy a list of columns
Python
0 vote204 views1 answer
Python print numbers 1 to 10 in one line
Python
-1 vote281 views1 answer
Python code variable declaration
Python
1 vote215 views1 answer
Import CSV Files into R Using fread() method
Python
0 vote227 views1 answer
Python replace \n with something else
Python
0 vote224 views1 answer
What are data types in python
Python