The Battlecode Programming Competition MIT

This lecture introduces Battlecode, course and competition logistics, the changes to gameplay since the previous year, and a brief overview of the centralized information provided to players.

This lecture demonstrates how to start moving soldiers, building troops around a rally point, determining possible directions of movement, and finding the closest enemy. Specific methods and attributes are also discussed during the demonstration.

This lecture demonstrates pathing in a maze, and how to implement pathing in Battlecode. Metrics of success, possible undesirable behavior, bytecode tricks, and indexing are also discussed.

This lecture covers the importance of maintaining organized code and includes a walk-through of how to share and manage files using a Git repository.

This lecture introduces centralized and decentralized control in Battlecode, and demonstrates different ways to implement swarming and laying mines strategically.

This lecture focuses on analyzing various strategies and the effects of various parameters of Battlecode. Graphs depicting the balance of generators and suppliers, and analysis of medbays and artilleries are presented.