Back to Freecodecamp

Step 12

curriculum/challenges/english/blocks/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dc976bf864693e668d67e8.md

latest460 B
Original Source

--description--

Now call your function and see the output on the terminal.

--hints--

You should call your move() function.

js
({test: () => assert.match(code, /^move\(\s*\)/m) })

--seed--

--seed-contents--

py
NUMBER_OF_DISKS = 3
number_of_moves = 2**NUMBER_OF_DISKS - 1
rods = {
    'A': list(range(NUMBER_OF_DISKS, 0, -1)),
    'B': [],
    'C': []
}
def move():
    print(rods)
--fcc-editable-region--

--fcc-editable-region--