most efficient A* search algorithm
<p>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*?</p>

<p>specifically this is to search a weighted graph for pathfinding in a game.</p>
