I have a question that is not specific to RealBasic, but a general game
algorithm question.
I'd like to develop a game (in Realbasic and several other platforms)
that plays like the old Panzer General series of wargames.
Specifically, I would like when the player clicks on a unit, all the
hexes that the unit can move to are highlighted, so the player can just
then click on the desired destination hex. My design includes the
concept of movement points and terrain costs, so it's not as simple as
counting out a given number of hexes.
In my research on the net, I've heard discussion of "path finding"
algorithms, but they seem to be referring more to 1st person shooter
type games where the AI or game has to figure out the shortest path
between two given points. My problem is the inverse: I need to find
every location within range.
Can anyone suggest or point me to an algorithm that would do what I'm
looking for?
Thanks.
_________
| homas
_______________________________________________
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>
|