Pea Eater

by alxv

About

Pea Eater (a.k.a. "Peter") uses Monte Carlo Tree Search to pick its moves. Pea Eater doesn't use any heuristics and only knows the game rules. Its web frontend is implemented in Go and its evaluation backend is in C++.

Private C++ Go Monte Carlo Tree Search Latency

Created June 3, 2021

Accomplishments
🍂 Fall League 2022 - Elite : Finals
🍂 Fall League 2022 Qualifier : 4th
☀️ Summer League 2022 - Elite : Semifinals
☀️ Summer League 2022 Qualifier : 4th
⚔️ Constrictor Ladder (May) : 1st
⚔️ Duels Ladder (May) : 5th
⚔️ Standard Ladder (May) : 5th
⚔️ Wrapped Ladder (May) : 3rd
🌱 Spring League 2022 - Elite : Quarterfinals
🌱 Spring League 2022 Qualifier : 5th
❄️ Winter Classic Invitational 2021 - Elite : Qualified
🍂 Fall League 2021 - Elite : Qualified
🍂 Fall League 2021 Qualifier : 5th
Recent Games
Resources
Community
Follow
About
Copyright © 2022 Battlesnake Inc.

Version 1.8.149