gopenshaw
commented
9 years ago The ducks miners are consuming over 8000 bytecode per round. It looks like they're the ones doing bfs.
Closed gopenshaw closed 9 years ago
gopenshaw
commented
9 years ago The ducks miners are consuming over 8000 bytecode per round. It looks like they're the ones doing bfs.
gopenshaw
commented
9 years ago We have implemented this. :+1:
We have talked about this a bit. We may want to determine a location that is close to the HQ and all of the towers. It is easy to figure out a path from that point to all of the towers, because we can do that on our side and we know the opponent's structures will have the same layout.
This would allow us to do one main path that would connect the two bases, and we could have smaller paths that would go from those points to the HQ. This is just an idea though...
The real issue is how we will handle the cases when we have unknown squares. I have a scout robot, but it is hard to guarantee exactly when the entire map will be known. We need to have the bot fail gracefully and fall back to other navigation.