Statement:
Considering the
Towers of Hanoi problem,
please, try to provide the optimal movements to transfer all the disks from rod A to rod C.
To get a complete grade (1) is necessary to use the minimal number of movements.
Number of atempts: ilimited
Grade in activity: from 0 (complete wrong) to 1 (complete right)
To the student:
After you accomplished the task (moved all disks), please "click" over the button "Evaluate" or "Send answer" to simulate the process under
iAssign/Moodle.
