A planning approach to declarer play in contract bridge

Computational Intelligence

Volumn 12, Issue 1, 1996, Pages 106-130

  Smith, S J J ^a   Nau, D S ^b   Throop, T A ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c Great Game Products   (United States)

Author keywords

Bridge; Game; Game playing; Game tree; Imperfect information; Planning; Pruning; Uncertainty

Indexed keywords

COMPUTER SOFTWARE; PROBLEM SOLVING; TREES (MATHEMATICS);

CONTRACT BRIDGE; GAME PLAYING; GAME TREE; IMPERFECT INFORMATION;

GAME THEORY;

EID: 0030081986     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00255.x     Document Type: Article

References (39)

1. BALLARD, B. W. 1983. The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21:327-350.
2. BERLIN, D. L. 1985. SPAN: integrating problem solving tactics. In Proceedings 9th International Joint Conference on Artificial Intelligence, Morgan Kaufmann. San Mateo, CA, pp. 1047-1051.
3. BERLINER, H. J., G. GOETSCH, M. S. CAMPBELL, and C. EBELING. 1990. Measuring the performance potential of chess programs. Artificial Intelligence, 43:7-20.
4. BIERMANN, A. W. 1978. Theoretical issues related to computer game playing programs. Personal Computing, September 1978:86-88.
5. CORMEN, T. H., C. E. LEISERSON, and R. L. RIVEST. 1990. Introduction to algorithms. MIT Press/McGraw Hill.
6. CURRIE, K., and A. TATE. 1985. O-Plan - control in the open planner architecture. BCS Expert Systems Conference, Cambridge University Press, UK.
7. EROL, K., D. S. NAU, and J. HENDLER. 1993. Toward a general framework for hierarchical task-network planning. In AAAI Spring Symposium.
8. EROL, K., D. S. NAU, and V. S. SUBRAHMANIAN. 1995. Complexity, decidability, and undecidability results for domain-independent planning. Artificial Intelligence, 76: 75-88.
9. FELDMAN, J. A., and Y. YAKIMOVSKY. 1974. Decision theory and artificial intelligence i: a semantics-based region analyzer. Artificial Intelligence, 5:349-371.
10. FELDMAN, J. A., and R. F. SPROULL. 1977. Decision theory and artificial intelligence ii: the hungry monkey. Cognitive Science, 1:158-192.
11. FIKES, R. E., and N. J. NILSSON. 1971. Strips: a new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208.
12. FRANK, I., D. BASIN, and A. BUNDY. 1992. An adaptation of proof planning to declarer play in bridge. In European Conference on Artificial Intelligence. Wiley, New York, NY.
13. FRENCH, S. 1986. Decision theory: an introduction to the mathematics of rationality. John Wiley, New York.
14. GAMBACK, B., M. RAYNER, and B. PELL. 1990. An architecture for a sophisticated mechanical bridge player. In Heuristic programming in artificial intelligence - the second computer olympiad. Edited by D. F. Beal and D. N. L. Levy, Ellis Horwood, Chichester, UK.
15. GAMBACK, B., M. RAYNER, and B. PELL. 1993. Pragmatic reasoning in bridge. Tech. Report 299, Computer Laboratory, University of Cambridge.
16. HORACEK, H. 1990, Reasoning with uncertainty in computer chess. Artificial Intelligence, 43:37-56.
17. KHEMANI, D. 1994. Planning with thematic actions. In Proc. Second International Conference AI Planning Systems. Edited by Kristian Hammond. AAAI Press, Menlo Park, CA.
18. KNUTH, D. E. 1973. The art of computer programming, Vol. 3: sorting and searching. Addison-Wesley Pub. Co., Reading, MA.
19. LEE, K.-F., and S. MAHAJAN. 1990. The development of a world class Othello program. Artificial Intelligence, 43:21-36.
20. LEVY, D., and M. NEWBORN. 1982. All about chess and computers. Computer Science Press, Potomac, MD.
21. LINDELOF, E. 1983. COBRA: the computer designed bidding system. Victor Gollancz Ltd, London.
22. LOPATIN, A. 1992. Two combinatorial problems in programming bridge game. Computer Olympiad, unpublished.
23. MANLEY, B. 1993. Software 'judges' rate bridge-playing products. The Bulletin (published monthly by the American Contract Bridge League), 59(11):51-54.
24. QUINLAN, J. R. 1979. A knowledge-based system for locating missing high cards in bridge. In Proceedings 6th International Joint Conference Artificial Intelligence, Computer Science Dept., Stanford University, Stanford, CA, pp. 705-707.
25. SACERDOTI, E. D. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5: 115-135.
26. SACERDOTI, E. D. 1975. The nonlinear nature of plans. In Readings in planning. Edited by J. Allen, J. Hendler, and A. Täte, Morgan Kaufman, San Mateo, CA, 162-170.
27. SACERDOTI, E. D. 1977. A structure for plans and behavior. Elsevier Science Publishing, NY
28. SAMUEL, A. L. 1967. Some studies in machine learning using the game of checkers, ii-recent progress. IBM Journal of Research and Development, 2:601-617.
29. SCHAEFFER, J., J. CULBERSON, N. TRELOAR, B. KNIGHT, P. LU, and D. SZAFRON. 1992. A world championship caliber checkers program. Artificial Intelligence, 53:273-290.
30. SMITH, S. J. J., and D. S. NAU. 1993. Strategic planning for imperfect-information games. In Games: planning and learning, papers from the 1993 fall symposium. Technical Report FS9302. AAAI Press, Menlo Park, CA.
31. SMITH, S. J. J., and D. S. NAU. 1994. An analysis of forward pruning. In Proceedings 12th National Conference on Artificial Intelligence, pp. 1386-1391.
32. STANIER, A. 1975. Bribip: a bridge bidding program. In Proceedings 4th International Joint Conference on Artificial Intelligence. MIT-AI Laboratory, Cambridge, MA.
33. STERLING, L., and NYGATE, Y. 1990. Python: an expert squeezer. Journal of Logic Programming, 8:21-39.
34. TATE, A. 1976. Project planning using a hierarchic nonlinear planner. Technical Report 25. Department of Artificial Intelligence, University of Edinburgh.
35. TATE, A. 1977. Generating project networks. In Proceedings 5th International Joint Conference Artificial Intelligence. Dept. of Computer Science. Carnegie-Mellon University. Pittsburgh, PA.
36. TRUSCOTT, T. R. 1981. Techniques used in minimax game-playing programs. Master's thesis, Duke University, Durham, NC.
37. WILKINS, D. E. 1980. Using patterns and plans in chess. Artificial Intelligence, 14:165-203.
38. WILKINS, D. E. 1982. Using knowledge to control tree searching. Artificial Intelligence, 18:1-51.
39. WILKINS, D. E. 1984. Domain independent planning: representation and plan generation. Artificial Intelligence, 22:269-301.