{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:07:46Z","timestamp":1743127666732,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279916"},{"type":"electronic","value":"9783319279923"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27992-3_17","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"185-197","source":"Crossref","is-referenced-by-count":2,"title":["Reducing the Seesaw Effect with Deep Proof-Number Search"],"prefix":"10.1007","author":[{"given":"Taichi","family":"Ishitobi","sequence":"first","affiliation":[]},{"given":"Aske","family":"Plaat","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Iida","sequence":"additional","affiliation":[]},{"given":"Jaap","family":"van den Herik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-87608-3_14","volume-title":"Computers and Games","author":"A Kishimoto","year":"2008","unstructured":"Kishimoto, A., M\u00fcller, M.: About the completeness of depth-first proof-number search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 146\u2013156. Springer, Heidelberg (2008)"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/ICG-2012-35302","volume":"35","author":"A Kishimoto","year":"2012","unstructured":"Kishimoto, A., Winands, M., M\u00fcller, M., Saito, J.-T.: Game-tree search using proof numbers: the first twenty years. ICGA J. 35(3), 131\u2013156 (2012)","journal-title":"ICGA J."},{"key":"17_CR3","unstructured":"Kishimoto, A., Muller, M.: Search versus knowledge for solving life and death problems in go. In: Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374\u20131379 (2005)"},{"key":"17_CR4","unstructured":"Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions, Ph.D. thesis, University of Alberta (2005)"},{"key":"17_CR5","unstructured":"Nagai, A.: Df-pn Algorithm for Searching AND\/OR Trees and Its Applications. Ph.D. thesis, Dept. of Information Science, University of Tokyo, Tokyo (2002)"},{"key":"17_CR6","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":"17_CR7","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":"17_CR8","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first and depth-first minimax search in practice. In: Proceedings of Computer Science in the Netherlands, pp. 182\u2013193 (1995)"},{"key":"17_CR9","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: SSS* = Alpha-beta + TT. Technical report 94\u201317, University of Alberta, Edmonton, Canada (1994)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D McAllester","year":"1988","unstructured":"McAllester, D.: Conspiracy numbers for min-max search. Artif. Intell. 35(1), 287\u2013310 (1988)","journal-title":"Artif. Intell."},{"key":"17_CR11","unstructured":"Hashimoto, J.: A Study on Game-Independent Heuristics in Game-Tree Search. Ph.D. thesis, School of Information Science, Japan Advanced Institute of Science and Technology (2011)"},{"key":"17_CR12","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","author":"J Pawlewicz","year":"2007","unstructured":"Pawlewicz, J., Lew, \u0141.: Improving depth-first PN-search: 1 + \n                    \n                      \n                    \n                    $$\\epsilon $$\n                   trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 160\u2013171. Springer, Heidelberg (2007)"},{"issue":"5844","key":"17_CR13","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 317(5844), 1518\u20131522 (2007)","journal-title":"Science"},{"issue":"4","key":"17_CR14","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 J. 30(4), 187\u2013197 (2007)","journal-title":"ICGA J."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.3233\/ICG-2013-36103","volume":"36","author":"K Hoki","year":"2013","unstructured":"Hoki, K., Kaneko, T., Kishimoto, A., Ito, T.: Parallel dovetailing and its application to depth-first proof-number search. ICGA J. 36(1), 22\u201336 (2013)","journal-title":"ICGA J."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"LV Allis","year":"1994","unstructured":"Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artif. Intell. 66(1), 91\u2013124 (1994)","journal-title":"Artif. Intell."},{"issue":"4","key":"17_CR17","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. Artif. Intell. 129(4), 253\u2013277 (2001)","journal-title":"Artif. Intell."},{"key":"17_CR18","unstructured":"Winands, M.H.M.: Informed Search in Complex Games., Ph.D. thesis, Maastricht University, The Netherlands (2004)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-87608-3_15","volume-title":"Computers and Games","author":"T Ueda","year":"2008","unstructured":"Ueda, T., Hashimoto, T., Hashimoto, J., Iida, H.: Weak proof-number search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 157\u2013168. Springer, Heidelberg (2008)"}],"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-319-27992-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:35:21Z","timestamp":1559349321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}