Newsgroups: rec.arts.int-fiction
Path: gmd.de!xlink.net!howland.reston.ans.net!europa.eng.gtefsd.com!uunet!mnemosyne.cs.du.edu!nyx!pshepard
From: pshepard@nyx.cs.du.edu (Pat Shepard)
Subject: Re: adventure
Message-ID: <1993Oct28.191215.13915@mnemosyne.cs.du.edu>
X-Disclaimer: Nyx is a public access Unix system run by the University
 	of Denver for the Denver community.  The University has neither
 	control over nor responsibility for the opinions of users.
Sender: usenet@mnemosyne.cs.du.edu (netnews admin account)
Organization: Nyx, Public Access Unix at U. of Denver Math/CS dept.
References: <2am2lb$63e@bingsung.cc.binghamton.edu>
Date: Thu, 28 Oct 93 19:12:15 GMT
Lines: 40

In article <2am2lb$63e@bingsung.cc.binghamton.edu>,
Paulie <ba02045@bingsung.cc.binghamton.edu> wrote:
>
>
>Hey:
>
>	I'm just starting to program using the TADS software, yeah got the
>manual and everything. If you know what I mean, there is an adventure pi
ce in
>there involving an airport. Well my question to you all is this:
>
>	I want to restrict the number of moves that a player can make. For
>example, you are a fugitive, and need to find a plane so that you can le
ve
>the country, but the FBI are hot on your tail. You start at the terminal
 but
>know you that time is short. Okay, this little adventure can be complete
 in
>about 30 moves. (I added some things) What is a suggested mutiplying fac
or
>for this scenario? 30*4 = 120 move limit? I mean the adventure is a piec
 of
>cake really, but even though there are a couple of puzzles, the main fac
or is
>that the player has to get the job done quickly.
>
>
>
>-- 
>----              -------
>-----  Paul Bobby  ------
>------              -----


 
The multiplier should depend on how difficult the adventure is.  The best 
way to do it is through playtesting with various people - see how long
it takes your average tester to finish it and set the limit a little bit
above that. 

