{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:54:35Z","timestamp":1725936875223},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319716480"},{"type":"electronic","value":"9783319716497"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71649-7_7","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T18:46:24Z","timestamp":1513881984000},"page":"73-89","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep df-pn and Its Efficient Implementations"],"prefix":"10.1007","author":[{"given":"Song","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hiroyuki","family":"Iida","sequence":"additional","affiliation":[]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"issue":"1994","key":"7_CR1","doi-asserted-by":"crossref","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(1994), 91\u2013124 (1994)","journal-title":"Artif. Intell."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11922155_14","volume-title":"Advances in Computer Games","author":"I-C Wu","year":"2006","unstructured":"Wu, I.-C., Huang, D.-Y.: A new family of k-in-a-row games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T., Donkers, H.H.L.M.J. (eds.) ACG 2005. LNCS, vol. 4250, pp. 180\u2013194. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11922155_14"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/ICG-2012-35302","volume":"35","author":"A Kishimoto","year":"2012","unstructured":"Kishimoto, A., Winands, M.H.M., M\u00fcller, M., Saito, J.T.: Game-tree search using proof numbers: the first twenty years. ICGA J. 35, 131\u2013156 (2012)","journal-title":"ICGA J."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Kaneko, T.: Parallel depth first proof number search. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 95\u2013100. AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7551"},{"key":"7_CR5","unstructured":"Nagai, A.: Df-pn algorithm for searching AND\/OR trees and its applications. Ph.D. thesis, Department of Information Science, University of Tokyo (2002)"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"DA McAllester","year":"1988","unstructured":"McAllester, D.A.: Conspiracy numbers for min-max search. Artif. Intell. 35, 287\u2013310 (1988)","journal-title":"Artif. Intell."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-70829-2_6","volume-title":"Oppositional Concepts in Computational Intelligence","author":"HJ Herik van den","year":"2008","unstructured":"van den Herik, H.J., Winands, M.H.M.: Proof-number search and its variants. In: Tizhoosh, H.R., Ventresca, M. (eds.) Oppositional Concepts in Computational Intelligence, pp. 91\u2013118. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70829-2_6"},{"key":"7_CR8","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+ $$\\epsilon $$ \u03f5 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). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_14"},{"key":"7_CR9","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":"7_CR10","unstructured":"Kishimoto, A., M\u00fcller, M.: Search versus knowledge for solving life and death problems in Go. In: Proceedings of the 20th AAAI Conference on Artificial Intelligence, pp. 1374\u20131379. AAAI (2005)"},{"key":"7_CR11","unstructured":"Kishimoto, A.: Correct and efficient search algorithms in the presence of repetitions. Ph.D. thesis, University of Alberta (2005)"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0004-3702(01)00152-7","volume":"134","author":"HJ Herik van den","year":"2002","unstructured":"van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: now and in the future. Artif. Intell. 134, 277\u2013311 (2002)","journal-title":"Artif. Intell."},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TCIAIG.2010.2060262","volume":"2","author":"IC Wu","year":"2010","unstructured":"Wu, I.C., Lin, P.H.: Relevance-zone-oriented proof search for Connect6. IEEE Trans. Comput. Intell. AI Games 2, 191\u2013207 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-27992-3_17","volume-title":"Advances in Computer Games","author":"T Ishitobi","year":"2015","unstructured":"Ishitobi, T., Plaat, A., Iida, H., van den Herik, J.: Reducing the seesaw effect with deep proof-number search. In: Plaat, A., van den Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 185\u2013197. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27992-3_17"}],"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-71649-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T04:07:06Z","timestamp":1693368426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71649-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319716480","9783319716497"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71649-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}