An analysis of UCT in multi-player games

ICGA Journal

Volumn 31, Issue 4, 2008, Pages 195-208

  Sturtevant, Nathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY;

BRANCHING FACTORS; MIXED-STRATEGY EQUILIBRIUM; MULTIPLAYER GAMES; STRATEGY EQUILIBRIUMS; TWO-PLAYER GAMES;

COMPUTER GAMES;

EID: 68049133318     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/icg-2008-31402     Document Type: Article

References (16)

1. Billings, D. (2006). On the Importance of Embracing Risk in Tournaments. ICGA Journal, Vol. 29, No. 4, pp. 199-202.
2. Cazenave, T. (2008). Multi-player Go. Proceedings of the 6th International Conference on Computers and Games (eds. H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands), Vol. 5131 of Lecture Nbfes in Computer Science (LNCS), pp. 50-59, Springer-Verlag, Heidelberg, Germany.
3. Finnsson, H. and Björnsson, Y. (2008). Simulation-Based Approach to General Game Playing. AAAI, pp. 259-264.
4. Gelly, S. and Silver, D. (2007). Combining online and offline knowledge in UCT. ICML'07: Proceedings of the 24th international conference on Machine learning, pp. 273-280, ACM, New York, NY, USA. ISBN 978-1-59593-793-3.
5. Genesereth, M. R., Love, N., and Pell, B. (2005). General Game Playing: Overview of the AAAI Competition. AI Magazine, Vol. 26, No. 2, pp. 62-72. http://games.stanford.edu/competition/misc/aaai.pdf.
6. Kocsis, L. and Szepesvári, C. (2006). Bandit Based Monte-Carlo Planning. Proceedings of the 17th European Conference on Machine Learning, pp. 282-293, Springer-Verlag, Heidelberg, Germany.
7. Luckhardt, C. and Irani, K. (1986). An Algorithmic Solution of N-Person Games. AAAI-86, Vol. 1, pp. 158-162.
8. Schaeffer, J. (1989). The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 11, pp. 1203-1212.
9. Sturtevant, N., Zinkevich, M., and Bowling, M. (2006). ProbMaxn: Opponent modeling in n-player games. AAAI-2006, pp. 1057-1063.
10. n. IJCAI-03, pp. 669-678.
11. Sturtevant, N. R. (2003b). Multi-Player Games: Algorithms and Approaches. Ph.D. thesis, Computer Science Department, UCLA.
12. Sturtevant, N. R. (2004). Current Challenges in Multi-player Game Search. Proceedings of the 4th International Conference on Computers and Games (eds. H. J. van den Herik, Y. Björnsson, and N. S. Netanyahu), Vol. 3846 of Lecture Notes in Computer Science (LNCS), pp. 285-300, Springer-Verlag, Heidelberg, Germany.
13. Sturtevant, N. R. (2008). An Analysis of UCT in Multi-player Games. Proceedings of the 6th International Conference on Computers and Games (eds. H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands), Vol. 5131 of Lecture Notes in Computer Science (LNCS), pp. 37-49, Springer-Verlag, Heidelberg, Germany.
14. Sturtevant, N. R. and Bowling, M. H. (2006). Robust Game Play Against Unknown Opponents. AAMAS-2006.
15. Sturtevant, N. R. and Korf, R. E. (2000). On Pruning Techniques for Multi-Player Games. AAAI-2000.
16. Sturtevant, N. R. and White, A. M. (2007). Feature Construction for Reinforcement Learning in Hearts. Proceedings of the 5th International Conference on Computers and Games (eds. H. J. van den Herik, P. Ciancarini, and M. H. M. Winands), Vol. 4630 of Lecture Notes in Computer Science (LNCS), pp. 122-134, Springer-Verlag, Heidelberg, Germany.