🚀 go-pugleaf

	Hello.  I have another idea for the scoring in a text-adv
game.  

	If you were to have two scores, one for `completeness', one for
`number of the _really_ cool puzzles you've solved', it seems to me
that you could have the best of all possible worlds for the player, if
at the expense of some extra proggramming.

	The way I see this, the `completeness' score could be computed
by counting what the minimum number of puzzles left to solve before
finishing, and subtracting this from the number of puzzles needed to
solve the games in the shortest possible route.

	The `number of _really_ cool puzzles you've solved' score, on
the other hand, would be just that: The number of really cool puzzles
the player has solved, perhaps with a brief mention of how many
`_really_ cool' puzzles there are in the game.

	BTW, I mean `_really_ cool' to be defined by the programmer...
It may turn out that the player thinks you're full of it...

				Have Phun!
				  --Dave.

|\            /   / |"This is real,        | davevh@cs.arizona.edu
|  \        /   /   | This is now.         | Thanatos@hacks.arizona.edu
|  / \    / ~~/     | This is a freak      | bv367@cleveland.freenet.edu
|/     \/   /       | show, baby, anyhow." | #include <std_disclaimer.h>

--
|\            /   / |"This is real,        | davevh@cs.arizona.edu
|  \        /   /   | This is now.         | Thanatos@hacks.arizona.edu
|  / \    / ~~/     | This is a freak      | bv367@cleveland.freenet.edu
|/     \/   /       | show, baby, anyhow." | #include <std_disclaimer.h>