New answers tagged

1

300 nodes in 0.03 seconds means only 10,000 nodes per second, which seems rather slow. Before implementing more complicated approaches such as hierarchical partitioning, the first thing I'd do is to optimize the code. Run the profiler to find out which functions are using the most time. It is often surprising where the time goes, and it is a waste of your ...


2

As you yourself have stated, you still didn't have resorted yet to optimizations. So yes, there are many ways to speed that up. But since you were talking in general terms, I will stick with what I think is the best general guidance for improving path-finding performance: decrease the size of the problem. Or in other words, search less and search smaller. ...



Top 50 recent answers are included