Eric-Showers

eric-showers

Joined Mar 01, 2019

1,229

Global Rating

1,018

Rank: 383

539

Rank: 313

1,726

Rank: 120

2,168

Rank: 95

Battlesnakes

Calculates the best-case longest path possible for each non-collision move and selects randomly from those which are longer than body

For each non-collision move, uses a neural network to predict the odds of winning given the state-action pair

Uses a hueristic that combines the best-case and worst-case longest path possible for each non-collision move

Constrictor mode, empty map, 4 Battlesnakes, 11x11 Board, 10 Turns

Standard mode, standard map, 2 Battlesnakes, 11x11 Board, 296 Turns

Standard mode, 1 Battlesnakes, 11x11 Board, 589 Turns