| This robot arm can rotate 180
degrees, lift up and down, and open and close its claw to pick
up, move, and stack the four colored rings.
The programs provided make the robot solve the
classic
Towers of Hanoi puzzle, which involves moving a stack of
rings from one pole to another, with one spare temporary pole to
use. The problem is, the rings are different sizes and stacked
in decreasing size, and the rule is that you cannot stack a
larger ring on top of a smaller ring. So, the solution is not
trivial or immediately obvious. The programs provided (both Word
Blocks and Python versions) solve the puzzle using the classic
recursive algorithm to this puzzle and then make the arm execute
all the necessary moves.
|
