<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>praeclarum</author><text>&quot;speeds up pathfinding on uniform-cost grid maps&quot;&lt;p&gt;How useful are uniform-cost grids? Every implementation of A* I&apos;ve ever used has been applied to varying-cost grids.</text><parent_chain></parent_chain></comment><story><title>Faster pathfinding using Jump Point Search</title><url>http://harablog.wordpress.com/2011/09/07/jump-point-search/</url><text></text></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>wingerlang</author><text>Is it just me or does the Vanilla-A* algorithms look too bad? I mean especailly in the second image [(d) A* (Adaptive Depth)], why does it search behind itself?</text><parent_chain></parent_chain></comment><story><title>Faster pathfinding using Jump Point Search</title><url>http://harablog.wordpress.com/2011/09/07/jump-point-search/</url><text></text></story>