Maze Algorithms

Article View: rec.games.programmer

Article #1914

Back to rec.games.programmer Previous Next

#1914

From: Art Min
Date: Sun, 10 Jan 1993 09:26

16 lines
977 bytes

Hello everybody,

I was wondering what's an effecient way of keeping track of
a maze in a programming sens. If I'm going to design a game like Wizardry I,
you know a 3-D view, how should I keep the maze in memory? I mean
how do you keep track of what walls are ahead of the player efficiently.

Do you just keep in memory a little bit of the maze? What's
an efficient way to represent it (each wall as a bit?) in the file?

ANY INFORMATION will be GREATLY appreciated!!!!

Thanks,

Art
awmin@athena.mit.edu

Technical Details

Message-ID: <1993Jan10.092644.7165@athena.mit.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!enterpoop.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!awmin

Show Full Headers

Complete Article Headers

Newsgroups: rec.games.programmer
Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!enterpoop.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!awmin
From: awmin@athena.mit.edu (Art Min)
Subject: Maze Algorithms
Message-ID: <1993Jan10.092644.7165@athena.mit.edu>
Keywords: maze algorithms
Sender: news@athena.mit.edu (News system)
Nntp-Posting-Host: w20-575-40.mit.edu
Organization: Massachusetts Institute of Technology
Date: Sun, 10 Jan 1993 09:26:44 GMT
Lines: 16