• 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={Matthew L. 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. 
World-championship-caliber Scrabble
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.
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.
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.
The State of Automated Bridge Play
TLDR
The game of Bridge provides a number of research areas to AI researchers due to the many components that constitute the game, particularly double-dummy play, but researchers have made much progress in each of these sub-fields over the years, but are yet to produce a consistent expert level player.
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 Computer
3 . REQUIREMENTS FOR A WORLD-CLASS POKER PLAYER
TLDR
The implicit and explicit learning in the poker program Lok i, which implicitly “learns” sophisticated strategies by selectively sampling likely cards for the opponents and then simulating the remainder of the game, is described and evaluated.
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.
Symbolic Exploration in Two-Player Games: Preliminary Results
TLDR
The study puts forth the idea that BDDs are widely applicable in game playing and provides a universal tool for people interested in quickly solving practical problems.
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.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
One jump ahead - challenging human supremacy in checkers
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.
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. Both
Using Patterns and Plans in Chess
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.
Conspiracy Numbers for Min-Max Search
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.
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.
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.
Iterative Broadening
...
...