Algorithmic Squava Players
I have four algorithms in my second attempt at writing algorithmic “players” for the game of Squava:
- Alpha-beta minimaxing
- Alpha-beta minimaxing with a better static evaluation function
- Monte Carlo Tree Search
- Monte Carlo Tree Search with UCT child selection
At this point, all but plain MCTS (#3 above) regularly beat me. How do my programmatic squava players do against each other?