I'm wondering, I have a grid of 50x50... and A* takes about 1.4 ms going from bottom left to top right, and there are no obstacles.
My implementation is using diagonal heuristics and PriorityQueue for both open and closed lists, although using a LinkedList for closed set doesn't matter much.
I have tried AIJ (https://aij.dev.java.net/
) ... and it runs 0.8 ms (same setup, 50x50 grid and going from bottom-left to top-right). Although the first few attempts run anywhere between 1-8 ms, but after those it constantly runs at under 0.8 ms.
Clearly, mine is taking nearly twice as long, just wondering what could be the problem
(Of course this is also relative to the computer being run on.)
Any general ideas? If anyone that knows A* in and out is interested in checking out my code, please let me know... I'll PM you a link.