Breaking News: Grepper is joining You.com. Read the official announcement!

python towers of hanoi recursive

Mackerel answered on May 12, 2021 Popularity 8/10 Helpfulness 4/10

answer python towers of hanoi recursive

python towers of hanoi recursive

Comment

# 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)

Popularity 8/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: python towers-of-hanoi

Link to this answer
Share Copy Link

Contributed on May 12 2021

Mackerel

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

python towers of hanoi recursive

Contents

More Related Answers

python towers of hanoi recursive

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.