godot

>Still not convinced? How about this: A* is supposed to run in O(n*log(n)). By implementing the open list as an unsorted flat array, instead of a binary heap, its runtime changes to O(n^2). gradstudent, I understand the implications of making the algorithm more efficient. You're still not getting the point that the video I linked points towards, though. An inefficient solution works if it works well enough for enough people. When you're building an engine that contains many moving parts you don't want to spend too much time optimizing each part to the best of your abilities because if you do that you'll never have a product that people can actually do something with. That's not even to get into the main point, which is that you don't need to run the pathfinding algorithm every frame and that most of the time it actually isn't an issue. So

Godot 3.0 has been one year in development (since the release of Godot 2.1 in August 2016), and I wouldn't say it's in a "very early stage". It's almost feature-complete, tons of bugs have been eradicated already, and the stable release is should be 2-3 months away. As for slow developments... I don't know where you're taking that? Godot has dozens of commits every day, and the pace at which 3.0 features were implemented is honestly impressive (I'm obviously biased as a Godot dev, but check the GitHub repo [0] and the monthly progress reports on the devblog [1]). Godot has been in development since 2007, open sourced in 2014, and has had 400+ contributors [0] over 3 years vs 32 [2] for Atomic over 2 years. On the other hand, young Atomic is an overlay on the mature Urho3D project with 100+ contributors [3] and over 6 years of development.

Thankfully someone's done it [1] [1] https://github.com/godotengine/godot/issues/11492

I hope the quality of their pathfinding code is not indicative of the overall quality of this engine: https://github.com/godotengine/godot/blob/master/core/math/a... They scan the entire open list and recompute the heuristic value for every node all so they can find the min. Yikes! Seriously guys, implement a binary heap. It's easy and your pathfinder will be much faster for it!

I got curious to see how much effort was spent on this task. Following the commit log of the coder who ported to Haiku, it was a matter of mostly adjusting the build process/includes to point to the right lib and fixing some method signatures. https://github.com/godotengine/godot/commits?author=Max-Migh...