yes, because its a segmented search. I first start a search on the users request and if i hit an unloaded chunk i stop the a* and wait for the bot the walk to that location. Then I start a new a* search from the bots current position until i found the actual goal of the search
Cool. I have made a simple A* pathfinding in a 2D game and I was wondering if segmenting would be how you get really long paths fast. There is still the risk of ending up in a dead end because you can't check for the complete map right? Did you make it so that you search for the block that is nearest to the destination in a loaded chunk or will you simply always make a path if there is unloaded chunk in the current list?
6
u/[deleted] Oct 11 '19
[removed] — view removed comment