| |||||||
I was hoping it would be possible for you to include a maximum search area for the A* algorithm. The system does get pretty lagarific if the path takes too long to compute. Perhaps a fall-back to walk_towards, or breaking it up into smaller search areas would suffice?
|
Mar 10 2012, 10:28 am
|
|
Sure, I'll add some way to do this.
|