GIB: Imperfect Information in a Computationally Challenging Game

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1613/jair.820

This paper investigates the problems arising in the construction of a program to play the game of contract bridge. These problems include both the difficulty of solving the game's perfect information variant, and techniques needed to address the fact that bridge is not, in fact, a perfect information game. GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems. GIB is currently believed to be of approximately expert caliber, and is currently the strongest computer bridge program in the world.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

GIB: Imperfect Information in a Computationally Challenging Game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GIB: Imperfect Information in a Computationally Challenging Game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GIB: Imperfect Information in a Computationally Challenging Game will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-224034

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.