摘要: Years of work have gone into algorithms and optimizations for two-player perfect-information games such as Chess Checkers. It is only more recently that serious research has with imperfect information, Bridge, or game than two players teams players, Poker. This focuses on multi-player search in the card Hearts Spades, providing an overview past then presents new results regarding optimality current techniques need good opponent modeling search. We show we are already achieving near-optimal pruning Spades.
springer.com
du.edu 
ualberta.ca 
sci-hub.st 参考文章(28)
Richard E. Korf, Generalized game trees international joint conference on artificial intelligence. pp. 328- 333 ,(1989)
Keki B. Irani, Carol Ann Luckhardt, N-person game playing and artificial intelligence University of Michigan. ,(1989)
Richard E. Korf, Nathan Reed Sturtevant, Multiplayer games: algorithms and approaches University of California, Los Angeles. ,(2003)
Eric Wefald, Stuart Russell, On optimal game-tree search using rational meta-reasoning international joint conference on artificial intelligence. pp. 334- 340 ,(1989)
Keki B. Irani, Carol A. Luckhardt, An algorithmic solution of N-person games national conference on artificial intelligence. pp. 158- 162 ,(1986)
Richard E. Korf, Nathan R. Sturtevant, On Pruning Techniques for Multi-Player Games national conference on artificial intelligence. pp. 201- 207 ,(2000)
P. Jansen, Problematic Positions and Speculative Play Springer, New York, NY. pp. 169- 181 ,(1990) , 10.1007/978-1-4613-9080-0_10
Nathan Sturtevant, Last-branch and speculative pruning algorithms for max international joint conference on artificial intelligence. pp. 669- 675 ,(2003)
J. Schaeffer, The history heuristic and alpha-beta search enhancements in practice IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. 11, pp. 1203- 1212 ,(1989) , 10.1109/34.42858
David Mutchler, The multi-player version of minimax displays game-tree pathology Artificial Intelligence. ,vol. 64, pp. 323- 336 ,(1993) , 10.1016/0004-3702(93)90108-N