Strip miner AA is getting too big, and loop has no yields #6
Labels
No Label
bug
duplicate
enhancement
help wanted
invalid
question
wontfix
No Milestone
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies
No dependencies set.
Reference: bans-minecraft/bans-automata#6
Loading…
Reference in New Issue
Block a user
No description provided.
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Currently our scan of the open set has a significant time complexity, as we're iterating over the open-set twice far too often.
The inner for-loop is used to find the node with the lowest
fScore
in the open set. This can get very expensive as the open set expands in size. We are seeing this start to manifest in the bots as aToo long without yielding
error being raised from the runtime.To address this, we need to make a couple of changes:
fScore
. This way we can pop a node from the min-heap (or priority queue) and know that it is the lowest scoring node. This adds a bit more cost to each insertion, but will massively reduce the amount of processing required for the bots to path-find.