I've let run the latest development build a whole day in the fastest "real-time" mode available. And here are the results. This post will also explain various major changes which are going to happen in the next versions.
Also, I know there's a few coders reading this blog, so I guess you'd love reading about this "new" path-finding algorithms (read it, seriously) which have the same advantages as the good old A* with a 10x speed factor. That's something I may give a try as my pathfinder algorithm is basically my biggest bottleneck in terms of performances. The second one is especially interesting given how easy it is to implement, but it can't manage a weight for each node (meaning that it's a no-go for GRA but others should find it very very useful). The first one could be a winner, but it requires way more changes in my current code. Don't forget to read the PDF linked by the article as they are the real stuff.
Anyway, let's talk about GRA !
