Darse Billings, Aaron Davidson, Jonathan Schaeffer, Duane Szafron  Home/Search
Context Related
| cs.ualberta.ca/~davids...AIJpoker.ps.gz cs.ualberta.ca/~darse/Paper...AIJ01.ps 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: cs.ualberta.ca/~davidson/schoo... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Poker is an interesting test-bed for arti cial intelligence research. It is a game of imperfect information, where multiple competing agents must deal with probabilistic knowledge, risk assessment, and possible deception, not unlike decisions made in the real world. Opponent modeling is another dicult problem in decision-making applications, and it is essential to achieving high performance in poker. This paper describes the design considerations and architecture of the poker program Poki. In... (Update)
Cited by: More
Unknown - Ames Provide Competitive (Correct)
The Evolution of Blackjack Strategies - Graham Kendall School (2003) (Correct)
Similar documents (at the sentence level):
64.3%: Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (Correct)
15.1%: Opponent Modeling in Poker: Learning and Acting in a Hostile and .. - Davidson (2002) (Correct)
Active bibliography (related documents): More All
1.5: Learning to Play Strong Poker - Schaeffer, Billings, Peņa, Szafron (1999) (Correct)
1.2: Computer Poker - Billings (1995) (Correct)
1.0: The Games Computers (and People) Play - Schaeffer (2000) (Correct)
Similar documents based on text: More All
0.6: Opponent Modeling in Poker - Billings, Papp, Schaeffer, Szafron (1998) (Correct)
0.6: Improved Opponent Modeling in Poker - Davidson, Billings, Schaeffer.. (Correct)
0.5: Using Probabilistic Knowledge and Simulation to Play Poker - Billings, Peņa.. (1999) (Correct)
Related documents from co-citation: More All
5: Blondie24 : Playing at the Edge of AI (context) - Fogel - 2001
5: One Jump Ahead: Challenging Human Supremacy in Checkers (context) - Schaeffer - 1997
5: Evolving an Expert Checkers Playing Program without Using Human Expertise (context) - Chellapilla, Fogel - 1961
BibTeX entry: (Update)
Billings, D., Davidson, A., Schaeffer, J., and Szafron, D. (2002). The challenge of poker. Artificial Intelligence 134, pages 201--240. http://citeseer.ist.psu.edu/billings01challenge.html More
@article{ billings02challenge,
author = "Darse Billings and Aaron Davidson and Jonathan Schaeffer and Duane Szafron",
title = "The challenge of poker",
journal = "Artificial Intelligence",
volume = "134",
number = "1-2",
pages = "201-240",
year = "2002",
url = "citeseer.ist.psu.edu/billings01challenge.html" }
Citations (may not include all citations):182 The Theory of Games and Economic Behavior (context) - von Neumann, Morgenstern - 1947
125 Non-cooperative games (context) - Nash - 1951
79 Simulation approaches to general probabilistic inference on .. (context) - Shacter, Peot - 1989
40 Flexible learning of problem solving heuristics through adap.. (context) - Smith - 1983
32 Representations and solutions for game-theoretic problems - Koller, Pfe - 1997
31 Weighting and integrating evidence for stochastic simulation.. (context) - Fung, Chang - 1989
23 GIB: Steps toward an expert-level bridge-playing program - Ginsberg - 1999
22 erence learning and TD-Gammon (context) - Tesauro - 1995
22 Partition search - Ginsberg - 1996
18 Studies in machine cognition using the game of poker (context) - Findler - 1977
15 Incorporating opponent models into adversary search - Carmel, Markovitch - 1995
15 Measuring the performance potential of chess programs (context) - Berliner, Goetsch et al. - 1990
14 Opponent modeling in poker - Billings, Papp et al. - 1998
13 Contributions to the Theory of Games (context) - Kuhn, two-person - 1950
12 Using probabilistic knowledge and simulation to play poker - Billings, Pena et al. - 1999
11 Using Knowledge About the Opponent in Game-Tree Search (context) - Jansen - 1992
10 A generalization learning technique for automating the learn.. (context) - Waterman - 1970
9 A simple three-person poker game (context) - Nash, Shapley - 1950
9 Solutions of some three-person stud and draw poker (context) - Sakaguchi, Sakai - 1992
9 Hold'em Poker for Advanced Players (context) - Sklansky, Malmuth - 1994
9 Programming backgammon using self-teaching neural nets (context) - Tesauro - 2001
8 Two Plus Two Publishing (context) - Sklansky, of - 1992
7 Dealing with imperfect information in poker - Papp - 1998
6 Using selectivesampling simulations in poker - Billings, Papp et al. - 1999
6 Abstraction models for game theoretic poker (context) - Shi, Littman - 2001
6 Thoughts on the Application of Opponent-Model Search (context) - Iida, Uiterwijk et al. - 1995
6 Improved opponent modeling in poker - Davidson, Billings et al.
6 Bayesian poker - Korb, Nicholson - 1999
6 International Computer Games Association Journal (context) - Egnor - 2000
5 GIB: Imperfect information in a computationally challenging .. - Ginsberg - 2001
5 tree search algorithm: A best-rst proof procedure (context) - Berliner - 1979
5 Winning Poker Systems (context) - Zadeh - 1974
4 The rst international Roshambo programming competition (context) - Billings - 2000
4 Recognizing poker hands with genetic programming and restric.. (context) - Cheng - 1997
3 International Computer Games Association Journal (context) - Billings, Roshambo - 2000
3 Computation of optimal poker strategies (context) - Zadeh - 1977
3 Probabilities and simulations in poker - Pena - 1999
3 Nash Equilibrium of Texas Hold'em Poker (context) - Takusagawa - 2000
3 Learning to play strong poker (context) - Schae, Billings et al. - 2001
2 Optimal heads-up pre op poker (context) - Selby - 1999
1 Elsewhere in this issue (context) - Sheppard, Articial - 2001
Documents on the same site (http://www.cs.ualberta.ca/~davidson/school/): More
Solving Games with Distributed Computing: A System for Network RAM - Davidson (2000) (Correct)
A Fast Pruning Algorithm for Optimal Sequence Alignment - Davidson (2001) (Correct)
Using Artifical Neural Networks to Model Opponents in Texas Hold'em - Davidson (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