{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:07:32Z","timestamp":1742800052574},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_8","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T08:43:37Z","timestamp":1272962617000},"page":"75-87","source":"Crossref","is-referenced-by-count":21,"title":["Randomized Parallel Proof-Number Search"],"prefix":"10.1007","author":[{"given":"Jahn-Takeshi","family":"Saito","sequence":"first","affiliation":[]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_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":"8_CR2","unstructured":"Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Rijksuniversiteit Limburg, Maastricht, The Netherlands (1994)"},{"key":"8_CR3","unstructured":"Nagai, A.: A new depth-first search algorithm for AND\/OR trees. In: Matsubara, H., Kotani, Y., Takizawa, T., Yoshikawa, A. (eds.) Proceedings of the Complex Games Lab Workhshop, ETL, Tsuruoka, Japan, pp. 40\u201345 (1998)"},{"key":"8_CR4","unstructured":"Nagai, A.: Df-pn algorithm for searching AND\/OR trees and its applications. PhD thesis, University of Tokyo, Japan (2002)"},{"issue":"1-2","key":"8_CR5","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 \n                  \n                    \n                  \n                  $\\mbox{PN}^{\\ast}$\n                -Search algorithm: application to tsume shogi. Artificial Intelligence\u00a0129(1-2), 253\u2013277 (2001)","journal-title":"Artificial Intelligence"},{"key":"8_CR6","first-page":"125","volume-title":"Proceedings of the 10th Advances in Computer Games Conference (ACG 2003)","author":"A. Kishimoto","year":"2003","unstructured":"Kishimoto, A., M\u00fcller, M.: DF-PN in Go: Application to the one-eye problem. In: van den Herik, H.J., Iida, H., Heinz, E. (eds.) Proceedings of the 10th Advances in Computer Games Conference (ACG 2003), Norwell, MA, USA, vol.\u00a010, pp. 125\u2013141. Kluwer Academic, Dordrecht (2003)"},{"issue":"5844","key":"8_CR7","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":"8_CR8","series-title":"Lecture Notes in Computer Science","first-page":"170","volume-title":"Computers and Games","author":"M.H.M. Winands","year":"2003","unstructured":"Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: PDS-PN: A new proof-number search algorithm: application to Lines of Action. In: Schaeffer, J., M\u00fcller, M., Bj\u00f6rnsson, Y. (eds.) CG 2002. LNCS, vol.\u00a02883, pp. 170\u2013185. Springer, Heidelberg (2003)"},{"issue":"3","key":"8_CR9","first-page":"162","volume":"19","author":"M. Brockington","year":"1996","unstructured":"Brockington, M.: A taxonomy of parallel game-tree search algorithms. ICCA Journal\u00a019(3), 162\u2013174 (1996)","journal-title":"ICCA Journal"},{"key":"8_CR10","unstructured":"Kishimoto, A., Kotani, Y.: Parallel AND\/OR tree search based on proof and disproof numbers. In: Proceedings of the 5th Game Programming Workshop, Hakone, Japan. IPSJ Symposium Series, vol.\u00a099(14), pp. 24\u201330 (1999)"},{"key":"8_CR11","unstructured":"Breuker, D.: Memory versus search. PhD thesis, Maastricht University, The Netherlands (1998)"},{"key":"8_CR12","unstructured":"Brockington, M., Schaeffer, J.: APHID Game-Tree Search. In: van den Herik, H., Uiterwijk, J. (eds.) Advances in Computer Chess, Univeriseit Maastricht, vol.\u00a08, pp. 69\u201392 (1997)"},{"issue":"3","key":"8_CR13","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. Artificial Intelligence\u00a035(3), 287\u2013310 (1988)","journal-title":"Artificial Intelligence"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45706-2_57","volume-title":"Euro-Par 2002. Parallel Processing","author":"U. Lorenz","year":"2002","unstructured":"Lorenz, U.: Parallel controlled conspiracy number search. In: Monien, M., Feldmann, R. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 420\u2013430. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(02)00195-9","volume":"137","author":"Y. Shoham","year":"2002","unstructured":"Shoham, Y., Toledo, S.: Parallel randomized best-first minimax search. Artificial Intelligence\u00a0137(1-2), 165\u2013196 (2002)","journal-title":"Artificial Intelligence"},{"key":"8_CR16","first-page":"98","volume":"22","author":"M. Buro","year":"1999","unstructured":"Buro, M.: Toward opening book learning. ICCA Journal\u00a022, 98\u2013102 (1999)","journal-title":"ICCA Journal"},{"key":"8_CR17","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":"G. Chaslot","year":"2008","unstructured":"Chaslot, G., 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.\u00a05131, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"8_CR18","series-title":"MICC Technical Report Series","first-page":"93","volume-title":"Computer Games Workshop (CGW 2007)","author":"T. Cazenave","year":"2007","unstructured":"Cazenave, T., Jouandeau, N.: On the Parallelization of UCT. In: van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M. (eds.) Computer Games Workshop (CGW 2007). MICC Technical Report Series, vol.\u00a007-06, pp. 93\u2013101. Maastricht University, Maastricht (2007)"},{"key":"8_CR19","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, L.: Improving depth-first pn-search: 1+\u03b5 trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 160\u2013170. Springer, Heidelberg (2007)"},{"key":"8_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-70829-2_6","volume-title":"Oppositional Concepts in Computational Intelligence","author":"H.J. Herik van den","year":"2008","unstructured":"van den Herik, H.J., Winands, M.H.M.: Proof-Number search and its variants. In: Tizhoosh, H., Ventresca, M. (eds.) Oppositional Concepts in Computational Intelligence. Studies in Computational Intelligence, vol.\u00a0155, pp. 91\u2013118. 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-642-12993-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T21:19:01Z","timestamp":1552511941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}