MIT 6.370 The Battlecode Programming Competition, IAP 2013
View the complete course: http://ocw.mit.edu/6-370IAP13
Instructor: Maxwell Mann
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.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu/
2 Comments