Difference between revisions of "Robocode/Articles"
< Robocode
Jump to navigation
Jump to search
(New page: {{Stub}} This page contains articles from the web about Robocode. == Articles from IBM developerWorks == * [http://www.ibm.com/developerworks/java/library/j-nelson/ 01 May 2002] - A...) |
|||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
This page contains articles from the web about [[Robocode]]. | This page contains articles from the web about [[Robocode]]. | ||
| Line 13: | Line 11: | ||
==== Secrets from the Robocode masters ==== | ==== Secrets from the Robocode masters ==== | ||
* [http://www.ibm.com/developerworks/library/j-fwa/index.html 01 May 2002] - Factored wall avoidance | * [http://www.ibm.com/developerworks/library/j-fwa/index.html 01 May 2002] - Factored wall avoidance | ||
| + | * [http://www.ibm.com/developerworks/java/library/j-movement/ 01 May 2002] - Tracking your opponents' movement - Select the best movement algorithm for each opponent | ||
* [http://www.ibm.com/developerworks/java/library/j-circular/ May 2002] - Circular targeting - Hit robots that travel in circles with perfect accuracy | * [http://www.ibm.com/developerworks/java/library/j-circular/ May 2002] - Circular targeting - Hit robots that travel in circles with perfect accuracy | ||
* [http://www.ibm.com/developerworks/java/library/j-pred-targeting/ May 2002] - Predictive targeting | * [http://www.ibm.com/developerworks/java/library/j-pred-targeting/ May 2002] - Predictive targeting | ||
| Line 19: | Line 18: | ||
* [http://www.ibm.com/developerworks/java/library/j-tipreuse.html Jun 2002] - Extensible/reusable robots | * [http://www.ibm.com/developerworks/java/library/j-tipreuse.html Jun 2002] - Extensible/reusable robots | ||
* [http://www.ibm.com/developerworks/java/library/j-tippoly/ Jun 2002] - Polymorphic enemy cache | * [http://www.ibm.com/developerworks/java/library/j-tippoly/ Jun 2002] - Polymorphic enemy cache | ||
| + | * [http://www.ibm.com/developerworks/java/library/j-radar.html Jun 2002] - Radar sweeps | ||
| + | * [http://www.ibm.com/developerworks/java/library/j-tipleague/ Jun 2002] - RoboLeague | ||
* [http://www.ibm.com/developerworks/java/library/j-tipbullet.html July 2002] - Tracking bullets - Choose the best aiming technique for each opponent | * [http://www.ibm.com/developerworks/java/library/j-tipbullet.html July 2002] - Tracking bullets - Choose the best aiming technique for each opponent | ||
* [http://www.ibm.com/developerworks/java/library/j-robotips/ 15 Jul 2002] - A collection of hints, tips, and advice from the Robocode masters | * [http://www.ibm.com/developerworks/java/library/j-robotips/ 15 Jul 2002] - A collection of hints, tips, and advice from the Robocode masters | ||
Revision as of 22:56, 15 November 2007
This page contains articles from the web about Robocode.
Contents
Articles from IBM developerWorks
- 01 May 2002 - AlphaBot: An interview with Robocode creator Mat Nelson
Rock 'em, sock 'em Robocode
- 01 Jan 2002 - Rock 'em, sock 'em Robocode!
Learning Java programming is more fun than ever with this advanced robot battle simulation engine
- 01 May 2002 - Round 2 - Go beyond the basics with advanced robot building and team play
Secrets from the Robocode masters
- 01 May 2002 - Factored wall avoidance
- 01 May 2002 - Tracking your opponents' movement - Select the best movement algorithm for each opponent
- May 2002 - Circular targeting - Hit robots that travel in circles with perfect accuracy
- May 2002 - Predictive targeting
- May 2002 - Dodge bullets
- May 2002 - Anti-gravity movement
- Jun 2002 - Extensible/reusable robots
- Jun 2002 - Polymorphic enemy cache
- Jun 2002 - Radar sweeps
- Jun 2002 - RoboLeague
- July 2002 - Tracking bullets - Choose the best aiming technique for each opponent
- 15 Jul 2002 - A collection of hints, tips, and advice from the Robocode masters
- 15 Jul 2002 - Robocode strategies
Robocode Rumble
- 15 Jul 2002 - Let the games begin - alphaWorks launches Robocode Rumble
- 01 Aug 2002 - Tips from the champs - Rumble champions reveal the strategy behind their winning 'bots
