<story><title>JPS+: Over 100x Faster than A* (2015) [video]</title><url>http://www.gdcvault.com/play/1022094/JPS-Over-100x-Faster-than</url></story><parent_chain></parent_chain><comment><author>amitp</author><text>Title&amp;#x27;s misleading. A* is also 100x faster than A* ;) It depends a lot on the graph you give it.&lt;p&gt;JPS by itself (not JPS+ in this video) is notable for not requiring any precomputation to achieve some speedup.&lt;p&gt;If you&amp;#x27;re willing to precompute some things, there are lots of other techniques available for unweighted grid maps. &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;www.cs.du.edu&amp;#x2F;~sturtevant&amp;#x2F;papers&amp;#x2F;GPPC-2014.pdf&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;www.cs.du.edu&amp;#x2F;~sturtevant&amp;#x2F;papers&amp;#x2F;GPPC-2014.pdf&lt;/a&gt; has an overview of techniques and some benchmarks that use real-world game maps (Baldur&amp;#x27;s Gate, Dragon Age).&lt;p&gt;I believe the &amp;quot;goal bounding&amp;quot; from the video is called &amp;quot;arc flags&amp;quot; in the literature.</text></comment>
<story><title>JPS+: Over 100x Faster than A* (2015) [video]</title><url>http://www.gdcvault.com/play/1022094/JPS-Over-100x-Faster-than</url></story><parent_chain></parent_chain><comment><author>justinhj</author><text>Not to take anything away from the work but I think the title is misleading. A* is an optimal algorithm for graph search so you cannot make it 100x faster. What this does is make path finding faster by changing the structure of the graph.</text></comment>