{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:39:28Z","timestamp":1743068368942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031708923"},{"type":"electronic","value":"9783031708930"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70893-0_6","type":"book-chapter","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T11:02:54Z","timestamp":1724929374000},"page":"73-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for\u00a0General Trick-Taking Card Games"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"key":"6_CR1","unstructured":"Allis, L.V.: A knowledge-based approach to Connect-Four. The game is solved: White wins. Master\u2019s thesis, Vrije Univeriteit, The Netherlands (1998)"},{"key":"6_CR2","unstructured":"Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Opponent modeling in Poker. In: Mostow, J., Rich, C. (eds.). In: AAAI, pp. 493\u2013499 (1998)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-031-34017-8_8","volume-title":"Computers and Games","author":"XAP Blanvillain","year":"2022","unstructured":"Blanvillain, X.A.P.: Oware is strongly solved. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds.) CG 2022. LNCS, vol. 13865, pp. 87\u201396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-34017-8_8"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Bounan, S., Edelkamp, S.: Trick costs for $$\\alpha \\mu $$ and new relatives. In: Barneva, R.P., Brimkov, V.E., Gentile, C., Pacchiano, A. (eds.) Artificial Intelligence and Image Analysis. IWCIA ISAIM 2024. LNCS, vol. 14494, pp. 50\u201367. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63735-3_3","DOI":"10.1007\/978-3-031-63735-3_3"},{"issue":"11","key":"6_CR5","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":"6_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-89453-5_1","volume-title":"Monte Carlo Search","author":"T Cazenave","year":"2021","unstructured":"Cazenave, T., Ventos, V.: The $$\\alpha \\mu $$ search algorithm for the game of bridge. In: Cazenave, T., Teytaud, O., Winands, M.H.M. (eds.) MCS 2020. CCIS, vol. 1379, pp. 1\u201316. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89453-5_1"},{"key":"6_CR7","unstructured":"Cohensius, G., Meir, R., Oved, N., Stern, R.: Bidding in Spades. In: ECAI, pp. 387\u2013394 (2020)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Challenging human supremacy in Skat. In: SOCS, pp. 52\u201360 (2019)","DOI":"10.1609\/socs.v10i1.18502"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-58285-2_2","volume-title":"KI 2020: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2020","unstructured":"Edelkamp, S.: Dynamic play via suit factorization search in Skat. In: Schmid, U., Kl\u00fcgl, F., Wolter, D. (eds.) KI 2020. LNCS (LNAI), vol. 12325, pp. 18\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58285-2_2"},{"key":"6_CR10","unstructured":"Edelkamp, S.: Representing and reducing uncertainty for enumerating the belief space to improve endgame play in Skat. In: ECAI, pp. 395\u2013402 (2020)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Knowledge-based paranoia search. In: Conference on Games, pp. 1\u20138 (2021)","DOI":"10.1109\/CoG52621.2021.9619073"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-031-34017-8_12","volume-title":"Computers and Games","author":"S Edelkamp","year":"2022","unstructured":"Edelkamp, S.: Improving computer play in Skat with hope cards. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds.) CG 2022. LNCS, vol. 13865, pp. 133\u2013145. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-34017-8_12"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Ferrucci, D.: Building Watson: an overview of the DeepQA project. AI Mag. 31, 59\u201379 (2010)","DOI":"10.1609\/aimag.v31i3.2303"},{"key":"6_CR14","unstructured":"Finnsson, H.: Cadia-player: a general game playing agent. PhD thesis (2007)"},{"issue":"1\u20132","key":"6_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0004-3702(97)00082-9","volume":"100","author":"I Frank","year":"1998","unstructured":"Frank, I., Basin, D.: Search in games with incomplete information: a case study using bridge card play. Artif. Intell. 100(1\u20132), 87\u2013123 (1998)","journal-title":"Artif. Intell."},{"key":"6_CR16","unstructured":"Gasser, R.: Harnessing computational resources for efficient exhaustive search. PhD thesis, ETH Z\u00fcrich (1995)"},{"key":"6_CR17","unstructured":"Ginsberg, M.: Step toward an expert-level bridge-playing program. In: IJCAI, pp. 584\u2013589 (1999)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Keller, T., Kupferschmid, S.: Automatic bidding for the game of Skat. In: KI, pp. 95\u2013102 (2008)","DOI":"10.1007\/978-3-540-85845-4_12"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kubicek, O., Burch, N., Lisy, V.: Look-ahead search on top of policy networks in imperfect information games (2024). arXiv\/2312.15220","DOI":"10.24963\/ijcai.2024\/480"},{"key":"6_CR20","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":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-75538-8_12","volume-title":"Computers and Games","author":"S Kupferschmid","year":"2007","unstructured":"Kupferschmid, S., Helmert, M.: A Skat player based on Monte-Carlo simulation. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 135\u2013147. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_12"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Nowakowski, R.J., Landman, B.M., Luca, F., Nathanson, M.B.,Ne\u0161et\u0159il, J., Robertson, A., (eds.): In: Combinatorial Game Theory. De Gruyter: Berlin (2022)","DOI":"10.1515\/9783110755411"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Perolat, J., et al.: Mastering the game of Stratego with model-free multiagent reinforcement learning. Science 378(6623), 990\u2013996 (2022)","DOI":"10.1126\/science.add4679"},{"key":"6_CR24","unstructured":"Schaeffer, J., et al.: Solving checkers. In: IJCAI, pp. 292\u2013297 (2005)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Silver, D., et\u00a0al.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016)","DOI":"10.1038\/nature16961"},{"key":"6_CR26","unstructured":"Silver, D., et al.: Mastering Chess and Shogi by self-play with a general reinforcement learning algorithm. Technical Report 1712.018. arxiv (2017)"}],"container-title":["Lecture Notes in Computer Science","KI 2024: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70893-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T11:04:16Z","timestamp":1724929456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70893-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031708923","9783031708930"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70893-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"30 August 2024","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":"W\u00fcrzburg","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.uni-wuerzburg.de\/ki24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}