Castle Paradox

[Bagne]

How does the NPC hero-avoidance behaviour work:
Do they avoid the hero's tile coordinates, or the hero's pixel coordinates?

I might be "putting" a hero in between two tiles (and having NPCs avoid him).
If multi-threads happens before I actually commit to making this part of my game (not sure when I will), I might write my own behaviour for the NPCs.
_________________
Working on rain and cloud formation

[TMC]

Tiles. Pretty much all of the map walkabout logic uses tiles, and there's a lot of weird behaviour resulting, like NPCs getting stuck if they're partway between tiles.

The thing to remember is that the tile an NPC or hero is on is defined to be the tile that its top left corner is on.

The NPC movement types are all really primitive, but I don't want to change them because it would change lots of old games. May have to add lots of new movement types (like chase/avoid that uses simple pathfinding), but it could get confusing. Also, I want to add parameters to each movement type, so for example you could specify how often a "Random" NPC moves, how often/far it walks in deliberate paths to random nearby destinations, etc.

Adding NPC movement scripts is going to be pretty cool. I really ought to fast-track multitasking/script threads/that stuff over the other new script features.
_________________
"It is so great it is insanely great."

[Bagne]

Sounds cool!
So by path-finding, do you mean a command where you say
WALK NPC TO XY (destinationX,destinationY)
and it does a magical A* algorithm, and walks there on its own?

I was thinking of writing up an A* thingajig ... it could come in handy ... but I don't know the theory behind it or anything. There's pseudo-code on wikipedia, but I didn't follow it very well :-S
I don't know the definition of all these open and closed sets ... or how to describe a graph node in Hspeak.
Slices make good tree nodes, because both are structured hierarchially, but graph nodes don't appear to be hierarchical, so slices might not work as well ... although I suppose you could do it differently and store handles of adjacent graph nodes in their extras.
_________________
Working on rain and cloud formation

[TMC]