| J. Schaeffer, D. Billings, L. Pena, D. Szafron, Learning to play strong poker, in: J. Frnkranz, M. Kubat (Eds.), Machines that Learn to Play Games, Nova Science Publishers, Huntington, NY, to appear. |
....of perfect information, otherwise known as combinatorial games [9] These games are classified as two player games, with no hidden information, no chance moves, a restricted outcome (win, lose and draw) and with each player moving alternately. This is different to games such as poker [10] 11] [12], backgammon [13] 14] 15] 16] or bridge [17] 18] 19] 20] where there is hidden information, a chance element and, possibly, more than two players. A recent survey of computers and game playing [21] covers those games above, as well as others. In this work we look at a combinatorial ....
J. Schaeffer, D. Billings L. Pea, D. Szafron, "Learning to Play Strong Poker." In proceedings of the Sixteenth International Conference on Machine Learning (ICML-99), J. Stefan Institute, Slovenia (Invited Paper), 1999
No context found.
J. Schaeffer, D. Billings, L. Pena, D. Szafron, Learning to play strong poker, in: J. Frnkranz, M. Kubat (Eds.), Machines that Learn to Play Games, Nova Science Publishers, Huntington, NY, to appear.
No context found.
Jonathan Schaeer, Darse Billings, Lourdes Pe~na, and Duane Szafron. Learning to play strong poker. In ICML{99 Workshop on Machine Learning in Game Playing, 1999. In press.
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