Matthew L. Ginsberg  Home/Search
Context Related
| cmu.edu/afs/cs/proje...ginsberg01a.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: jair.org/conten...withabstracts (more) Homepages: M.Ginsberg |
Rate this article:      (best)Comment on this article |
Abstract: This paper investigates the problems arising in the construction of a program to play the (Update)
Context of citations to this paper: More
.... the high variance have prompted Matt Ginsberg, the author of GIB, to look at other solutions, including building the entire search tree [16]. We too may have to look for new approaches to overcome the limitations of simulations. The poker project is rich in research...
Cited by: More
Unknown - Ames Provide Competitive (Correct)
A Reinforcement Learning Scheme for a Partially-Observable.. - Ishii, Fujita, Al. (2004) (Correct)
Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (Correct)
Similar documents (at the sentence level):
7.7%: GIB: Steps Toward an Expert-Level Bridge-Playing Program - Ginsberg (1999) (Correct)
7.3%: Partition Search - Ginsberg (1996) (Correct)
Active bibliography (related documents): More All
0.8: The Games Computers (and People) Play - Schaeffer (2000) (Correct)
0.4: Asynchronous Parallel Game-Tree Search - Brockington (1998) (Correct)
0.3: A Theoretical and Empirical Investigation of Search in.. - Frank, Basin (1999) (Correct)
Similar documents based on text: More All
0.3: The Challenge of Poker - Billings, Davidson, Schaeffer.. (2001) (Correct)
0.3: Improved Opponent Modeling in Poker - Davidson, Billings, Schaeffer.. (2000) (Correct)
0.2: Can Search Play A Role in Practical Applications? - Ginsberg, Drabble, Etherington (1998) (Correct)
Related documents from co-citation: More All
3: Programming backgammon using self-teaching neural nets (context) - Tesauro - 2001
3: Opponent modeling in poker - Billings, Papp et al. - 1998
3: Using probabilistic knowledge and simulation to play poker - Billings, Pena et al. - 1999
BibTeX entry: (Update)
M. Ginsberg. GIB: Imperfect information in a computationally challenging game. Journal of Articial Intelligence Research, 2001. To appear. http://citeseer.ist.psu.edu/ginsberg01gib.html More
@misc{ ginsberg01gib,
author = "M. Ginsberg",
title = "GIB: Imperfect information in a computationally challenging game",
text = "M. Ginsberg. GIB: Imperfect information in a computationally challenging
game. Journal of Articial Intelligence Research, 2001. To appear.",
year = "2001",
url = "citeseer.ist.psu.edu/ginsberg01gib.html" }
Citations (may not include all citations):155 Forward reasoning and dependency-directed backtracking in a .. (context) - Stallman, Sussman - 1977
46 A complexity analysis of space-bounded learning algorithms f.. - Bayardo, Miranker - 1996
43 Dynamic backtracking - Ginsberg - 1993
23 Squeaky wheel optimization - Joslin, Clements - 1999
23 General Lattice Theory (context) - atzer - 1978
20 Iterative broadening - Ginsberg, Harvey - 1992
19 Asymptotic properties of minimax trees and game-searching pr.. (context) - Pearl - 1980
18 Total-order multi-agent task-network planning for contract b.. - Smith, Nau et al. - 1996
17 Search in games with incomplete information: A case study us.. - Frank, Basin - 1998
15 Generating and solving imperfect information games - Koller, Pfe - 1995
14 The greenblatt chess program (context) - Greenblatt, Eastlake et al. - 1967
14 The million pound bridge program (context) - Levy - 1989
14 Opponent modeling in poker - Billings, Papp et al. - 1998
13 A solution for the branching factor of the alpha-beta prunin.. (context) - Pearl - 1982
12 Search and Planning under Incomplete Information: A Study Us.. - Frank - 1998
12 Finding optimal strategies for imperfect information games - Frank, Basin et al. - 1998
11 Some methods of controlling the tree search in chess program.. (context) - Adelson-Velskiy, Arlazarov et al. - 1975
10 PYTHON: An expert squeezer (context) - Sterling, Nygate - 1990
9 Exploiting graph properties of game trees - Plaat, Schae et al. - 1996
8 One Jump Ahead: Challenging Human Supremacy in Checkers (context) - er - 1997
7 Conspiracy numbers for min-max searching (context) - McAllester - 1988
7 BuDDy: Binary Decision Diagram package (context) - Lind-Nielsen - 2000
3 GIB: Sensational breakthrough in bridge software (context) - Eskes - 1997
2 Five Weeks to Winning Bridge (context) - Sheinwold - 1996
2 Play of the Hand with Blackwood (context) - Blackwood - 1979
1 Alpha-beta pruning under partial orders (context) - Ginsberg, Ja - 2001
1 Combining knowledge and search to solve singlesuit bridge - Frank, Basin et al. - 2000
Documents on the same site (http://jair.org/contents/complete-with-abstracts.html): More
Randomized Algorithms for the Loop Cutset Problem - Becker, Bar-Yehuda, Geiger (2000) (Correct)
A Model of Inductive Bias Learning - Baxter (2000) (Correct)
Reasoning on Interval and Point-based Disjunctive Metric.. - Barber (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC