L. Pena, Probabilities and simulations in poker, Master's Thesis, University of Alberta, Edmonton, AB, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Challenge of Poker - Billings, Davidson, Schaeffer.. (2001) (7 citations) (Correct)
....over at 15,000 hands, but pokisim S is lower before and after that point. There have been hundreds of self play experiments over the last few years, testing individual enhancements, and the e ects of di erent game conditions. We refer the reader to our previous publications for further details [5, 6, 7, 10, 24, 25, 27]. 8 A Framework for Non Deterministic GamePlaying Programs Using simulations for non deterministic games is not new. Consider the following three games: 1. In Scrabble, the opponent s tiles are unknown, so the outcome of future turns must be determined probabilistically. A simulation consists ....
L. Pena. Probabilities and simulations in poker. Master's thesis, University of Alberta, 1999.
Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (165 citations) (Correct)
No context found.
L. Pena, Probabilities and simulations in poker, Master's Thesis, University of Alberta, Edmonton, AB, 1999.
Opponent Modeling in Poker: Learning and Acting in a Hostile and .. - Davidson (2002) (1 citation) (Correct)
No context found.
L. Pena. Probabilities and simulations in poker. Master's thesis, University of Alberta, 1999.
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