Pruning algorithms for multi-model adversary search

Artificial Intelligence

Volumn 99, Issue 2, 1998, Pages 325-355

  Carmel, David ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Adversary search; Opponent modeling; Pruning

Indexed keywords

COMPUTER SIMULATION; THEOREM PROVING;

ADVERSARY SEARCH; PRUNING ALGORITHMS;

ALGORITHMS;

EID: 0032021728     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00074-X     Document Type: Article

References (22)

1. H.J. Berliner, C. McConnell, B* probability based search, Artificial Intelligence 86 (1996) 97-156.
2. D. Carmel, S. Markovitch, Learning models of opponent's strategies in game playing, in: Proceedings AAAI Fall Symposium on Games: Planning and Learning, Raleigh, NC, 1993. pp. 140-147.
3. D. Carmel, S. Markovitch, The M* algorithm: Incorporating opponent models into adversary search, Technical Report CIS9402, Technion, Haifa, Israel, 1994.
4. D. Carmel, S. Markovitch, Incorporating opponent models into adversary search, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 120-125.
5. J. Christensen, R.E. Korf, A unified theory of heuristic evaluation functions and its application to learning, in: Proceedings AAAI-86, Philadelphia, PA, 1986.
6. P.J. Gmytrasiewicz, E.H. Durfee, D.K. Wehe, A decision theoretic approach to coordinating multiagent interactions, in: Proceedings IJCAI-91, Sydney, Australia, 1991, pp. 62-68.
7. H. Iida, J.W.H.M. Uiterwijk, H.J. van den Herik, I.S. Herschberg, Potential applications of opponent-model search, Part I: The domain of applicability, ICCA J. 16 (4) (1993) 201-208.
8. H. Iida, J.W.H.M. Uiterwijk, H.J. van den Herik, I.S. Herschberg, Potential applications of opponent-model search, Part II: Risks and strategies, ICCA J. 17 (1) (1994) 10-14.
9. H. Iida, Heuristic theories on game-tree search, Ph.D. Thesis, Tokyo University, 1994.
10. P.J. Jansen, Problematic positions and speculative play, in: T.A. Marsland, J. Schaeffer (Eds.), Computers, Chess and Cognition, Springer, New York, 1990, pp. 169-182.
11. P.J. Jansen, Using knowledge about the opponent in game-tree search, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, 1992.
12. D.E. Knuth, R.W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence 6 (4) (1975) 293-326.
13. R.E. Korf, Depth-first iterative deepening: an optimal admissible tree search, Artificial Intelligence 27 (1985) 97-109.
14. R.E. Korf, Generalized game trees, in: Proceedings IJCAI-89, Detroit, MI, 1989, pp. 328-333.
15. R.E. Korf, Multi-player alpha-beta pruning, Artificial Intelligence 48 (1991) 99-111.
16. C.A. Luckhardt, K.B. Irani, An algorithmic solution of n-person games, in: Proceedings AAAI-86, Philadelphia, PA, 1986, pp. 158-162.
17. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA, 1984.
18. A. Plaat, Research RE:search & RE-search, Ph.D. Thesis, Erasmus University, 1996.
19. A.L. Samuel, Some studies in machine learning using the game of checkers, IBM J. 3 (1959) 211-229.
20. A.L. Samuel, Some studies in machine learning using the game of checkers II - recent progress, IBM J. 11 (1967) 601-617.
21. C.E. Shannon, Programming a computer for playing chess, Philosophical Mag. 41 (1950) 256-275.
22. M. van der Meulen, Weight assessment in evaluation functions, in: D.F. Beal (Ed.), Advances in Computer Chess, vol. 5, Elsevier, Amsterdam, 1989, pp. 81-89.