{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:59:58Z","timestamp":1725555598224},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_13","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T12:43:37Z","timestamp":1272977017000},"page":"136-145","source":"Crossref","is-referenced-by-count":5,"title":["Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ciancarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian Piero","family":"Favini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Zermelo, E.: Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In: Proceedings of the Fifth International Congress of Mathematicians, Cambridge, UK, vol.\u00a02, pp. 501\u2013504 (1913)"},{"issue":"3","key":"13_CR2","first-page":"129","volume":"14","author":"L. Stiller","year":"1991","unstructured":"Stiller, L.: Some Results from a Massively Parallel Retrograde Analysis. ICCA Journal\u00a014(3), 129\u2013134 (1991)","journal-title":"ICCA Journal"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1073\/pnas.53.2.244","volume":"53","author":"R. Bellman","year":"1965","unstructured":"Bellman, R.: On the application of dynamic programing to the determination of optimal play in chess and checkers. Proceedings of the National Academy of Sciences\u00a053(2), 244\u2013247 (1965)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"13_CR4","unstructured":"Ciancarini, P., DallaLibera, F., Maran, F.: Decision making under uncertainty: a rational approach to Kriegspiel. In: van den Herik, J., Uiterwijk, J. (eds.) Advances in Computer Chess, vol.\u00a08, pp. 277\u2013298. Univ. of Rulimburg (1997)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0304-3975(92)90344-F","volume":"96","author":"T. Ferguson","year":"1992","unstructured":"Ferguson, T.: Mate with bishop and knight in Kriegspiel. Theoretical Computer Science\u00a096, 389\u2013403 (1992)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","unstructured":"Ferguson, T.: Mate with two bishops in Kriegspiel. Technical report, UCLA (1995)"},{"key":"13_CR7","unstructured":"Magari, R.: Scacchi e probabilit\u00e0. In: Atti del Convegno: Matematica e scacchi. L\u2019uso del Gioco degli Scacchi nella didattica della Matematica, Forl\u00ec, Italy, pp. 59\u201366 (1992)"},{"key":"13_CR8","unstructured":"Sakuta, M.: Deterministic Solving of Problems with Uncertainty. PhD thesis, Shizuoka University, Japan (2001)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Boyce, J.: A Kriegspiel endgame. In: Klarner, D. (ed.) The Mathematical Gardner, pp. 28\u201336. Prindle, Weber & Smith (1981)","DOI":"10.1007\/978-1-4684-6686-7_4"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11674399_17","volume-title":"Computers and Games","author":"A. Bolognesi","year":"2006","unstructured":"Bolognesi, A., Ciancarini, P.: Searching over metapositions in Kriegspiel. In: van den Herik, H.J., Bj\u00f6rnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol.\u00a03846, pp. 246\u2013261. Springer, Heidelberg (2006)"},{"key":"13_CR11","unstructured":"Russell, S., Wolfe, J.: Efficient belief-state AND-OR search, with application to Kriegspiel. In: Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Edinburgh, Scotland, pp. 278\u2013285 (2005)"},{"key":"13_CR12","unstructured":"Nance, M., Vogel, A., Amir, E.: Reasoning about partially observed actions. In: Proceedings of 21st National Conference on Artificial Intelligence (AAAI 2006), Boston, USA, pp. 888\u2013893 (2006)"},{"key":"13_CR13","unstructured":"Ciancarini, P., Favini, G.: Representing Kriegspiel states with metapositions. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, pp. 2450\u20132455 (2007)"},{"key":"13_CR14","unstructured":"Parker, A., Nau, D., Subrahmanian, V.: Game-tree search with combinatorially large belief states. In: Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Edinburgh, Scotland, pp. 254\u2013259 (2005)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(00)00083-9","volume":"252","author":"I. Frank","year":"2001","unstructured":"Frank, I., Basin, D.: A theoretical and empirical investigation of search in imperfect information games. Theoretical Computer Science\u00a0252, 217\u2013256 (2001)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12993-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T01:10:25Z","timestamp":1552525825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}