These are solutions for the text adventures which were once written on the Phoenix mainframe at Cambridge
University, from 1978 until about 1989. Once they were classics among adventures, but they're out of fashion now,
mainly because they are particularly difficult and rather unforgiving. They were, after all, written by academic
mathematicians for academic mathematicians. In addition, most - but not all, see for example Spycatcher - consist
mainly of the collection of treasures, and not about story telling, which is no longer popular, either. Nevertheless,
for the right player, they are still among the best written in the genre. If you want to try them, you can find them
in the IF Archive.
For the very curious there is also a document with some statistics of these games.
There are documents for:
The interactive hints need a ZCode 'terp; see for those the page above this one. The games which don't have interactive hints already had official hints, either in their manual or, in the Topologika version, in the program itself. Two games - Avon and Spysnatcher - already had a complete walkthrough, written by their implementor for reviewers and testers; I didn't see the need to make a new one.
(Klik hier voor de Nederlandse versie van deze pagina.)