[taneq]

I was surprised at how much slower the Jump Point Search variants were than vanilla A-star. I thought it was meant to be an order-of-magnitude optimisation over A-star?

Also, any idea what the 'Trace' algorithm at the bottom is? It seems significantly faster/more efficient than the others but I can't find it in the github repo and the live version of the library is minified.

Edit: Ugh, how do I escape an asterisk? >.<