{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:43:24Z","timestamp":1779360204372,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642052231","type":"print"},{"value":"9783642052248","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05224-8_28","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T09:45:03Z","timestamp":1257155103000},"page":"367-381","source":"Crossref","is-referenced-by-count":29,"title":["Monte-Carlo Tree Search in Poker Using Expected Reward Distributions"],"prefix":"10.1007","author":[{"given":"Guy","family":"Van den Broeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Driessens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Gilpin, A., Sandholm, T., S\u00f8rensen, T.: A heads-up no-limit Texas Hold\u2019em poker player: discretized betting models and automatically generated equilibrium-finding programs. In: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, vol.\u00a02, pp. 911\u2013918 (2008)"},{"key":"28_CR2","unstructured":"Billings, D.: Algorithms and assessment in computer poker. PhD thesis, Edmonton, Alta, Canada (2006)"},{"key":"28_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesvari, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"28_CR4","volume-title":"Artificial intelligence: A modern approach","author":"S. Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice Hall, Englewood Cliffs (2003)"},{"key":"28_CR5","unstructured":"Suffecool, K.: Cactus kev\u2019s poker hand evaluator (July 2007), \n                    \n                      http:\/\/www.suffecool.net\/poker\/evaluator.html"},{"key":"28_CR6","volume-title":"Data Mining: Practical machine learning tools and techniques","author":"H. Witten Ian","year":"2005","unstructured":"Witten Ian, H., Eibe, F.: Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco (2005)"},{"key":"28_CR7","unstructured":"Wang, Y., Witten, I.: Induction of model trees for predicting continuous classes (1996)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"28_CR9","unstructured":"Gelly, S., Wang, Y.: Exploration exploitation in go: UCT for Monte-Carlo go. In: Twentieth Annual Conference on Neural Information Processing Systems, NIPS 2006 (2006)"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"G. Chaslot","year":"2008","unstructured":"Chaslot, G., Winands, M., Herik, H., Uiterwijk, J., Bouzy, B.: Progressive strategies for monte-carlo tree search. New Mathematics and Natural Computation\u00a04(3), 343 (2008)","journal-title":"New Mathematics and Natural Computation"},{"key":"28_CR11","unstructured":"Van Lishout, F., Chaslot, G., Uiterwijk, J.: Monte-Carlo Tree Search in Backgammon. In: Computer Games Workshop, pp.\u00a0175\u2013184 (2007)"},{"issue":"2-3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Advances in Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05224-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T05:58:58Z","timestamp":1552197538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05224-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052231","9783642052248"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05224-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}