An evaluation function for the game of amazons
Theoretical Computer Science - Advances in computer games
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Efficient selectivity and backup operators in Monte-Carlo tree search
CG'06 Proceedings of the 5th international conference on Computers and games
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
Computational experiments with the RAVE heuristic
CG'10 Proceedings of the 7th international conference on Computers and games
Score bounded Monte-Carlo tree search
CG'10 Proceedings of the 7th international conference on Computers and games
Node-expansion operators for the UCT algorithm
CG'10 Proceedings of the 7th international conference on Computers and games
Monte-Carlo opening books for amazons
CG'10 Proceedings of the 7th international conference on Computers and games
Enhancements for multi-player Monte-Carlo tree search
CG'10 Proceedings of the 7th international conference on Computers and games
Monte-Carlo tree search and rapid action value estimation in computer Go
Artificial Intelligence
Evaluation function based monte-carlo LOA
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
A study of UCT and its enhancements in an artificial game
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
| Hi-index | 0.00 |
Monte-Carlo algorithms and their UCT-like successors have recently shown remarkable promise for Go-playing programs. We apply some of these same algorithms to an Amazons-playing program. Our experiments suggest that a pure MC/UCT type program for playing Amazons has little promise, but by using strong evaluation functions we are able to create a hybrid MC/UCT program that is superior to both the basic MC/UCT program and the conventional minimax-based programs. The MC/UCT program is able to beat Invader, a strong minimax program, over 80% of the time at tournament time controls.