Robocode Guide vie explanation of a top robot

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

Return to Thread:Talk:Robocode Guidebook/Robocode Guide vie explanation of a top robot/reply (10).

Quick note, I'd tend to advise against using my kd-Tree (espescially the "3rd gen' one) in a bot which is meant for use in such a guide as is being discussed here, especially if the guide wishes to touch on what the kd-Tree itself does. While I tried to keep readability reasonable, there are plenty of places where I sacrificed simplicity for raw performance.

For a bot used for this type of purpose, it might be fine to go with a simple linear k-NN search even. For 35 round battles, it's normally not too slow if implemented well, and it a tiny fraction of the amount of code to implement a kd-tree.

Rednaxela01:25, 6 March 2013