Monte-Carlo tree search using flood fill from each snake head ordered by length, making tails traversable depending on distance. For 1v1 just optimize the size of controlled area, otherwise also add bonuses for food in controlled area and health.
Public C++ Latency
Created Sept. 1, 2020
-
4 Battlesnakes, 11x11 Board, 195 Turns
6 hours ago
-
4 Battlesnakes, 11x11 Board, 464 Turns
1 day, 13 hours ago
-
3 Battlesnakes, 11x11 Board, 225 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 11x11 Board, 10 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 11x11 Board, 10 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 19x19 Board, 10 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 19x19 Board, 113 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 19x19 Board, 160 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 11x11 Board, 277 Turns
2 days, 11 hours ago
-
2 Battlesnakes, 11x11 Board, 277 Turns
2 days, 11 hours ago
