{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:40:16Z","timestamp":1742953216223,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637346"},{"type":"electronic","value":"9783031637353"}],"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-63735-3_3","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"50-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trick Costs for\u00a0$$\\alpha \\mu $$ and\u00a0New Relatives"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Bounan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"3_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":"3_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-031-34017-8_8","volume-title":"Computers and Games","author":"X Blanvillain","year":"2022","unstructured":"Blanvillain, X.: Oware is strongly solved. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds.) Computers and Games. LNCS, vol. 13865, pp. 87\u201396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-34017-8_8"},{"issue":"11","key":"3_CR3","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"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1177\/0272989X07302555","volume":"27","author":"A Brennan","year":"2007","unstructured":"Brennan, A., Kharroubi, S., O\u2019Hagan, A., Chilcott, J.: Calculating partial expected value of perfect information via Monte Carlo sampling algorithms. Med. Decis. Making 27(4), 448\u2013470 (2007)","journal-title":"Med. Decis. Making"},{"key":"3_CR5","unstructured":"Buro, M., Long, J.R., Furtak, T., Sturtevant, N.R.: Improving state evaluation, inference, and search in trick-based card games. In: IJCAI, pp. 1407\u20131413 (2009)"},{"key":"3_CR6","unstructured":"Cazenave, T., Ventos, V.: The $$\\alpha \\mu $$ Search Algorithm for the Game of Bridge (2019)"},{"key":"3_CR7","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":"3_CR8","unstructured":"Cohensius, G., Meir, R., Oved, N., Stern, R.: Bidding in spades. In: ECAI, pp. 387\u2013394 (2020)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Challenging human supremacy in skat. In: Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS), pp. 52\u201360 (2019)","DOI":"10.1609\/socs.v10i1.18502"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Knowledge-Based Paranoia Search in Trick-Taking. CoRR, abs\/2104.05423 (2021)","DOI":"10.1109\/CoG52621.2021.9619073"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Improving computer play in Skat with hope cards (2023)","DOI":"10.1007\/978-3-031-34017-8_12"},{"key":"3_CR12","unstructured":"Finnsson, H.: Cadia-player: a general game playing agent. Ph.D. thesis (2007)"},{"issue":"1\u20132","key":"3_CR13","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":"3_CR14","unstructured":"Gasser, R.: Harnessing computational resources for efficient exhaustive search. Ph.D. thesis, ETH Z\u00fcrich (1995)"},{"key":"3_CR15","unstructured":"Ginsberg, M.: Step toward an expert-level bridge-playing program. In: IJCAI, pp. 584\u2013589 (1999)"},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"key":"3_CR17","unstructured":"Kupferschmid, S.: Entwicklung eines Double-Dummy Skat Solvers mit einer Anwendung f\u00fcr verdeckte Skatspiele. Master\u2019s thesis, University of Freiburg (2006)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Li, J., Zanuttini, B., Cazenave, T., Ventos, V.: Generalisation of alpha-beta search for AND-OR graphs with partially ordered values. Research Report, GREYC CNRS UMR 6072, Universite de Caen (2022)","DOI":"10.24963\/ijcai.2022\/661"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Long, J.R., Sturtevant, N.R., Buro, M., Furtak, T.: Understanding the success of perfect information Monte Carlo sampling in game tree search. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"3_CR20","unstructured":"Morav\u010d\u00edk, M., et al.: DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. CoRR, abs\/1701.01724 (2017)"},{"issue":"6623","key":"3_CR21","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1126\/science.add4679","volume":"378","author":"J Perolat","year":"2022","unstructured":"Perolat, J., et al.: Mastering the game of stratego with model free multiagent reinforcement learning. Science 378(6623), 990\u2013996 (2022)","journal-title":"Science"},{"issue":"10","key":"3_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MC.2003.1236468","volume":"36","author":"JW Romein","year":"2003","unstructured":"Romein, J.W., Bal, H.E.: Solving awari with parallel retrograde analysis. Computer 36(10), 26\u201333 (2003)","journal-title":"Computer"},{"key":"3_CR23","unstructured":"Schaeffer, J., et al.: Solving checkers. In: IJCAI, pp. 292\u2013297 (2005)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Schiffel S., Thielscher, M.: Reasoning about general games described in GDL-II. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 846\u2013851. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7944"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016)","journal-title":"Nature"},{"key":"3_CR26","unstructured":"Silver, D. et al.: Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. Tech Report, arxiv, 1712018 (2017)"},{"key":"3_CR27","first-page":"201","volume":"49","author":"NR Sturtevant","year":"2000","unstructured":"Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games. AAAI\/IAAI 49, 201\u2013207 (2000)","journal-title":"AAAI\/IAAI"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-75538-8_11","volume-title":"Computers and Games","author":"NR Sturtevant","year":"2007","unstructured":"Sturtevant, N.R., White, A.M.: Feature construction for reinforcement learning in hearts. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 122\u2013134. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_11"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:03:14Z","timestamp":1721682194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_3","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":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}