A PLANNING APPROACH TO DECLARER PLAY IN CONTRACT BRIDGE

Although game‐tree search works well in perfect‐information games, it is less suitable for imperfect‐information games such as contract bridge. The lack of knowledge about the opponents’ possible moves gives the game tree a very large branching factor, making it impossible to search a significant portion of this tree in a reasonable amount of time.

[1]  S. French.  Decision Theory: An Introduction to the Mathematics of Rationality , 1986 .

[2]  Helmut Horacek,et al.  Reasoning with Uncertainty in Computer Chess , 1990, Artif. Intell..

[3]  David E. Wilkins,et al.  Using Knowledge to Control Tree Searching , 1982, Artif. Intell..

[4]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[5]  Annika Wærn,et al.  Pragmatic Reasoning in Bridge , 1993 .

[6]  Alan Bundy,et al.  An Adaptation of Proof-Planning to Declarer Play in Bridge , 1992, ECAI.

[7]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[8]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[9]  A. M. Stanier,et al.  BRIBIP: A Bridge Bidding Program , 1975, IJCAI.

[10]  Dana S. Nau,et al.  Strategic planning for imperfect-information games , 1993 .

[11]  Jonathan Schaeffer,et al.  A World Championship Caliber Checkers Program , 1992, Artif. Intell..

[12]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[13]  Monroe Newborn,et al.  All About Chess and Computers , 1982, Springer Berlin Heidelberg.

[14]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

[15]  Daniel L. S. Berlin,et al.  SPAN: Integrating Problem-Solving Tactics , 1985, IJCAI.

[16]  Dana S. Nau,et al.  An Analysis of Forward Pruning , 1994, AAAI.

[17]  J. R. Quinlan.  A Knowledge-Based System for Locating Missing High Cards in Bridge , 1979, IJCAI.

[18]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[19]  Bruce W. Ballard,et al.  The *-Minimax Search Procedure for Trees Containing Chance Nodes , 1983, Artif. Intell..

[20]  Kai-Fu Lee,et al.  The Development of a World Class Othello Program , 1990, Artif. Intell..

[21]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[22]  James A. Hendler,et al.  Toward a general framework for hierarchical task-network planning , 1993 .

[23]  Jerome A. Feldman,et al.  Decision Theory and Artificial Intelligence: I. A Semantics-Based Region Analyzer , 1974, Artif. Intell..

[24]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[25]  David Wilkins,et al.  Using Patterns and Plans in Chess , 1980, Artif. Intell..

[26]  Austin Tate,et al.  O-Plan: control in the open planning architecture , 1986 .

[27]  Leon Sterling,et al.  PYTHON: An Expert Squeezer , 1990, J. Log. Program..

[28]  Deepak Khemani.  Planning with Thematic Actions , 1994, AIPS.

[29]  Carl Ebeling,et al.  Measuring the Performance Potential of Chess Programs , 1990, Artif. Intell..

[30]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[31]  Jerome A. Feldman,et al.  Decision Theory and Artificial Intelligence II: The Hungry Monkey , 1977, Cogn. Sci..

[32]  J. R. Quintan.  A knowledge-based system for locating missing high cards in bridge , 1979, IJCAI 1979.

[33]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .