Difference between revisions of "DeBroglie"
Jump to navigation
Jump to search
m (typo) |
(Some updates, including White Whale entry on Dookious.) |
||
Line 10: | Line 10: | ||
| author = [[User:Tkiesel|Tkiesel]] | | author = [[User:Tkiesel|Tkiesel]] | ||
| extends = [[AdvancedRobot]] | | extends = [[AdvancedRobot]] | ||
− | | targeting = [[Dynamic Clustering]] | + | | targeting = [[Dynamic Clustering|DC]] - [[GuessFactor|Guess Factors]] |
− | | movement = [[Wave Surfing]] | + | | movement = [[Dynamic Clustering|DC]] - [[Wave Surfing]] |
− | | current_version = | + | | current_version = rev0054 |
− | | best_rating = | + | | best_rating = 64 |
| license = [[RWPCL]] | | license = [[RWPCL]] | ||
}} | }} | ||
Line 23: | Line 23: | ||
; What's special about it? | ; What's special about it? | ||
− | : The targeting and movement | + | : The targeting and movement draw on a central Universe object that contains the entire situational picture, with a Bot object that represents each robot on the field. To fire or dodge, data is pulled from a kD-tree, constructed into a histogram with no quantization in the x-dimension. I've done everything I can to avoid slicing/quantizing data until the very last point where the pseudo-kernel density bit happens. |
; How competitive is it? | ; How competitive is it? | ||
− | : It's | + | : It's been crawling slowly up the top 100 with each revision. Only 11 bots do better 1v1 against [[DrussGT]], which actually surprises me given how little of the code specific to high-end opponents has been written yet. |
== Strategy == | == Strategy == | ||
Line 42: | Line 42: | ||
; Can I use your code? | ; Can I use your code? | ||
− | : Through | + | : Through rev0054, DeBroglie is available under the [[RWPCL|RoboWiki Public Code License]] (RWPC) - Version 1.1 or any later version. A bit of a modification to licensing is coming soon for subsequent versions. |
; What's next for your robot? | ; What's next for your robot? | ||
: Get the movement and targeting systems squared away and cleaned up. | : Get the movement and targeting systems squared away and cleaned up. | ||
− | ; Does it have any [[White Whale]] | + | ; Does it have any [[White Whale|White Whales]]? |
− | + | * In rumble terms, '''[[CassiusClay]]''' - I've been in awe of that bot since finding Robocode in 2007. Climbing above it in the RoboRumble is priority #1. | |
+ | * One on one, '''[[Dookious]]''' - Just a stunning bot. If deBroglie can beat this one head-to-head, I'll think I've accomplished something. | ||
; What other robot(s) is it based on? | ; What other robot(s) is it based on? |
Revision as of 03:27, 8 June 2012
- Sub-pages:
- Version History - Archived Talk 2010
deBroglie | |
Louis de Broglie, winner of the 1929 Nobel Prize for Physics | |
Author(s) | Tkiesel |
Extends | AdvancedRobot |
Targeting | DC - Guess Factors |
Movement | DC - Wave Surfing |
Best Rating | 64 |
Current Version | rev0054 |
Code License | RWPCL |
Background Information
- Where did you get the name?
- This is my first wave surfing bot, and I'm a physicist by training, so it's named in honor of Louis de Broglie, who discovered that matter has wavelike properties. This was a foundational discovery in Quantum Mechanics. In 1929 de Broglie received the first ever Nobel Prize given to a student thesis.
- What's special about it?
- The targeting and movement draw on a central Universe object that contains the entire situational picture, with a Bot object that represents each robot on the field. To fire or dodge, data is pulled from a kD-tree, constructed into a histogram with no quantization in the x-dimension. I've done everything I can to avoid slicing/quantizing data until the very last point where the pseudo-kernel density bit happens.
- How competitive is it?
- It's been crawling slowly up the top 100 with each revision. Only 11 bots do better 1v1 against DrussGT, which actually surprises me given how little of the code specific to high-end opponents has been written yet.
Strategy
- How does it move?
- Wave Surfing, based loosely off of concepts in the wave surfing tutorial.
- How does it fire?
- GuessFactor Targeting using a kD tree to store data. Precise intersection is used to determine the fire angles that would have hit.
- What does it save between rounds and matches?
- Nothing between matches. Between rounds all surfing and targeting data is saved.
Additional Information
- Can I use your code?
- Through rev0054, DeBroglie is available under the RoboWiki Public Code License (RWPC) - Version 1.1 or any later version. A bit of a modification to licensing is coming soon for subsequent versions.
- What's next for your robot?
- Get the movement and targeting systems squared away and cleaned up.
- Does it have any White Whales?
- In rumble terms, CassiusClay - I've been in awe of that bot since finding Robocode in 2007. Climbing above it in the RoboRumble is priority #1.
- One on one, Dookious - Just a stunning bot. If deBroglie can beat this one head-to-head, I'll think I've accomplished something.
- What other robot(s) is it based on?
- All code written by others is under the RWPC or a more permissive license.
- The kD tree is written by Rednaxela and is available on this wiki. License: as-is with attribution.
- The FastTrig lookup table and methods are written by a host of amazing folks at this wiki, starting with Rednaxela, but including other great Robocode luminaries.
- Parts of the precise prediction are accomplished with the help of code originally by Paul Bourke, adapted by REAS @ OpenProcessing.org and further adapted by me. This code determines if a line segment and a circle intersect. License: CC-by-sa 3.0