{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:33:48Z","timestamp":1725831228605},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_12","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T07:00:40Z","timestamp":1443510040000},"page":"151-165","source":"Crossref","is-referenced-by-count":3,"title":["A Doppelkopf Player Based on UCT"],"prefix":"10.1007","author":[{"given":"Silvan","family":"Sievers","sequence":"first","affiliation":[]},{"given":"Malte","family":"Helmert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"12_CR1","unstructured":"Deutscher Doppelkopf Verband. http:\/\/www.doko-verband.de (Online; in German; accessed April 28, 2015)"},{"key":"12_CR2","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 47, 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bez\u00e1kov\u00e1, I., \u0160tefankovi\u010d, D., Vazirani, V.V., Vigoda, E.: Accelerating simulated annealing for the permanent and combinatorial counting problems. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 900\u2013907. SODA 2006. ACM (2006)","DOI":"10.1145\/1109557.1109656"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bjarnason, R., Fern, A., Tadepalli, P.: Lower bounding Klondike solitaire with Monte-Carlo planning. In: Gerevini, A., Howe, A., Cesta, A., Refanidis, I. (eds.) Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, ICAPS 2009, pp. 26\u201333. AAAI Press (2009)","DOI":"10.1609\/icaps.v19i1.13363"},{"key":"12_CR5","unstructured":"Buro, M., Long, J.R., Furtak, T., Sturtevant, N.: Improving state evaluation, inference, and search in trick-based card games. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1407\u20131413 (2009)"},{"key":"12_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press (1990)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-33347-7_3","volume-title":"KI 2012: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2012","unstructured":"Edelkamp, S., Federholzner, T., Kissmann, P.: Searching with partial belief states in general games with incomplete information. In: Glimm, B., Kr\u00fcger, A. (eds.) KI 2012. LNCS, vol. 7526, pp. 25\u201336. Springer, Heidelberg (2012)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Eyerich, P., Keller, T., Helmert, M.: High-quality policies for the Canadian traveler\u2019s problem. In: Fox, M., Poole, D. (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, pp. 51\u201358. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7542"},{"key":"12_CR9","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, pp. 259\u2013264. AAAI Press (2008)"},{"key":"12_CR10","unstructured":"Furtak, T., Buro, M.: Using payoff-similarity to speed up search. In: Walsh [25], pp. 534\u2013539"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Furtak, T., Buro, M.: Recursive Monte Carlo search for imperfect information games. In: 2013 IEEE Conference on Computational Intelligence in Games (CIG), Niagara Falls, ON, Canada, August 11\u201313, pp. 1\u20138. IEEE (2013)","DOI":"10.1109\/CIG.2013.6633646"},{"key":"12_CR12","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with Patterns in Monte-Carlo Go. Tech. Rep. 6062, INRIA (November 2006)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Keller, T., Eyerich, P.: PROST: Probabilistic planning based on UCT. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 119\u2013127. AAAI Press (2012)","DOI":"10.1609\/icaps.v22i1.13518"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-85845-4_12","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"T Keller","year":"2008","unstructured":"Keller, T., Kupferschmid, S.: Automatic bidding for the game of skat. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 95\u2013102. Springer, Heidelberg (2008)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science (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., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kupferschmid, S., Helmert, M.: A Skat player based on Monte Carlo simulation. In: Proceedings of the Fifth International Conference on Computers and Games, CG 2006, pp. 135\u2013147 (2006)","DOI":"10.1007\/978-3-540-75538-8_12"},{"key":"12_CR17","unstructured":"Long, J.R., Buro, M.: Real-time opponent modeling in trick-taking card games. In: Walsh [25], pp. 617\u2013622"},{"key":"12_CR18","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence \u2013 A Modern Approach. Prentice Hall (2003)"},{"key":"12_CR19","unstructured":"Sch\u00e4fer, J.: The UCT Algorithm Applied to Games with Imperfect Information. Master\u2019s thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (July 2008)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Schofield, M.J., Cerexhe, T.J., Thielscher, M.: Hyperplay: A solution to general game playing with imperfect information. In: Hoffmann, J., Selman, B. (eds.) Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2012, pp. 1606\u20131612. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8335"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Schofield, M.J., Thielscher, M.: Lifting model sampling for general game playing to incomplete-information models. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015, pp. 3585\u20133591. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9675"},{"key":"12_CR22","unstructured":"Sievers, S.: Implementation of the UCT Algorithm for Doppelkopf. Master\u2019s thesis, University of Freiburg, Germany (April 2012)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-87608-3_4","volume-title":"Computers and Games","author":"NR Sturtevant","year":"2008","unstructured":"Sturtevant, N.R.: An analysis of UCT in multi-player games. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T18:04:56Z","timestamp":1692036296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}