Best-first minimax search

Artificial Intelligence

Volumn 84, Issue 1-2, 1996, Pages 299-337

  Korf, Richard E ^a   Chickering, David Maxwell ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; DECISION THEORY; GAME THEORY; OPTIMIZATION; RANDOM PROCESSES;

ALPHA BETA MINIMAX; BEST FIRST MINIMAX; GAME TREES; NODE GENERATION; RANDOM BRANCHING FACTORS; SELECTIVE SEARCH ALGORITHM;

ARTIFICIAL INTELLIGENCE;

EID: 0030197154     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00096-8     Document Type: Article

References (35)

1. T.S. Anantharaman, A statistical study of selective min-max search in computer chess, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1990).
2. T. Anantharaman, M.S. Campbell and F.-H. Hsu, Singular extensions: Adding selectivity to brute-force searching, Artif. Intell. 43 (1990) 99-109.
3. * tree search algorithm: A best-first proof procedure, Artif. Intell. 12 (1979) 23-40.
4. P.P. Chakrabarti, S. Ghose, A. Acharya and S.C. de Sarkar, Heuristic search in restricted memory, Artif. Intell. 41 (1989) 197-221.
5. S.H. Fuller, J.G. Gaschnig and J.J. Gillogly, An analysis of the alpha-beta pruning algorithm, Tech. Rept., Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1973).
6. L.R. Harris, The heuristic search under conditions of error, Artif. Intell. 5 (1974) 217-234.
7. H. Kaindl, Searching to variable depth in computer chess, in: Proceedings IJCAI-83, Karlsruhe (1983) 760-762.
8. H. Kaindl, R. Shams and H. Horacek, Minimax search algorithms with and without aspiration windows, IEEE Trans. Pattern Anal. Mach. Intell. 13 (1991) 1225-1235.
9. R.M. Karp and J. Pearl, Searching for an optimal path in a tree with random costs, Artif. Intell. 21 (1983) 99-117.
10. R. Keene, B. Jacobs and t. Buzan, Man v. Machine: The ACM Chess Challenge: Garry Kasparov v. IBM's Deep-Blue (B.B. Enterprises, Sussex, 1996).
11. B.W. Kernighan and D.M. Ritchie, The C Programming Language (Prentice-Hall, Englewood Cliffs, NJ, 2nd ed., 1988) 46.
12. D.E. Knuth and R.E. Moore, An analysis of alpha-beta pruning, Artif. Intell. 6 (1975) 293-326.
13. R.E. Korf, Best-first minimax search: Initial results, Tech. Rept., CSD-920021, Computer Science Department, University of California, Los Angeles, CA (1992).
14. R.E. Korf, Linear-space best-first search, Artif. Intell. 62 (1993) 41-78.
15. R.E Korf and D.M. Chickering, Best-first minimax search: first results, in: Proceedings AAAI Fall Symposium on Games: Planning and Learning, Raleigh, NC (1993) 39-47.
16. R.E Korf and D.M. Chickering, Best-first minimax: Othello results, in: Proceedings AAAI-94, Seattle, WA (1994) 1365-1370.
17. R.E Korf, J. Pemberton and W. Zhang, Incremental random search trees, in: Proceedings AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods, Seattle, WA (1994) 15-18.
18. E.W. Kozdrowicki and D.W. Cooper, COKO III: the Cooper-Koz chess program, Commun. ACM 16 (1973) 411-427.
19. K.-F. Lee and S. Mahajan, The development of a world-class Othello program, Artif. Intell. 43 (1990) 21-36.
20. T.A. Marsland, Computer chess and search, in: S.C. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 2nd ed., 1992) 224-241.
21. D.A. McAllester, Conspiracy numbers for min-max search, Artif. Intell. 35 (1988) 287-310.
22. C.J.H. McDiarmid and G.M.A. Provan, An expected-cost analysis of backtracking and non-backtracking algorithms, in: Proceedings IJCAI-91, Sydney, Australia (1991) 173-177.
23. D.S. Nau, The last player theorem, Artif. Intell. 18 (1982) 53-65.
24. D.S. Nau, An investigation of the causes of pathology in games, Artif. Intell. 19 (1982) 257-278.
25. M.M. Newborn, The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores, Artif. Intell. 8 (1977) 137-153.
26. N.J. Nilsson, Searching problem-solving and game-playing trees for minimal cost solutions, in: A.J.H. Morrell, ed., Information Processing 68, Proceedings of the IFIP Congress 1968 (North-Holland, Amsterdam, 1969) 1556-1562.
27. J. Pearl, Heuristics (Addison-Wesley, Reading, MA, 1984).
28. J. Pemberton and R.E. Korf, Incremental search algorithms for real-time decision making, in: Proceedings Second International Conference on Planning, Chicago, IL (1994) 140-145.
29. R.L. Rivest, Game tree searching by min/max approximation, Artif. Intell. 34 (1987) 77-96.
30. P.S. Rosenbloom, A world-championship-level Othello program, Artif. Intell. 19 (1982) 279-320.
31. S. Russell and E. Wefald, On optimal game-tree search using rational meta-reasoning, in: Proceedings IJCAI-89, Detroit, MI (1989) 334-340.
32. C.E. Shannon, Programming a computer for playing chess, Philos. Magazine 41 (1950) 256-275.
33. J.R. Slagle and J.K. Dixon, Experiments with some programs that search game trees, J. ACM 16 (1969) 189-207.
34. G. Stockman, A minimax algorithm better than Alpha-Beta?, Artif. Intell. 12 (1979) 179-196.
35. W. Zhang and R.E. Korf, Performance of linear-space search algorithms, Artif. Intell. 79 (1995) 293-326.