Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!mit-eddie!bloom-beacon!eru!hagbard!sunic!news.funet.fi!uwasa.fi!uwasa.fi!ts
From: ts@uwasa.fi (Timo Salmi)
Newsgroups: comp.binaries.ibm.pc.d
Subject: Classic Hangman and Towers of Hanoi at uwasa.fi
Message-ID: <1990Dec15.174723.4982@uwasa.fi>
Date: 15 Dec 90 17:47:23 GMT
Sender: ts@uwasa.fi (Timo Salmi)
Organization: University of Vaasa
Lines: 26

Sat 15-Dec-90: Christmas time is approaching so I introduced a fifth
package of games programs and called it /pc/ts/tsgmee10.arc. This
one contains nothing original, just repeats of old well-known games
in new clothes.
   First there is the classic puzzle of the Towers of Hanoi, where
you have to move a pile of rings from one pole to another subject to
certain rules. The program includes a demo mode where the program
performs the moves. This involved an interesting piece of recursive
programming somewhat more complicated than the well-known task of
calculating factorials.
   The second game in the package is the common hangman. You have to
guess a word letter by letter or be hung. In my opinion hangman
basically has a definite educational flavor despite its hang-em-hi
outward appearance. One twist is to use words from a foreign
language as the vocabulary file. (Recall that from a Finnish point
of view e.g. English is a foreign, albeit a familiar language). The
input of my hangman is timed, that is there is a time limit for
entering a guess.
   Both programs use and require EGA compatible graphics. Both games
selftest against infections.
   Available as usual from uwasa.fi archives.

..................................................................
Prof. Timo Salmi        (Moderating at anon. ftp site 128.214.12.3)
School of Business Studies, University of Vaasa, SF-65101, Finland
Internet: ts@chyde.uwasa.fi Funet: gado::salmi Bitnet: salmi@finfun