{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:35:49Z","timestamp":1742960149770,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_15","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"157-168","source":"Crossref","is-referenced-by-count":2,"title":["Weak Proof-Number Search"],"prefix":"10.1007","author":[{"given":"Toru","family":"Ueda","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Hashimoto","sequence":"additional","affiliation":[]},{"given":"Junichi","family":"Hashimoto","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Iida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, Computer Science Department, Rijksuniversiteit Limburg (1994)"},{"issue":"1","key":"15_CR2","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":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-48957-6_3","volume-title":"Computers and Games","author":"D.M. Breuker","year":"1999","unstructured":"Breuker, D.M., van den Herik, H.J., Allis, L.V., Uiterwijk, J.W.H.M.: A Solution to the GHI Problem for Best-First Search. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 25\u201349. Springer, Heidelberg (1999)"},{"key":"15_CR4","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":"15_CR5","unstructured":"Gunnar, A.: ZEBRA, \n                    http:\/\/radagast.se\/othello\/"},{"issue":"3","key":"15_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.3233\/ICG-2007-30310","volume":"30","author":"J. Hashimoto","year":"2007","unstructured":"Hashimoto, J.: Tacos wins Shogi Tournament. ICGA Journal\u00a030(3), 164 (2007)","journal-title":"ICGA Journal"},{"key":"15_CR7","unstructured":"K. Kadowaki. Zoku-Tsumuya-Tsumazaruya, Shogi-Muso, Shogi-Zuko. Heibon-Sha, Toyo-Bunko, (1975) (in Japanese)"},{"key":"15_CR8","unstructured":"Kakinoki, Y.: A solution for the double-counting problem in shogi endgame. Technical report (2005) (in Japanese), \n                    http:\/\/homepage2.nifty.com\/kakinoki_y\/free\/DoubleCount.pdf"},{"key":"15_CR9","first-page":"125","volume-title":"Advances in Computer Games 10","author":"A. Kishimoto","year":"2003","unstructured":"Kishimoto, A., M\u00fcller, M.: Df-pn in Go: An Application to the One-Eye Problem. In: Advances in Computer Games 10, pp. 125\u2013141. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"1","key":"15_CR10","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"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D.A. McAllester","year":"1988","unstructured":"McAllester, D.A.: Conspiracy numbers for min-max search. Artificial Intelligence\u00a035(3), 287\u2013310 (1988)","journal-title":"Artificial Intelligence"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-540-40031-8_7","volume-title":"Computers and Games","author":"M. M\u00fcller","year":"2003","unstructured":"M\u00fcller, M.: Proof-Set Search. In: Schaeffer, J., M\u00fcller, M., Bj\u00f6rnsson, Y. (eds.) CG 2002. LNCS, vol.\u00a02883, pp. 88\u2013107. Springer, Heidelberg (2003)"},{"key":"15_CR13","first-page":"40","volume-title":"Proceedings of Complex Games Lab Workshop","author":"A. Nagai","year":"1998","unstructured":"Nagai, A.: A new AND\/OR tree search algorithm using proof number and disproof number. In: Proceedings of Complex Games Lab Workshop, pp. 40\u201345. ETL, Tsukuba (1998)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Nagai, A.: A new depth-first-search algorithm for AND\/OR trees. M.Sc. Thesis, Department of Information Science, The University of Tokyo, Japan (1999)","DOI":"10.3233\/ICG-1999-22106"},{"key":"15_CR15","unstructured":"Nagai, A.: Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND\/OR trees. In: Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation, pp. 163\u2013170 (1999)"},{"key":"15_CR16","unstructured":"Nagai, A., Imai, H.: Application of df-pn+ to Othello Endgames. In: Game Programming Workshop 1999, Hakone, Japan (1999)"},{"key":"15_CR17","unstructured":"Okabe, F.: About the Shogi problem solution figure using the number of course part branches. In: 10th Game Programming Workshop, Hakone, Japan (2005) (in Japanese)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3233\/ICG-2001-24405","volume":"24","author":"M. Sakuta","year":"2001","unstructured":"Sakuta, M., Iida, H.: AND\/OR-tree search algorithms in shogi mating search. ICGA Journal\u00a024(4), 231\u2013235 (2001)","journal-title":"ICGA Journal"},{"key":"#cr-split#-15_CR19.1","unstructured":"Schaeffer, J.: Conspiracy numbers. In: Beal, D.F. (ed.) Advances in Computer Chess, vol.\u00a05, pp. 199-218. Elsevier Science, Amsterdam (1989)"},{"key":"#cr-split#-15_CR19.2","doi-asserted-by":"crossref","unstructured":"Artificial Intelligence, 43(1):67-84 (1990)","DOI":"10.1016\/0004-3702(90)90071-7"},{"issue":"5844","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J. Schaeffer","year":"2007","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers Is Solved. Science\u00a0317(5844), 1518\u20131522 (2007)","journal-title":"Science"},{"issue":"4","key":"15_CR21","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"},{"issue":"4","key":"15_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0004-3702(01)00084-4","volume":"129","author":"M. Seo","year":"2001","unstructured":"Seo, M., Iida, H., Uiterwijk, J.W.H.M.: The PN*-search algorithm: Application to tsume-shogi. Artificial Intelligence\u00a0129(4), 253\u2013277 (2001)","journal-title":"Artificial Intelligence"},{"key":"15_CR23","unstructured":"Ueda, T., Hashimoto, T., Hashimoto, J.: Solving an Opening Book of Othello and Consideration of Problem. In: 12th Game Programming Workshop, Hakone, Japan (2007) (in Japanese)"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:50:20Z","timestamp":1715313020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}