DOI QR코드

DOI QR Code

A Learning AI Algorithm for Poker with Embedded Opponent Modeling

  • Kim, Seong-Gon (CISE department, University of Florida) ;
  • Kim, Yong-Gi (Dept of Computer Science, Gyeongsang National University)
  • 투고 : 2010.03.15
  • 심사 : 2010.09.07
  • 발행 : 2010.09.30

초록

Poker is a game of imperfect information where competing players must deal with multiple risk factors stemming from unknown information while making the best decision to win, and this makes it an interesting test-bed for artificial intelligence research. This paper introduces a new learning AI algorithm with embedded opponent modeling that can be used for these types of situations and we use this AI and apply it to a poker program. The new AI will be based on several graphs with each of its nodes representing inputs, and the algorithm will learn the optimal decision to make by updating the weight of the edges connecting these nodes and returning a probability for each action the graphs represent.

키워드

참고문헌

  1. Furnkranz, J., “Machine Learning in Computer Chess: The Next Generation”, Austrian Research Institute for Artificial Intelligence, Vienna, TR-96-11, 1996.
  2. Schaeffer, J., Culberson, J., Treloar, N., Knight, B., Lu, P., Szafron, D., “A World Championship Caliber Checkers Program”, Artificial Intelligence, Vol. 53, No. 2-3, pp.273-290, 1992. https://doi.org/10.1016/0004-3702(92)90074-8
  3. Schaeffer, J., Burch, N., Bjornsson, Y., Kishimoto, A., Muller, M., Lake, R., Lu, P., Sutphen, S., “Checkers is Solved”, Science, Vol. 317, No. 5844, pp.1518 – 1522, September 2007. https://doi.org/10.1126/science.1144079
  4. Wu, L., Baldi, P., “A scalable machine learning approach to Go”, Advances in Neural Information Processing Systems 19, B. Scholkopf, J. Platt, and T. Hoffman (ed.), Cambridge, MA: MIT Press, pp. 1521-1528, 2007.
  5. Buro, M., “The Evolution of Strong Othello Programs”, Entertainment Computing - Technology and Applications, R. Nakatsu and J. Hoshino (ed.), Kluwer, pp.81-88, 2003.
  6. Buro, M., “How Machines have Learned to Play Othello”, IEEE Intelligent Systems, Vol. 14(6), pp.12-14, 1999.
  7. Slansky, D., Malmuth, M., Hold’em Poker for Advanced Players,Two Plus Two Publishing, 1994.
  8. Billings, D., Papp, D., Schaeffer, J. Szafron, D., “Opponent Modeling in Poker”, AAAI’98 , Madison, Wisconsin, pp.493-499, 1998.
  9. Slansky, D., The Theory of Poker, Two Plus Two Publishing, 1999.
  10. Chopra, A., “Knowledge and Strategy-based Computer Player for Texas Hold'em Poker”, MS Thesis, University of Edinburgh, 2006.
  11. Billings, D., Davidson, A., Schaeffer, J. Szafron, D., “The Challenge of Poker”, Artificial Intelligence, Vol. 134(1-2), pp.201-240, 2002. https://doi.org/10.1016/S0004-3702(01)00130-8
  12. Johanson, M., “Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player”, MS Thesis, University of Alberta, 2007.
  13. Chen, B., Ankenman, J., The Mathematics of Poker, ConJelCo Publishing, 2006.
  14. Darse Billings, “Algorithms and assessment in Computer Poker”, Ph.D. dissertation, University of Alberta, 2006.
  15. Davidson, A., Billings, D., Shaeffer, J., Szafron, D., “Improved Opponent Modeling in Poker”, ICAI'2000 , Las Vegas, Nevada, pp.1467-1473, 2000.
  16. Billings, D., Papp, D., Schaeffer, J., Szafron, D., “Poker as a Testbed for AI Research”, AI’98 ,Vancouver, BC, Canada, Vol. 1418, pp.228 – 238, 1998. https://doi.org/10.1007/3-540-64575-6_53
  17. Lazaric, A., Quaresimale, M., Restelli, M., “On the usefulness of opponent modeling: the Kuhn Poker case study”, Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, Estoril, Portugal, Vol. 3, Pages: 1345-1348, 2008. https://doi.org/10.1.1.149.6912
  18. Richards, M., Amir, E., “Opponent modeling in scrabble”, IJCAI, pp. 1482–1487, 2007.
  19. Sheppard, B., “World-championship-caliber scrabble”, Artificial Intelligence, 134(1-2):241–275, 2002. https://doi.org/10.1016/S0004-3702(01)00166-7