Watermelon
Watermelon | |
Author(s) | Synapse |
Extends | AdvancedRobot |
Targeting | Linear Targeting |
Movement | Wave Surfing |
Released | TBD |
Best Rating | N/A |
Current Rating | N/A |
Current Version | 1 |
Download |
Structure
It's built on a modular framework, coded pretty cleanly, but not good enough yet to be open source. Maybe once it's done something on the rumble that will change. Currently developing in Eclipse. Early on I used an educational IDE called BlueJ (its interface is a UML diagram, very pretty).
Movement
Uses Wave Surfing, implemented in a straightforward manner. To the extent that that's possible grumble grumble. I used Simonton's non-iterative Wall Smoothing code, and my own future position prediction. It took forever to realize that the future prediction needs to call the wall smoothing function for each imaginary tick, but I finally got it.
It kind of uses the Musashi Trick, by seeding the bins with a single hit at Guess Factor 0. The magnitude of the initial seed is such that the first real hit overrides it. Actual hits are smoothed, with a rolling average preferring new data to old.
Bot width is considered, averaging the danger from covered bins. There's no dive-in protection; bot width takes care of that.
Guess Factors are segmented by velocity.
Firing
Precise non-iterative Linear Targeting, doesn't know about walls. Sometimes I can beat CigaretBH!
Radar
Uses the same radar in melee and in 1v1 conflicts. An implementation quirk makes it look like a lazy spotlight.
Debug Graphics
Paints waves, with brighter segments where the bins are fuller. Also marks predicted future positions.