Is there a known 'most efficient' version of the A* search algorithm? I know some people write papers on the most efficient way to compute common operations, has this been done for A*?
2 of 2
improved title, revised tags
Is there a known most efficient version of A* search algorithm?
Dollarslice
- 3.5k
- 6
- 32
- 49