{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T15:49:54Z","timestamp":1790783394701,"version":"4.1.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030582845","type":"print"},{"value":"9783030582852","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58285-2_2","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:00:01Z","timestamp":1599728401000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Play via Suit Factorization Search in Skat"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"key":"2_CR1","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, Vol. 1\u20134. A K Peters (2001)"},{"issue":"11","key":"2_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/3131284","volume":"60","author":"M Bowling","year":"2017","unstructured":"Bowling, M., Burch, N., Johanson, M., Tammelin, O.: Heads-up limit hold\u2019em poker is solved. Commun. ACM 60(11), 81\u201388 (2017)","journal-title":"Commun. ACM"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"2_CR4","unstructured":"Cazenave, T., Ventos, V.: The $$\\alpha $$$$\\mu $$ search algorithm for the game of Bridge. CoRR, abs\/1911.07960 (2019)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Challenging human supremacy in Skat. In: Symposium on Combinatorial Search (SOCS), pp. 52\u201360 (2019)","DOI":"10.1609\/socs.v10i1.18502"},{"key":"2_CR6","unstructured":"Edelkamp, S.: Representing and reducing uncertainty for enumerating the belief space to improve endgame play in Skat. In: European Conference on Artificial Intelligence (ECAI) (2020)"},{"key":"2_CR7","unstructured":"Furtak, T.M.: Symmetries and search in trick-taking card games. Ph.D. thesis, University of Alberta (2013)"},{"key":"2_CR8","unstructured":"Ginsberg, M.: Step toward an expert-level Bridge-playing program. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 584\u2013589 (1999)"},{"key":"2_CR9","unstructured":"G\u00f6\u00dfl, R.: Der Skatfuchs - Gewinnen im Skatspiel mit Mathematische Methoden. Selfpublisher. D\u00e4mmig, Chemnitz, Available from the Author or via DSKV Altenburg (2019)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Keller, T., Kupferschmid, S.: Automatic bidding for the game of Skat. In: German Conference on Artificial Intelligence (KI), pp. 95\u2013102 (2008)","DOI":"10.1007\/978-3-540-85845-4_12"},{"key":"2_CR11","unstructured":"Knorr, F.: Ein selbstkalibrierender Spieler f\u00fcr Skat. Master\u2019s thesis, Universit\u00e4t Passau (2018)"},{"key":"2_CR12","unstructured":"Kupferschmid, S.: Entwicklung eines Double-Dummy Skat Solvers mit einer Anwendung f\u00fcr verdeckte Skatspiele. Master\u2019s thesis, Albert-Ludwigs-Universit\u00e4t Freiburg (2003)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kupferschmid, S., Helmert, M.: A Skat player based on Monte-Carlo simulation. In: Computers and Games, pp. 135\u2013147 (2006)","DOI":"10.1007\/978-3-540-75538-8_12"},{"key":"2_CR14","volume-title":"Das verst\u00e4ndige Kartenspiel","author":"E Lasker","year":"1929","unstructured":"Lasker, E.: Das verst\u00e4ndige Kartenspiel. August Scherl Verlag, Berlin (1929)"},{"key":"2_CR15","unstructured":"Levy, D.N.L.: The million pound bridge program. In: Heuristic Programming in Artificial Intelligence (1989)"},{"key":"2_CR16","unstructured":"Long, J.R.: Search, inference and opponent modelling in an expert-caliber Skat player. Ph.D. thesis, University of Alberta (2011)"},{"key":"2_CR17","unstructured":"M\u00fcller, M.: Computer go as a sum of local games an application of combinatorial game theory. Ph.D. thesis, ETH Z\u00fcrich (1995)"},{"key":"2_CR18","unstructured":"M\u00fcller, M.: Decomposition search: a combinatorial games approach to game tree search, with applications to solving Go endgames. In International Joint Conference on Artificial Intelligence (IJCAI), pp. 578\u2013583 (1999)"},{"key":"2_CR19","unstructured":"Rebstock, D.: Improving AI in Skat through Human Imitation and Policy Based Inference. Master\u2019s thesis (2019)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Rebstock, D., Solinas, C., Buro, M.: Learning policies from human data for Skat. CoRR, abs\/1905.10907 (2019)","DOI":"10.1109\/CIG.2019.8848125"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Rebstock, D., Solinas, C., Buro, M., Sturtevant, N.R.: Policy based inference in trick-taking card games. CoRR, abs\/1905.10911 (2019)","DOI":"10.1109\/CIG.2019.8848029"},{"issue":"7","key":"2_CR22","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A Reinefeld","year":"1994","unstructured":"Reinefeld, A., Marsland, T.A.: Enhanced iterative-deepening search. IEEE Trans. Pattern Anal. Mach. Intell. 16(7), 701\u2013710 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR23","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 649\u2013654 (2011)"},{"key":"2_CR24","unstructured":"Schettler, F., Kirschbach, G.: Das gro\u00dfe Skatvergn\u00fcgen. Urania Verlag, Leipzig, Jena, Berlin (1988)"},{"key":"2_CR25","volume-title":"Das Skatspiel im Lichte der Wahrscheinlichkeitsrechnung","author":"H Schubert","year":"1887","unstructured":"Schubert, H.: Das Skatspiel im Lichte der Wahrscheinlichkeitsrechnung. J. F. Richter, Hamburg (1887)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Silver, D.A.H., et al.: Mastering the game of Go with deep neural networks and tree search. Nature, 529, 484 (2016)","DOI":"10.1038\/nature16961"},{"key":"2_CR27","unstructured":"Silver, D., et al.: Mastering Chess and Shogi by self-play with a general reinforcement learning algorithm. Technical Report 1712.018, arxiv (2017)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Solinas, C.: Improving Determinized Search with Supervised Learning in Trick-Taking Card Games. Master\u2019s thesis (2019)","DOI":"10.1609\/aaai.v33i01.33011158"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Sturtevant, N.R., White, A.M.: Feature construction for reinforcement learning in hearts. In: Computers and Games, pp. 122\u2013134 (2006)","DOI":"10.1007\/978-3-540-75538-8_11"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume":"5131","author":"MH Winands","year":"2008","unstructured":"Winands, M.H., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte-carlo tree search solver. Comput. Games 5131, 25\u201336 (2008)","journal-title":"Comput. Games"},{"key":"2_CR31","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems, pp. 1729\u20131736 (2008)"}],"container-title":["Lecture Notes in Computer Science","KI 2020: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58285-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T17:12:53Z","timestamp":1668705173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58285-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030582845","9783030582852"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58285-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bamberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2020.uni-bamberg.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic KI 2020 was held as a virtual event.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}