Re: A computer maze

Philip Shead (phil@nospam.socs.uts.edu.au)
Thu, 16 Mar 1995 16:15:27 +1000 (EST)

Farzad Doraius Battiwalla mumbles..
>
> To whom it may concern....
>
> I'm currently interested in writting an AI (Artificially Intelligent)
> maze solving program.
>
> It is known that the computer CANNOT see the full maze and only knows the
> path through which it has already traversed. An analogy could be:
> you have been placed inside a maze, and must find your way through the
> maze, without prior knowledge of the full maze. (Bummer Huh)
>
> A sample of the maze may look like: (This is very BASIC - The maze prog.
> must be able to solve more complex problems)
>
>
> 1111111
> 1S10001
> 1010101
> 10001E1
> 1010111
> 1010101
> 1010001
> 1111111
>
> 1 - Defines a wall
> 0 - Defines the path (Walkable)
> S - Is the start
> E - Is the end
>
> Any suggestions or comments will be appreciated.
>
> Cheers,
>
> Fuzzy (Farzad Battiwalla; E-Mail: fdbattiw@nospam.SOCS.uts.edu.au)
>
>
if your allowed to use recursion then go for it, you have this in your
data structure and algorithm notes , if not i am sure you will be able
too find info on this somewhere else.

-- 
            Phil Shead          |             Ph: +61-2-417-1864. 
                                | E-mail:  work : phils@nospam.comnet.oz.au 
    University of Technology,   |           Uni : phil@nospam.socs.uts.edu.au or
             Sydney.            |                 pgshead@nospam.banksia.its.edu.au