Multi-player alpha-beta pruning
Artificial Intelligence
Computer Go: an AI oriented survey
Artificial Intelligence
On Pruning Techniques for Multi-Player Games
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combining online and offline knowledge in UCT
Proceedings of the 24th international conference on Machine learning
Last-branch and speculative pruning algorithms for max
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Current challenges in multi-player game search
CG'04 Proceedings of the 4th 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
| Hi-index | 0.00 |
Multi-player Go is Go played with more than two colors. Monte-Carlo Tree Search is an adequate algorithm to program the game of Go with two players. We address the application of Monte-Carlo Tree Search to multi-player Go.