Current challenges in multi-player game search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3846 LNCS, Issue , 2006, Pages 285-300

  Sturtevant, Nathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTERACTIVE COMPUTER SYSTEMS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION;

CARD GAMES; MULTI-PLAYER GAME SEARCH; TWO-PLAYER PERFECT-INFORMATION GAMES;

HUMAN COMPUTER INTERACTION;

EID: 33745175474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11674399_20     Document Type: Conference Paper

References (29)

1. Hu, F. (2002). Behind DEEP BLUE. Princeton University Press.
2. Schaeffer, J., Culberson, J., Treloar, N., Knight, B., Lu, P., and Szafron, D. (1992). A world championship caliber checkers program, Artificial Intelligence, Vol. 53, pp. 273-290.
3. Billings, D., Peña, L., Schaeffer, J., and Szafron, D. (1999). Using Probabilistic Knowledge and Simulation to Play Poker, AMI-99, pp. 697-703.
4. Ginsberg, M., GIB (2001). Imperfect Information in a Computationally Challenging Game, Journal of Artificial Intelligence Research, vol. 14, pp. 303-358.
5. Knuth, D., and Moore, R. (1975). An Analysis of Alpha-Beta Pruning, Artificial Intelligence, vol. 6 no. 4, pp. 293-326.
6. Russell, S.J. and Wefald, E.H. (1989). On optimal game-tree search using rational metareasoning. UCAI-89, Detroit, MI, pp. 334-340.
7. Carmel, D. and Markovitch, S. (1996). Incorporating Opponent Models into Adversary Search, AAAI-96, Portland, OR.
8. Nash, J.F. (1951). Non-cooperative games, Annals of Mathematics, vol. 54, pp. 286-295.
9. Jones, A.J. (1980). Game Theory: Mathematical Models of Conflict, Ellis Horwood, West Sussex, England.
10. Kuhn, H.W. (1953). Extensive Games and the Problem of Information, in Kuhn and Tucker (editors), Contributions to the Theory of Games, Princeton University Press, New Jersey.
11. Luckhardt, C. and Irani, K. (1986). An algorithmic solution of N-person games, AAAI-86, Philadelphia, PA, pp. 158-162.
12. Luckhardt, C. (1989). N-Person Game Playing and Artificial Intelligence, PhD. Thesis, University of Michigan.
13. Mutchler, D. (1993). The Multi-Player Version of Minimax Displays Game-Tree Pathology, Artificial Intelligence, vol. 64, pp. 323-336.
14. Nao, D.S. (1980). Pathology on game trees: A summary of results, AAAI-80, Stanford, CA, pp. 102-104.
15. Beal, D.F. (1980). An analysis of Minimax, In Clarke, M.R.B. (editor), Advances in Computer Chess 2, Edinburgh University Press, Edinburgh, Scotland, pp. 103-109.
16. Korf, R. (1991). Multiplayer Alpha-Beta Pruning. Artificial Intelligence, vol. 48 no. 1, pp. 99-111.
17. Sturtevant, N., and Korf, R. (2000). On Pruning Techniques for Multi-Player Games, AAAI-00, Austin, TX, pp. 201-207.
18. rd International Conference on Computers and Games, pp. 108-122.
19. Pearl, J. (1984). Heuristics, Addison-Wesley, Reading, MA.
20. n, IJCAI-2003, Acapulco, Mexico.
21. Sturtevant, N. (2003). Multi-Player Games: Algorithms and Approaches, PhD Thesis, UCLA.
22. Hoyle, E., and Frey, R.L., Morehead, A.L., and Mott-Smith, G, (1991). The Authoritative Guide to the Official Rules of All Popular Games of Skill and Chance, Doubleday.
23. Schaeffer, J. (1989). The History Heuristic and Alpha-Beta Enhancements in Practice, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1203-1212
24. Jansen, P. (1990). Problematic Positions and Speculative Play, in Marsland and Schaeffer (editors), Computers, Chess and Cognition, Springer, New York, pp. 169-182.
25. Iida, H., Uiterwijk, J.W.H.M., van den Herik, H.J, and Herschberg, I.S. (1993). Potential Applications of Opponent-Model Search, Part 1: The domain of applicability, ICCA Journal, vol. 16, no. 4, pp. 201-208
26. Iida, H., Uiterwijk, J.W.H.M., van den Herik, H.J, and Herschberg, I.S. (1994). Potential Applications of Opponent-Model Search, Part 2: Risks and Strategies, ICCA Journal, vol. 17, no. 1, pp. 10-14
27. Korf, R. (1989), Generalized Game Trees, IJCAI-89, pp. 328-333
28. Denkers, H.H.L.M., Uiterwijk, J.W.H.M., and Herik, H.J. van den (2001). Probabilistic Opponent-Model Search, Information Sciences, vol. 135, nos. 3-4, pp. 123-149.
29. Donkers, H.H.L.M. (2003). Nosce Hostem: Searching with Opponent Models, PhD Thesis, University of Maastricht.