This repo supports the Leeds Sharp session from Thursday, 29 June 2017.
In this session, we'll be explaining in detail popular game theory algorithms such as the Minimax algorithm, Alpha–beta pruning algorithm, and also the flood fill algorithm, and pathfinding algorithms to combine them all into an AI bot that will compete against other bots live on the big screen.
https://www.codingame.com/multiplayer/bot-programming/tron-battle register on codingame add "Leeds Sharp" as company select C# language explain play code explain output windows explain code explain submit code explain x10 speed explain league
get grid size store current positions - what type to use? store positions in grid