Tron Battle at CodinGame

Algorithm Description

1. Keep track of all visited nodes in a map.
2. Compute the length of continuous unvisited nodes from the current node to left, right, up and down.
3. Choose the direction that has the longest continuous unvisited nodes as the next direction.

Limitations and Future Work

1. Can only have two users at same time.
2. It works in a defensive way.