realbasic-games
[Top] [All Lists]

Re: Generic Game Design Question

To: realbasic-games at lists dot realsoftware dot com
Subject: Re: Generic Game Design Question
From: Lars Jensen <larsjensen at gmail dot com>
Date: Mon, 21 Nov 2005 17:53:55 -0800
Delivered-to: realbasic-games at lists dot realsoftware dot com
Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=fWVQ1BU07m/PHmtRQNOpOnHWK+qchO5wdpUl0cGjUoGuu3ZcBe/+UTy0Y6u9IPm5W4inN6kQw8Y23faxq+9DgJ5EbQm/ayT4aGHJg8rEhtNhWsb+d0yKRsuL+IfSp5BFSwqe/lhgz3uDfPgB03AWTHBNEwR72GAe4jyOxao1Wt4=
> * Every instance knows the 6 other instances around it.

I would generalize this to "given a hex, you need to be able to
iterate the hexes around it", whether or not you implement hexes as
class instances. Classes add complexity; one doesn't want to create
them without a reason. First, set up your coordinate system and define
your algorithms for getting about, then worry about whether a class
structure will help.

> * You'll want to flag if a hex has already been
> "processed" this turn to avoid redundancy.

If the first path identified isn't guaranteed to be the lowest-cost
one, then it's not redundant. For example, you might want to take the
long way around a swamp or mountain.

lj
_______________________________________________
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>

<Prev in Thread] Current Thread [Next in Thread>