An investigation of an adaptive poker player

22Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Other work has shown that adaptive learning can be highly successful in developing programs which are able to play games at a level similar to human players and, in some cases, exceed the ability of a vast majority of human players. This study uses poker to investigate how adaptation can be used in games of imperfect information. An internal learning value is manipulated which allows a poker playing agent to develop its playing strategy over time. The results suggest that the agent is able to learn how to play poker, initially losing, before winning as the players strategy becomes more developed. The evolved player performs well against opponents with different playing styles. Some limitations of previous work are overcome, such as deal rotation to remove the bias introduced by one player always being the last to act. This work provides encouragement that this is an area worth exploring more fully in our future work.

Cite

CITATION STYLE

APA

Kendall, G., & Willdig, M. (2001). An investigation of an adaptive poker player. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2256, pp. 189–200). Springer Verlag. https://doi.org/10.1007/3-540-45656-2_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free