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.