Re: TIB: BFS Final game

To: ti-basic@lists.ticalc.org
Subject: Re: TIB: BFS Final game
From: Jody Snider <jody1@alaska.net>
Date: Tue, 26 Jan 1999 16:05:45 -0800
Delivered-To: ti-basic-outgoing@towerguard.unix.edu.sollentuna.se
Delivered-To: ti-basic@lists.ticalc.org
References: <c2a3dfa4.36ae2d68@aol.com>
Reply-To: ti-basic@lists.ticalc.org

ETTamme1@aol.com wrote:
> 
> In a message dated 1/25/99 8:43:55 PM Eastern Standard Time, jody1@alaska.net
> writes:
> 
> <<
>  >>
> the random generator is a good idea, and definitly feasable, but i am making
> an rpg so i think the levels should be planned.  I will try using the graph
> screen, i think i can get rid of the matrix witout making it random and i can
> either get rid of the lists, or at least make them shorter

Sounds good.  I think that you can probably use pixel test to eliminate
the need for the both the matrix and the list.  Then all you need to do
is have a bunch of programmed line commands from within the program to
make each level.

I was just thinking of the program you sent me.  If I understood you
correctly the lists were for identifying the walls.  But wasn't anything
that wasn't a space an obstacle?  If it was then wouldn't you just have
to check the matrix in the spot you wanted to move to and see if it was
an open space.  If it was you could move there, if wasn't then you
couldn't. 

Jody Snider
jody1@alaska.net

References:

Re: TIB: BFS Final game

From: ETTamme1@aol.com