yeah the world open dyanamic infinite procedutal terrain and a breadth first search in py was quite slow,
jps I have working in py, but it’s also quite slow when rebuilding the grid sim each pathing, right now each agent paths a 32x32 node area around them in py,
this is my current setup
with compiled code I could run the same search with more agents and a larger pathing area.
currently it’s like a very much improved seek.
but if the obstacle is too large the pathing will fail atm.
with 64x64 path or 96x96 I think the units will be quite smart witbout having to rebuild the whole world grid area each time tiles are added or removed. (202 tiles x(17x17)) vertex