{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T06:05:49Z","timestamp":1749794749983},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540324881"},{"type":"electronic","value":"9783540324898"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11674399_17","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T04:41:59Z","timestamp":1137991319000},"page":"246-261","source":"Crossref","is-referenced-by-count":4,"title":["Searching over Metapositions in Kriegspiel"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Bolognesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ciancarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"325","volume-title":"Advances in Computer Games","author":"A. Bolognesi","year":"2003","unstructured":"Bolognesi, A., Ciancarini, P.: Computer Programming of Kriegspiel Endings: the case of KR vs K. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games, vol.\u00a010, pp. 325\u2013342. Kluwer, Dordrecht (2003)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Boyce, J.: A Kriegspiel Endgame. In: Klarner, D. (ed.) The Mathematical Gardner, Prindle, pp. 28\u201336. Weber & Smith (1981)","DOI":"10.1007\/978-1-4684-6686-7_4"},{"key":"17_CR3","first-page":"157","volume-title":"Proc. Artificial Intelligence and Statistics 2001 (AISTATS 2001)","author":"A. Bud","year":"2001","unstructured":"Bud, A., Albrecht, D., Nicholson, A., Zukerman, I.: Information-theoretic Advisors in Invisible Chess. In: Proc. Artificial Intelligence and Statistics 2001 (AISTATS 2001), Florida, USA, pp. 157\u2013162. Morgan Kaufman Publishers, San Francisco (2001)"},{"key":"17_CR4","first-page":"277","volume-title":"Advances in Computer Chess","author":"P. Ciancarini","year":"1997","unstructured":"Ciancarini, P., Dalla Libera, F., Maran, F.: Decision Making under Uncertainty: A Rational Approach to Kriegspiel. In: van den Herik, H.J., Uiterwijk, J.W.H.M. (eds.) Advances in Computer Chess, vol.\u00a08, pp. 277\u2013298. University of Limburg, Maastricht (1997)"},{"key":"17_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":"17_CR6","unstructured":"Ferguson, T.: Mate with two Bishops in Kriegspiel. Technical report, UCLA (1995)"},{"issue":"4","key":"17_CR7","first-page":"218","volume":"23","author":"M. Sakuta","year":"2000","unstructured":"Sakuta, M., Iida, H.: Solving Kriegspiel-like Problems: Exploiting a Transposition Table. ICCA Journal\u00a023(4), 218\u2013229 (2000)","journal-title":"ICCA Journal"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11674399_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T13:30:41Z","timestamp":1552483841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11674399_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540324881","9783540324898"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11674399_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}