THE ELEPHANT'S GRAVEYARD by Peter Shaw from ZX Computing Aug/Sep.1982 Join Peter Shaw in Darkest Africa, as you attempt to find the famous "Elephant's Graveyard". All you need is your native cunning, and a 16K ZX81. Explorers equipped with ZX Spectra will be allowed to take part. You start the game with 100,000 KES (the local unit of currency), donated by generous people who believe the spirit of the old explorers is not yet dead. With this money you have to buy supplies, and hire natives to help you trek through the jungle and carry your supplies. Each of these assistants eats one food pack a week. When you've bought your supplies, the game proper gets underway. The game lasts five rounds, with each round equal to one week. If you survive all five weeks, then you complete the game at the gates to the Elephant's Graveyard. If, however, you run out of money during the game, or food, or even natives, the screen goes black, and it is all over. There are a number of nasty surprises awaiting you within the jungle. Variables used: A - KES C - five week loop N - natives F - food G - guns (with ammo) T - tents I - weekly pay for natives B, D, H, X, Y, Z - various inputs and loops A$- various string inputs B$- used in the electric storm subroutine Notes on program structure Lines 120-290 Ask how many of everything is wanted 336-520 Five week loop 580-750 Success routine 1000-4030 Hazard subroutines 4500-4550 Perfect week subroutine 7000-7050 Situation subroutine 8500-8680 Failure subroutine -- Another Fine Product transcribed by: Jim Grimwood (jimg@globalnet.co.uk), Weardale, England --