When replying to digests:
- edit your Subject line - be specific!
- quote only the message parts you need to
Today's Topics:
1. general strategy for moving through a maze (Josh Meyer)
2. anyone have xplat rbpicture > texture code? (Mike Woodworth)
3. Re: general strategy for moving through a maze (joe at strout dot net)
----------------------------------------------------------------------
Message: 1
Subject: general strategy for moving through a maze
From: Josh Meyer <jmeyer at msg dot ucsf dot edu>
Date: Sun, 25 Jun 2006 13:23:46 -0700
I'm trying to figure out a general strategy for programming with
mazes. I think the general idea is to divide the maze into square
cells and then have an array of booleans to determine which sides of
each cell have walls. For example, (true, false, true false) might
describe a cell with a wall on the top and bottom, and openings on
the left and right.
Any tips about how to proceed from there? Basically I have a maze
written out on paper and I want to just have a computerized version
of it which uses the arrow keys to move through it.
thanks in advance,
Josh
==================================================
Message: 2
Subject: anyone have xplat rbpicture > texture code?
From: Mike Woodworth <mike at divergentmedia dot com>
Date: Sun, 25 Jun 2006 10:22:16 -0400
hey all,
i'm trying to clean up some of this code so i can post a sample of
shaders in RB. but i realized that i've optimized myself into a
corner here - all the code i've written for loading images into
textures relies on a laundry list of assumptions, the largest of
which is that the code is running on osx. i'd love to get this
posted, but the next few weeks are slam time... if someone has a
xplat rb picture > texture code snippet i can simply paste in, i
should be able to sneak this out the first part of this week.
thanks,
mike
--
Mike Woodworth
mike at divergentmedia dot com
==================================================
Message: 3
Subject: Re: general strategy for moving through a maze
From: joe at strout dot net
Date: Mon, 26 Jun 2006 09:14:51 -0600
On Jun 25, 2006, at 20:23 UTC, Josh Meyer wrote:
I'm trying to figure out a general strategy for programming with
mazes. I think the general idea is to divide the maze into square
cells and then have an array of booleans to determine which sides of
each cell have walls. For example, (true, false, true false) might
describe a cell with a wall on the top and bottom, and openings on
the left and right.
Well, you really only need to keep track of two sides (unless you want to
support one-way doors). For example, you could keep track of whether each cell
has a wall above and to the left. When going down or to the right, you'd just
check the next cell over.
Any tips about how to proceed from there? Basically I have a maze
written out on paper and I want to just have a computerized version
of it which uses the arrow keys to move through it.
Right. Well, start by writing code to draw the maze. Come back if you get
stuck, and ask a specific question about the sticking point.
Best,
- Joe
--
Joe Strout -- joe at strout dot net
Verified Express, LLC "Making the Internet a Better Place"
http://www.verex.com/
==================================================
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives of this list here:
<http://support.realsoftware.com/listarchives/lists.html>
End of realbasic-games Digest, Vol 27, Issue 16
***********************************************