How to path around blocked tiles with jumper?

[Brah]

Either Dijkstra, Breadth First Search or Flood Fill. I have no idea which one to use

[dusoft]

Check this:
https://github.com/Yonaba/Jumper/tree/m ... per/search

and maybe update your code to this version.

I tried using that version of Jumper and it causes my games to crash.

I was using 1.8.1, but that misses Theta*. Crashing is probably due to a larger map. I tested 1.8.1 and it worked well with 100 by 100 grid.

[dusoft]

Either Dijkstra, Breadth First Search or Flood Fill. I have no idea which one to use

You might need to experiment with speed of finding your path. Just run a test over 100 times using one algo, then a diferrent one and benchmark times.