Search in games with incomplete information: A case study using Bridge card play

Artificial Intelligence

Volumn 100, Issue 1-2, 1998, Pages 87-123

  Frank, Ian ^a   Basin, David ^b  

^a Complex Games Lab E ^*  (Japan)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Computer Bridge; Game theory; Game tree search; Incomplete information

Indexed keywords

EXPERT SYSTEMS; GAME THEORY; MATHEMATICAL MODELS; OPTIMIZATION; TREES (MATHEMATICS);

BRIDGE CARD PLAY; GAME TREE SEARCH;

ALGORITHMS;

EID: 0032045637     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(97)00082-9     Document Type: Article

References (38)

1. ACBL, The Official Encyclopedia of Bridge, 5th ed., American Contract Bridge League, Inc., 2990 Airways Boulevard, Memphis, TN 38116-3875, 1994.
2. E.R. Berlekamp, Program for double-dummy Bridge problems - a new strategy for mechanical game playing, J. ACM 10 (4) (1963) 357-364; also in: D. Levy (Ed.), Computer Games II, Springer, New York, 1988.
3. E.R. Berlekamp, Program for double-dummy Bridge problems - a new strategy for mechanical game playing, J. ACM 10 (4) (1963) 357-364; also in: D. Levy (Ed.), Computer Games II, Springer, New York, 1988.
4. D.L.S. Berlin, Span: integrating problem solving tactics, in: Proceedings IJCAI-85, Los Angeles, CA, 1985, pp. 1047-1051.
5. J.R.S. Blair, D. Mutchler, C. Liu, Games with imperfect information, in: Games: Planning and Learning, Papers from the 1993 Fall Symposium, AAAI Press, 1993, pp. 59-67.
6. G. Carley, A program to play Contract Bridge, Master's Thesis, Department of Electrical Engineering, Massachussets Institute of Technology, Cambridge, MA, 1962.
7. E. Crowhurst, Personal communication, May 17, 1996 (Crowhurst made a point of crediting Dorothy Truscott with helping him to verify his results).
8. A. Frank, Brute force search in games of imperfect information, in: D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence 2 - The Second Computer Olympiad, Ellis Horwood, Chicester, UK, 1989, pp. 204-209.
9. I. Frank, Search and planning under incomplete information: A study using Bridge card play, Ph.D. Thesis, Department of Artificial Intelligence, Edinburgh, 1996; also: Distinguished Dissertations Series, Springer, Berlin, to appear.
10. I. Frank, D. Basin, Payoff-reduction minimaxing, in: Proceedings Fourth Game Programming Workshop in Japan (GPW-97), Hakone, Japan, 1997; also: Technical Report ETL-97-21, Electrotechnical Laboratory, Umezono, Japan.
11. I. Frank, D. Basin, A. Bundy, An adaptation of proof-planning to declarer play in Bridge, in: Proceedings ECAI-92, Vienna, Austria, 1992, pp. 72-76; longer version: DAI Research Paper No. 575, Edinburgh.
12. B. Gambäck, M. Rayner, B. Pell, An architecture for a sophisticated mechanical Bridge player, in: D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence 2 - The Second Computer Olympiad, Ellis Horwood, Chichester, UK, 1991, pp. 87-107; later version: Technical Report 299, Cambridge University Computer Laboratory, 1993.
13. E. Geake, Playing to win, New Scientist (19 September 1992) 24-25.
14. M. Ginsberg, GIB vs Bridge Baron: results, Usenet news message posted on the newsgroup rec.games.Bridge, 31 October 1996; Message-id: 〈56cqmi$914@pith.uoregon.edu〉.
15. M. Ginsberg, How computers will play Bridge, The Bridge World, 1996: also available for anonymous ftp from dt.cirl.uoregon.edu as the file /papers/Bridge.ps.
16. M. Ginsberg, Partition search, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 228-233.
17. F. Gitelman, Bridge master, Computer Bridge Program, 15 Lillian Street, Toronto, ON, Canada M4S 2H7.
18. D. Kibler, K. Schwamb, Complete contingency planners, Technical Report UCI TR 92-94. University of California, Irvine, CA, 1992.
19. R.E. Korf, Generalized game trees, in: Proceedings IJCAI-89, Vol. I, Detroit, MI, 1989, pp. 328-333.
20. R. Lee (Ed.), Reviews from Canadian Master Point, 1992-1994; available as the file /pub/Bridge/ FAQ.ReviewsFromCanadianMasterPoint from the site arp.anu.edu.au.
21. D.N.L. Levy, The million pound Bridge program, in: D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence - The First Computer Olympiad, Ellis Horwood, Chichester, UK, 1989, pp. 95-103.
22. R.D. Luce, H. Raiffa, Games and Decisions - Introduction and Critical Survey, Wiley, New York, 1957.
23. R. Lustig, Hibrid: a hierarchically designed Bridge playing program, Master's Thesis, Weizmann Institute of Science, Rehovot, Israel, 1985.
24. B. Manley, Bridge software: moving forwards or backwards?, The Bulletin, American Contract Bridge League (October 1994).
25. C.N. Napjus, Declarer: a learning Bridge-playing program which generalizes and infers, Ph.D. Thesis, University of Washington, 1969.
26. J.F. Nash, Non-cooperative games, Ann. of Math. 2 (54) (1951) 286-295.
27. D. Nau, P. Purdom, C.-H. Tzeng, An evaluation of two alternatives to minimax, in: L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, Elsevier, Amsterdam, 1988, pp. 505-509.
28. Y. Nygate, L. Sterling, Aspen - designing complex knowledge based systems, in: Proceedings 10th Israeli Symposium on Artificial Intelligence, 1993, pp. 51-60.
29. J. Pearl, Heuristic search theory: survey of recent results, in: Proceedings IJCAI-81, vol. I, Vancouver, BC, 1981, pp. 554-562.
30. J. Pearl, On the nature of pathology in game searching, Artificial Intelligence 20 (1983) 427-453.
31. C.E. Shannon, Programming a computer for playing chess, Philos. Mag. 41 (1950) 256-275.
32. S.J.J. Smith, D.S. Nau, Strategic planning for imperfect information games, in: Games: Planning and Learning, Papers from the 1993 Fall Symposium, AAAI Press, 1993, pp. 84-91.
33. A. Stanier, Planning to make tricks at Bridge, in: Proceedings AISB Summer Conference, 1976, pp. 256-265; also in: D. Levy (Ed.), Computer Games II, Springer, New York, 1988.
34. A. Stanier, Planning to make tricks at Bridge, in: Proceedings AISB Summer Conference, 1976, pp. 256- 265; also in: D. Levy (Ed.), Computer Games II, Springer, New York, 1988.
35. T. Throop, Computer Bridge, Hayden, 1983.
36. J. von Neumann, O. Morgenstern, Theory of Games and Economic Behaviour, Princeton University Press, Princeton, NJ, 1944.
37. G. Walker, Beaten in spades, New Scientist (16 November 1996) 26-27.
38. R. Wheen, Solving double dummy Bridge problems by exhaustive search, in: D.N.L Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence - The First Computer Olympiad, Ellis Horwood, Chichester, UK, 1989, pp. 89-94.