# Script started at Thu Oct 22 15:25:31 GMT+00:00 1998
nowait disconnect
nowait connect "dogbert.cs.chalmers.se" 6717
nowait message "This program solves the ancient Towers of Hanoi problem.\
\
You have three discs and three poles A, B and C, on which the discs\
can be placed. The discs all have different sizes, and the starting\
position is that the discs are all stacked on pole A, with the largest\
at the bottom, and the smallest on top. The problem is how to move all\
discs, from pole A to pole B. Only one disc can be moved in each step,\
and a larger disc can never be placed on top of a smaller disc.\
<<Press Step>>."
message "The result of the program are the moves needed in order to achieve\
the goal.\
\
This program does not contain any bugs, but shows how the user can\
select a particular part of the program output, and browse the trail of\
the expression responsible for producing that part.\
\
When this script is finished, try to move around the mouse pointer in the\
Program Output window, and see how certain areas get highlighted.\
If you click, the corresponding trail will appear in the Trace Browser.\
<<Press Done and start browsing>>"
# Script finished at Thu Oct 22 15:27:44 GMT+00:00 1998