A Bayesian approach to relevance in game playing

Artificial Intelligence

Volumn 97, Issue 1-2, 1997, Pages 195-242

  Baum, Eric B ^a   Smith, Warren D ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Bayesian model; Computer chess; Computer game playing; Computer Othello; Decision theory; Directed search; Evaluation function; Game theory; Game tree search; Game trees; Graphical model; Metareasoning; Rational search; Relevance; Utility; Utility guided search

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECISION THEORY; ERROR ANALYSIS; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; PROBABILISTIC LOGICS; TREES (MATHEMATICS);

BAYESIAN MODELS;

GAME THEORY;

EID: 0031351658     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(97)00059-3     Document Type: Article

References (48)

1. T.S. Anantharaman, A statistical study of selective Min-Max search in computer chess, Ph.D. Thesis, CMU-CS-90-173, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA (1990).
2. T.S. Anantharaman, Extension heuristics, ICCA J. 14 (2) (1991) 47-65.
3. T. Anantharaman, M. Campbell and F. Hsu, Singular extensions; adding selectivity to brute force searching. Artificial Intelligence 43 (1990) 99-109.
4. E.B. Baum, On optimal game tree propagation for imperfect players, in: Proceedings AAAI-92, San Jose, CA (American Association for Artificial Intelligence, Menlo Park, CA, 1992) 507-512.
5. E.B. Baum, How a Bayesian approaches games like chess, in: Games: Planning and Learning, Papers from the 1993 Fall Symposium, Tech. Rept. FS-93-02 (AAAI Press, Menlo Park, CA, 1993) 48-50.
6. E.B. Baum and W.D. Smith, Best play for imperfect players and game tree search, Tech. Rept., NEC, Princeton, NJ.
7. D.F. Beal, A generalized quiescence search algorithm, Artificial Intelligence 43 (1990) 85-98.
8. H.J. Berliner, The B* search algorithm: a best first proof procedure, Artificial Intelligence 12 (1979) 23-40.
9. H.J. Berliner and C. McConnell, B* probability-based search, Artificial Intelligence 86 (1) (1996) 97-156.
10. M. Blum, R. Floyd, V. Pratt, R. Rivest and R. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1973) 448-461.
11. M. Buro, ProbCut: an effective selective extension of the αβ algorithm, ICCA J. 18 (2) (1995) 71-76.
12. M. Campbell, The graph-history interaction; on ignoring position history, in: Proceedings ACM National Conference (1985) 278-280.
13. D.B. Chamberlin, How to play Warn, Privately printed, 1984; available from author, 2101 Birchwood Road, Lancaster, PA 17603, USA, for $7.
14. P.-C. Chi and D.S. Nau, Comparison of the Minimax and product back-up rules in a variety of games, in: L.N. Kanal and V. Kumar, eds., Search in Artificial Intelligence (Springer, New York, 1989) 451-471.
15. J.H. Condon and K. Thompson, Belle chess hardware, in: M.R.B. Clarke, ed., Advances in Computer Chess, Vol. 3 (Pergamon, Oxford, 1982) 45-54.
16. C. Donninger, Null move and deep search, ICCA J. 16 (3) (1993) 137-143.
17. R. Floyd and R. Rivest, Expected time bounds for selection, Comm. ACM 18 (3) (1975) 165-173.
18. I.J. Good, A five year plan for automatic chess, in: E. Dale and D. Michie, eds. Machine Intelligence, Vol. 2 (Oliver & Boyd, Edinburgh, Scotland, 1968) 89-118.
19. O. Hansson and A. Mayer, Heuristic search as evidential reasoning, in: Proceedings 5th Workshop on Uncertainty in Artificial Intelligence, Windsor, Ont. (1989).
20. F.-H. Hsu, Large scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess, Ph.D. Thesis, Tech. Rept. CMU-CS-90-108, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1990).
21. A. Junghanns, J. Schaeffer et al., Diminishing returns for additional search in chess, in: Advances in Computer Chess, Vol. 8, to appear.
22. R.M. Karp, M. Luby and N. Madras, Monte-Carlo approximation algorithms for enumeration problems, J. Algorithms 10 (1989) 429-448.
23. R.E. Korf and D.M. Chickering, Best-first minimax search, Artificial Intelligence 84 (1996) 299-337.
24. T. Landau, Othello, Brief and Basic (US Othello Association, 920 Northgate Ave., Waynesboro, VA 22980-3425, 1984).
25. H. La Poutre and W.D. Smith, Approximation of staircases by staircases, Work in progress, NECI, Princeton, NJ.
26. K.-F. Lee and S. Mahajan, The development of a world class Othello program, Artificial Intelligence 43 (1990) 21-36.
27. K.-F. Lee and S. Mahajan, A pattern classification approach to evaluation function learning, Artificial Intelligence 36 (1988) 1-25.
28. D.A. McAllester, Conspiracy numbers for min-max search, Artificial Intelligence 35 (1988) 287-310.
29. D.S. Nau, Pathology on game trees revisited and an alternative to minimaxing, Artificial Intelligence 21 (1983) 224-244.
30. M. Newborn, A hypothesis concerning the strength of chess programs, ICCA J. 8 (4) (1985) 209-215.
31. A.J. Palay, The B* search algorithm - new results, Artificial Intelligence 19 (1982) 145-163.
32. A.J. Palay, Searching with Probabilities (Pitman, London, 1985).
33. J. Pearl, Heuristics (Addison-Wesley, Reading, MA, 1984).
34. R.L. Rivest, Game tree searching by min/max approximation, Artificial Intelligence 34 (1988) 77-96.
35. P.S. Rosenbloom, A world-championship level Othello program, Artificial Intelligence 19 (1982) 279-320.
36. L. Russ, Mancala Games (Reference Publications Inc., 218 St. Clair River Drive, Box 344, Algonac, MI 48001, 1984).
37. S.J. Russell and E. Wefald, Do the Right Thing (MIT Press, Cambridge, MA, 1991), see especially Chapter 4.
38. J. Schaeffer, Experiments in search and knowledge, Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1986.
39. J. Schaeffer, Conspiracy numbers, Artificial Intelligence 43 (1990) 67-84.
40. G. Schrüfer, Presence and absence of pathology on game trees, in: D.F. Beal, ed., Advances in Computer Chess, Vol. 4 (Pergamon, Oxford, 1986) 101-112.
41. C.E. Shannon, Programming a computer for playing chess, Philos. Mag. 41 (7) (1950) 256-275.
42. J.R. Slagle and J.K. Dixon, Experiments with some programs that search game trees, Comm. ACM 16 (2) (1969) 189-207.
43. D.J. Slate and L.R. Atkin, Chess 4.5: the Northwestern University chess program, in: P. Frey, ed., Chess Skill in Man and Machine (Springer, Berlin, 1983).
44. W.D. Smith, Fixed point for negamaxing probability distributions on regular trees, NECI Tech. Rept., Princeton, NJ.
45. W.D. Smith, C. Garrett, E. Baum and R. Tudor, Experiments with a Bayesian game player, Submitted for publication; also at http://www.neci.nj.nec.com:80/home/eric/eric.html.
46. A. Szabo and B. Szabo, The technology curve revisited, ICCA J. 11 (1) (1988) 14-20.
47. R.E. Tarjan, Data Structures and Network Algorithms (SIAM, Philadelphia, PA, 1983).
48. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.