{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:23:47Z","timestamp":1743053027297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091648"},{"type":"electronic","value":"9783319091655"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09165-5_12","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"138-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Scalable Parallel DFPN Search"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Pawlewicz","sequence":"first","affiliation":[]},{"given":"Ryan B.","family":"Hayward","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"12_CR1","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 317, 1518\u20131522 (2007)","journal-title":"Science"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Kaneko, T.: Parallel depth first proof number search. In: Proceedings of the AAAI-10, pp. 95\u2013100 (2010)","DOI":"10.1609\/aaai.v24i1.7551"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Kishimoto, A.: Dealing with infinite loops, underestimation, and overestimation of depth-first proof-number search. In: Proceedings of the AAAI-10, pp. 108\u2013113 (2010)","DOI":"10.1609\/aaai.v24i1.7534"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ins.2004.04.012","volume":"175","author":"A Kishimoto","year":"2005","unstructured":"Kishimoto, A., M\u00fcller, M.: A solution to the ghi problem for depth-first proof-number search. Inf. Sci. 175, 296\u2013314 (2005)","journal-title":"Inf. Sci."},{"key":"12_CR5","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)"},{"key":"12_CR6","unstructured":"Yoshizoe, K., Kishimoto, A., M\u00fcller, M.: Lambda depth-first proof number search and its appplication to go. In: Proceedings of the IJCAI-07, pp. 2404\u20132409 (2007)"},{"key":"12_CR7","unstructured":"Henderson, P., Arneson, B., Hayward, R.: Solving 8\u00a0$$\\times $$\u00a08 Hex. In: Proceedings of the IJCAI-09, pp. 505\u2013510 (2009)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17928-0_1","volume-title":"Computers and Games","author":"B Arneson","year":"2011","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Solving hex: beyond humans. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 1\u201310. Springer, Heidelberg (2011)"},{"key":"12_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","author":"J Pawlewicz","year":"2007","unstructured":"Pawlewicz, J., Lew, \u0141.: Improving depth-first PN-search: $$1 + \\epsilon $$ 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)"},{"key":"12_CR10","unstructured":"Nagai, A.: A new AND\/OR tree search algorithm using proof number and disproof number. In: Proceeding of Complex Games Lab Workshop, Tsukuba, ETL, pp. 40\u201345 (1998)"},{"key":"12_CR11","unstructured":"Kishimoto, A.: Parallel AND\/OR tree search based on proof and disproof numbers. In: 5th Games Programming Workshop. IPSJ Symposium Series, vol. 99, pp. 24\u201330 (1999)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-31866-5_17","volume-title":"Advances in Computer Games","author":"A Saffidine","year":"2012","unstructured":"Saffidine, A., Jouandeau, N., Cazenave, T.: Solving breakthrough with race patterns and job-level proof number search. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 196\u2013207. Springer, Heidelberg (2012)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-12993-3_8","volume-title":"Advances in Computer Games","author":"J-T Saito","year":"2010","unstructured":"Saito, J.-T., Winands, M.H.M., van den Herik, H.J.: Randomized parallel proof-number search. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 75\u201387. Springer, Heidelberg (2010)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-17928-0_2","volume-title":"Computers and Games","author":"I-C Wu","year":"2011","unstructured":"Wu, I.-C., Lin, H.-H., Lin, P.-H., Sun, D.-J., Chan, Y.-C., Chen, B.-T.: Job-level proof-number search for connect6. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 11\u201322. Springer, Heidelberg (2011)"},{"key":"12_CR15","unstructured":"Nagai, A.: Df-pn Algorithm for Searching AND\/OR Trees and its Applications. Ph.D. thesis, University of Tokyo, Japan (2002)"},{"key":"12_CR16","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., M\u00fcller, M., Saito, J.T.: Game-tree search using proof numbers: the first twenty years. ICGA 35, 131\u2013156 (2012)","journal-title":"ICGA"},{"key":"12_CR17","unstructured":"Letouzey, F.: Fruit (2004\u20132013). http:\/\/www.fruitchess.com\/"},{"key":"12_CR18","unstructured":"Romstad, T.: Stockfish (2008\u20132013). http:\/\/stockfishchess.org\/"},{"key":"12_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/ICG-1996-19304","volume":"19","author":"D Breuker","year":"1996","unstructured":"Breuker, D., Uiterwijk, J., den Herik, H.: Replacement schemes and two-level tables. ICGA 19, 175\u2013180 (1996)","journal-title":"ICGA"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Nagai, A.: A new depth-first-search algorithm for and\/or tree. Master\u2019s thesis, University of Tokyo, Japan (1999)","DOI":"10.3233\/ICG-1999-22106"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","volume-title":"Computers and Games","author":"GMJ-B Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"12_CR22","unstructured":"Arneson, B., Henderson, P., Hayward, R.B.: Benzene (2009\u20132012). http:\/\/benzene.sourceforge.net\/"},{"key":"12_CR23","unstructured":"Enzenberger, M., M\u00fcller, M., Arneson, B., Segal, R., Xie, F., Huang, A.: Fuego (2007\u20132012). http:\/\/fuego.sourceforge.net\/"},{"key":"12_CR24","unstructured":"Henderson, P.: Playing and solving Hex. Ph.D. thesis, University of Alberta (2010). http:\/\/webdocs.cs.ualberta.ca\/~hayward\/theses\/ph.pdf"},{"key":"12_CR25","unstructured":"Hayward, R.B.: 2011 ICGA Computer Games Olympiad Hex Competition Report (2011). http:\/\/webdocs.cs.ualberta.ca\/~hayward\/papers\/rptTilburg.pdf"}],"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-319-09165-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T01:50:04Z","timestamp":1675821004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}