Ok, so having just gotten my first lite-c project setup for a-star pathfinding, on a grid system of my own design (each grid square can be divided into 4 quarter, so that a closestnode(x,y) returns the smallest valid node to any point within the "terrain") I'm essentially wondering what other people have come up with in 3DGS for A-Star? Anyone else got a working prototype converted to Lite-C for A7, and do people think having a binary heap for a terrain of my type is worthwhile?

Anyway, as I'm on holidays, I'm just playing with code and avoiding in-laws (all 3 females of the scary strong type) and I think I'll set up a clean version of my code for contributing once I get back (Jan 1 ish)

Don
Have a great day

Basically I have written some form of A* in Lite-C, which does this:
- Divide the surface in grids of a definable size
- Check which nodes are walkable by scanning for models or blocks on that node
- Let the user select a node to walk to
- Using a from of a A* algorithm to select the shortest path towards the node
- Let the NPC walk the path

It features some nasty (not to mention buggy) code, so I need to clean it up. It isn't pure A*, because I wanted to go with a (hopefully) faster approach. But implementing it should be easy.

gotta love messy code I sure do, but I did actually almost enjoy going through reading it for cleanness and taking out all the superceded comments yesterday.

Is there any shared lite-c / c-script pathfinding code in the user contributions that people would like to make a linking thread to be stickied in here?

Don
have a great day

Binary heap is always useful!
And it's really easy to implement.

http://www.coniserver.net/ubbthreads/showflat.php/Cat/0/Number/773829/an/0/page/0#Post773829
direct link to game (if still available)

Win the little game of this post (the game is in english) and you get a 2D grid related A* pathfinding (as well as a maze generator)...

mercuryus

ok i won