{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:44:50Z","timestamp":1743104690766,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_13","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"135-145","source":"Crossref","is-referenced-by-count":0,"title":["A New Proof-Number Calculation Technique for Proof-Number Search"],"prefix":"10.1007","author":[{"given":"Kazuki","family":"Yoshizoe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_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":"13_CR2","unstructured":"Cazenave, T.: Generalized widening. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI 2004), pp. 156\u2013160 (2004)"},{"key":"13_CR3","unstructured":"Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, University of Alberta (March 2005)"},{"key":"13_CR4","first-page":"1374","volume-title":"Proc. of 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: Proc. of Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374\u20131379. AAAI Press, Menlo Park (2005)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R.E. Korf","year":"1993","unstructured":"Korf, R.E.: Linear-space best-first search. Artificial Intelligence\u00a062(1), 41\u201378 (1993)","journal-title":"Artificial Intelligence"},{"key":"13_CR6","unstructured":"Nagai, A.: Df-pn Algorithm for Searching AND\/OR Trees and Its Applications. PhD thesis, University of Tokyo, Tokyo (2002)"},{"issue":"4","key":"13_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/ICG-2007-30402","volume":"30","author":"J. Schaeffer","year":"2007","unstructured":"Schaeffer, J.: Game over: Black to play and draw in checkers. ICGA Journal\u00a030(4), 187\u2013197 (2007)","journal-title":"ICGA Journal"},{"key":"13_CR8","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Solving checkers. In: Proc. of 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 292\u2013297 (2005)"},{"issue":"5844","key":"13_CR9","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"},{"key":"13_CR10","unstructured":"Thomsen, T.: Madlab website, \n                    http:\/\/www.t-t.dk\/madlab\/problems\/index.html"},{"issue":"4","key":"13_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.3233\/ICG-2000-23402","volume":"23","author":"T. Thomsen","year":"2000","unstructured":"Thomsen, T.: Lambda-search in game trees - with application to Go. ICGA Journal\u00a023(4), 203\u2013217 (2000)","journal-title":"ICGA Journal"},{"issue":"1","key":"13_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0020-0255(99)00096-1","volume":"122","author":"T. Wolf","year":"2000","unstructured":"Wolf, T.: Forward pruning and other heuristic search techniques in tsume go. Special issue of Information Sciences\u00a0122(1), 59\u201376 (2000)","journal-title":"Special issue of Information Sciences"},{"key":"13_CR13","unstructured":"Yoshizoe, K., Kishimoto, A., M\u00fcller, M.: Lambda depth-first proof number search and its application to go. In: Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2404\u20132409 (2007)"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:49:51Z","timestamp":1715312991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}