C. Cheng, Recognizing poker hands with genetic programming and restricted iteration, in: J. Koza (Ed.), Genetic Algorithms and Genetic Programming at Stanford, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Challenge of Poker - Billings, Davidson, Schaeffer.. (2001) (7 citations) (Correct)
....problems ( 26] for example) Another way to reduce the complexity of the problem is to look at a subset of the game, and try to address each sub problem in isolation. Several attempts have been made to apply machine learning techniques to a particular aspect of poker (some examples include [9, 20, 34, 39]) Similarly, many studies only look at two player poker games. Multi player games are vastly more complicated, even with the usual assumption of no co operative behavior between players. The danger with any type of simpli cation is that it can destroy the most challenging and interesting aspects ....
C. Cheng. Recognizing poker hands with genetic programming and restricted iteration. In J. Koza, editor, Genetic Algorithms and Genetic Programming at Stanford, 1997.
Learning to Play Strong Poker - Schaeffer, Billings, Peņa, Szafron (1999) (1 citation) (Correct)
....of the problem that are of interest to AI researchers. A variant of this approach is to look at a subset of the game, and try to address each component in isolation. Several attempts have been made to apply machine learning techniques to individual aspects of poker (some examples include [19,21,6]) The second approach, and the one that we advocate, is to tackle the entire problem: choose a real variant of poker and address all the considerations necessary to build a program that performs at a level comparable to that of the best human players. Clearly this is the most ambitious ....
Cheng, C. (1997). Recognizing poker hands with genetic programming and restricted iteration. Genetic Algorithms and Genetic programming at Stanford, J. Koza (editor), Stanford, California.
An Indexed Bibliography of Genetic Programming - Alander (1994) (Correct)
....Buxton, Bernard, 291, 356] Cagnoni, Stefano, 438] Carmi, Aviram, 132, 169] Cerdan, S. 287] Chan, King Choi, 184] Charif, Adib, 219] Cheatham, John B. 281, 282] Chellapilla, Kumar, 391] Chen, S. 331] Chen, Shu Heng, 330, 332, 374, 378, 442, 465, 466, 470, 471] Cheng, Cleve, [392] Cho, Sung Bae, 224] Chongistitvatana, P. 272] Chongstitvatana, P. 242] Chopard, Bastien, 220, 324, 433] Clark, Adam, 185] Cloutier, Jocelyn, 85] Cohen, Paul R. 83, 476, 477] Collard, Philippe, 145] Cona, John, 186] Coon, Brett W. 88] Cotta, Carlos, 263, 273] Cramer, Nichael ....
.... stack, 119] finite automata, 270] fitness landscapes genetic programming, 104] fitting Mackey Glass, 119] formal languages context free, 248] fractals IFS, 187] ftiness limited error, 460] function approximation, 180] GA P, 200] game theory, 279] games, 390] Nim, 422] poker, [392] Tetris, 234] tile puzzle, 188] genetic programming, 489, 485, 490, 506, 483, 487, 488, 37, 507, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 474, 475, 501, 508, 40, 50, 51, 52, 53, 54, 55, 56, 57, 58, 525, 530, 536, 537, 77, 493, 494, 499, 500, 509, 511, 59, 60, 61, 62, 63, 64, 65, 66, 67, ....
[Article contains additional citation context not shown here]
Cleve Cheng. Recognizing poker hands with genetic programming and restricted iteration. In Koza [561], page ? y(Koza) ga97aCheng.
Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002) (165 citations) (Correct)
No context found.
C. Cheng, Recognizing poker hands with genetic programming and restricted iteration, in: J. Koza (Ed.), Genetic Algorithms and Genetic Programming at Stanford, 1997.
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