Ola.
Well, my A* algorithm is already working very nicely - and imo there
isn't any problem-specific optimization left to implement other than the
data structures holding the nodes themselves. So the question is only
whether it would pay off to switch to D* instead.
Second, I'm aiming for
Hey there.
Thanks for your good work.
I decided to test your xinok sort in my implementation of the A*
algorithm; since the list of open nodes will always be partially sorted,
it should give better performance than the phobos sort.
/Max
On 10/30/2011 12:19 AM, Xinok wrote:
On 10/29/2011
On 10/25/2011 1:44 PM, Trass3r wrote:
I'm working on a bot in D. I'm currently done implementing the A*
algorithm for path finding
Dump A*, D* Lite ftw ;)
Hellooo.
Correct me if I'm wrong, but in A*, I can just find a path, store it
(let's say as a string) and find a new one if it's
On 10/22/2011 6:49 PM, Jesse Phillips wrote:
For those who didn't see. AI Challenge, an event sponsored by Google,
supports the use of D 2.054 and provides a starter pack.
http://ai-contest.com/
http://www.reddit.com/r/programming/comments/ljk4v/
ai_challenge_fall_2011_ants_now_open/
From
