{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T19:06:49Z","timestamp":1747163209546,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876076"},{"type":"electronic","value":"9783540876083"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87608-3_14","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"146-156","source":"Crossref","is-referenced-by-count":5,"title":["About the Completeness of Depth-First Proof-Number Search"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Kishimoto","sequence":"first","affiliation":[]},{"given":"Martin","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"L.V. Allis","year":"1994","unstructured":"Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artificial Intelligence\u00a066(1), 91\u2013124 (1994)","journal-title":"Artificial Intelligence"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Campbell, M.: The graph-history interaction: On ignoring position history. In: 1985 Association for Computing Machinery Annual Conference, pp. 278\u2013280 (1985)","DOI":"10.1145\/320435.320516"},{"key":"14_CR3","unstructured":"Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, Department of Computing Science, University of Alberta (2005)"},{"key":"14_CR4","first-page":"644","volume-title":"19th National Conference on Artificial Intelligence (AAAI 2004)","author":"A. Kishimoto","year":"2004","unstructured":"Kishimoto, A., M\u00fcller, M.: A general solution to the graph history interaction problem. In: 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 644\u2013649. AAAI Press, Menlo Park (2004)"},{"key":"14_CR5","first-page":"1374","volume-title":"Twentieth National Conference on Artificial Intelligence (AAAI 2005)","author":"A. Kishimoto","year":"2005","unstructured":"Kishimoto, A., M\u00fcller, M.: Search versus knowledge for solving life and death problems in Go. In: Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374\u20131379. AAAI Press, Menlo Park (2005)"},{"key":"14_CR6","unstructured":"Nagai, A.: Df-pn Algorithm for Searching AND\/OR Trees and Its Applications. PhD thesis, Department of Information Science, University of Tokyo (2002)"},{"key":"14_CR7","unstructured":"Nagai, A.: Private communication (2005)"},{"key":"#cr-split#-14_CR8.1","unstructured":"Palay, A.J.: Searching with Probabilities. PhD thesis, Carnegie Mellon University (1983)"},{"key":"#cr-split#-14_CR8.2","unstructured":"Also published by Pitman (1985)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-75538-8_14","volume-title":"Computers and Games (CG 2006)","author":"J. Pawlewicz","year":"2007","unstructured":"Pawlewicz, J., Lew, L.: Improving depth-first PN-search: 1\u2009+\u2009\u03b5 trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 160\u2013171. Springer, Heidelberg (2007)"},{"issue":"5844","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J. Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science\u00a0317(5844), 1518\u20131522 (2007)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87608-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:50:08Z","timestamp":1715313008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}