Corpus ID: 991641

GIB: Steps Toward an Expert-Level Bridge-Playing Program

@inproceedings{Ginsberg1999GIBST,
  title={GIB: Steps Toward an Expert-Level Bridge-Playing Program},
  author={M. Ginsberg},
  booktitle={IJCAI},
  year={1999}
}
This paper describes GIB, the first bridge-playing program to approach the level of a human expert. (GIB finished twelfth in a handpicked field of thirty-four experts at an invitational event at the 1998 World Bridge Championships.) We give a basic overview of the algorithms used, describe their strengths and weaknesses, and present the results of experiments comparing GIB to both human opponents and other programs. 

Topics from this paper

World-championship-caliber Scrabble
  • B. Sheppard
  • Computer Science, Mathematics
  • Artif. Intell.
  • 2002
TLDR
MAVEN combines a selective move generator, simulations of likely game scenarios, and the B* algorithm to produce a world-championship-caliber Scrabble-playing program. Expand
Issues in Designing Tutors for Games of Incomplete Information: a Bridge Case Study
TLDR
Some of the AI techniques that have proved successful for implementing bridge playing systems are examined and how they might be adapted for teaching the game are discussed. Expand
The dark side of the board: advances in chess Kriegspiel
TLDR
This thesis presents, documents and tests a multi-sided effort towards making a strong Kriegspiel player, using heuristic searching, retrograde analysis and Monte Carlo tree search algorithms to achieve increasingly higher levels of play. Expand
Opponent Modelling and Search in Poker
TLDR
The work in this thesis explores the task of learning how an opponent plays and subsequently coming up with a counter-strategy that can exploit that information, using expectimax search. Expand
The State of Automated Bridge Play
The game of Bridge provides a number of research areas to AI researchers due to the many components that constitute the game. Bidding provides the subtle challenge of potential outcome maximizationExpand
The History of Computer Games
1989: Gerald Tesauro’s neural network-based Neurogammon, which was trained with a database of games played by expert human players, won the backgammon championship at the 1989 International ComputerExpand
3 . REQUIREMENTS FOR A WORLD-CLASS POKER PLAYER
Poker is an interesting test-bed for artificial intelligence research. It is a game of imperfect knowledge, where multiple competing agents must deal with risk management, opponent modeling,Expand
A Gamut of Games
TLDR
The past successes, current projects, and future research directions for AI using computer games as a research test bed are reviewed. Expand
Symbolic Exploration in Two-Player Games: Preliminary Results
In this paper symbolic exploration with binary decision diagrams (BDDs) is applied to two-player games to improve main memory consumption for reachability analysis and game-theoreticalExpand
CASPER: DESIGN AND DEVELOPMENT OF A CASE-BASED POKER PLAYER
TLDR
The design and development of a CASe-based Poker playER (CASPER) that uses the Case-Based Reasoning methodology to make betting decisions at the poker table is discussed, suggesting it is possible to record instances of games played between strong poker players and then reuse these to obtain a similar performance therefore bypassing the need for the initial, intensive knowledge engineering process. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
One jump ahead - challenging human supremacy in checkers
  • J. Schaeffer
  • Engineering, Computer Science
  • J. Int. Comput. Games Assoc.
  • 1997
TLDR
This extraordinary book tells the story of the creation of the world champion checkers computer program, Chinook, from its beginnings in 1988 to the final match against the then world champion, Marion Tinsley in 1992. Expand
Partition Search
We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. BothExpand
Using Patterns and Plans in Chess
TLDR
A program, PARADISE (PAttern Recognition Applied to DIrecting SEarch), which finds the best move in tactically sharp middle game positions from the games of chess masters, encodes a large body of knowledge in the form of production rules. Expand
Opponent Modeling in Poker
TLDR
Loki is described and evaluated, a poker program capable of observing its opponents, constructing opponent models and dynamically adapting its play to best exploit patterns in the opponents' play. Expand
Search in Games with Incomplete Information: A Case Study Using Bridge Card Play
TLDR
It is shown that equilibrium point strategies for optimal play exist for this model, and an algorithm capable of computing such strategies is defined, and this model allows for clearly state the limitations of such architectures in producing expert analysis. Expand
Conspiracy Numbers for Min-Max Search
TLDR
This new tree-growth procedure is based on “conspiracy numbers” as a measure of the accuracy of the root minimax value of an incomplete tree, and unlike B∗ search, nonuniform growth is achieved without any modification of the static-board evaluator. Expand
Total-Order Multi-Agent Task-Network Planning for Contract Bridge
TLDR
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge, and explains why the same technique has been successful in two such diverse domains. Expand
Generating and Solving Imperfect Information Games
TLDR
Gala is described an implemented system that provides the user with a very natural and expressive language for describing games and implements the first practical algorithm for finding optimal randomized strategies in two player imperfect information competitive games. Expand
Artificial Intelligence
TLDR
The history, the major landmarks, and some of the controversies in each of these twelve topics are discussed, as well as some predictions about the course of future research. Expand
Iterative Broadening
TLDR
It is shown that a new search technique that is called iterative broadening leads to orders-of-magnitude savings in the time needed to search a space satisfying this assumption. Expand
...
1
2
3
4
...