ID:1245120
 Apr 23 2013, 7:16 pm
|
|
Not much to say, just that there's a very neat learning aid which shows you how different pathfinding algorithms work.
| |
|
Apr 23 2013, 7:18 pm
|
|
Zane444
 |
Pretty much exactly the same way path finding is handled in SA, pretty sure this was used as reference. Awesome find!
|
Someone should make a library related to this.
| |
I created an entire maze, and of course I knew the algorithm would solve it, I had fun anyways.
| |
There are already several tutorials for A* searching, but as far as I know there aren't any for best-first or any other search algorithm.
| |
I've yet to find any tutorial on Jump Point Search. I want to actually see how the algorithm works, not really look at someone's Java code which seems to be all over the internet.
| |
Solomn Architect wrote:
I've yet to find any tutorial on Jump Point Search. First result on google: http://gamedev.tutsplus.com/tutorials/implementation/ speed-up-a-star-pathfinding-with-the-jump-point-search-algor ithm/ | |
Tutorials written for BYOND, Meta.
Flysbad wrote: Where could I find some of these tutorials at?http://www.byond.com/developer/?text=pathfinding&sort=pop | |
I've been to this link, but the explanation is hazy at it's most definitive. There's no step-by-step model of how it works.
| |
That's really cool. I'd be right in saying that jump point search is the best?
| |
Jump point seems to be the best, amazingly fast on spiral mazes.
Here's a comparison http://imgur.com/a/alFZX The jump point is so fast, but keep in mind that even the A STAR would finish just fine in a single frame, (fps of 40 gives you 25 ms of processing time before the next frame will need to execute)... I believe the downfall of jump point is it assumes a uniform grid, meaning, if you'd like your AI to use roads to get somewhere faster vs driving slower in the grass, Jump Start wouldn't work for you without tweaking it out. | |
