This lecture covers some map-dependent issues and commons problems that were seen during the Sprint Tournament. Scenarios discussed are accompanied by examples from the tournament, with additional commentary and analysis.

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 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.

The lecture, delivered by one of the developers and winners of the 2012 competition, covers changes to Battlecode from the previous years, a more detailed explanation of bytecodes, as well as useful tips and strategies.

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 introduces centralized and decentralized control in Battlecode, and demonstrates different ways to implement swarming and laying mines strategically.

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 Battlecode, course and competition logistics, the changes to gameplay since the previous year, and a brief overview of the centralized information provided to players.