{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:41:37Z","timestamp":1742960497304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"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_9","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"100-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Developments on Product Propagation"],"prefix":"10.1007","author":[{"given":"Abdallah","family":"Saffidine","sequence":"first","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"issue":"1","key":"9_CR1","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."},{"key":"9_CR2","unstructured":"Baum, E.B., Smith, W.D.: Best play for imperfect players and game tree search. Technical report, NEC Research Institute (1993)"},{"issue":"1\u20132","key":"9_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0004-3702(97)00059-3","volume":"97","author":"EB Baum","year":"1997","unstructured":"Baum, E.B., Smith, W.D.: A Bayesian approach to relevance in game playing. Artif. Intell. 97(1\u20132), 195\u2013242 (1997)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(99)00082-1","volume":"230","author":"DM Breuker","year":"2000","unstructured":"Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Solving 8$$\\times $$8 domineering. Theor. Comput. Sci. 230(1\u20132), 195\u2013206 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","unstructured":"Breuker, D.M.: Memory versus search in games. Ph.D. thesis, Universiteit Maastricht (1998)"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-17928-0_9","volume-title":"Computers and Games","author":"T Cazenave","year":"2011","unstructured":"Cazenave, T., Saffidine, A.: Score bounded Monte-Carlo tree search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 93\u2013104. Springer, Heidelberg (2011)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chou, C.-W., Teytaud, O., Yen, S.-J.: Revisiting Monte-Carlo tree search on a normal form game: NoGo. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part\u00a0I. LNCS, vol. 6624, pp. 73\u201382. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20525-5_8"},{"key":"9_CR9","unstructured":"Ewalds, T.: Playing and solving Havannah. Master\u2019s thesis, University of Alberta (2012)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11674399_3","volume-title":"Computers and Games","author":"T Hauk","year":"2006","unstructured":"Hauk, T., Buro, M., Schaeffer, J.: Rediscovering *-Minimax search. In: van den Herik, H.J., Bj\u00f6rnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 35\u201350. Springer, Heidelberg (2006)"},{"key":"9_CR11","unstructured":"Horacek, H.: Towards understanding conceptual differences between minimaxing and product-propagation. In: 14th European Conference on Artificial Intelligence (ECAI), pp. 604\u2013608 (2000)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Horacek, H., Kaindl, H.: An analysis of decision quality of minimaxing vs. product propagation. In: Proceedings of the 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC\u201909, Piscataway, NJ, USA, pp. 2568\u20132574. IEEE Press (2009)","DOI":"10.1109\/ICSMC.2009.5346327"},{"issue":"4","key":"9_CR13","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(4), 296\u2013314 (2005)","journal-title":"Inf. Sci."},{"issue":"3","key":"9_CR14","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(3), 131\u2013156 (2012)","journal-title":"ICGA J."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"9_CR16","volume-title":"Who Wins Domineering on Rectangular Boards","author":"M Lachmann","year":"2002","unstructured":"Lachmann, M., Moore, C., Rapaport, I.: Who Wins Domineering on Rectangular Boards, vol. 42. Cambridge University Press, Cambridge (2002)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","volume-title":"Computers and Games","author":"RJ Lorentz","year":"2008","unstructured":"Lorentz, R.J.: Amazons discover Monte-Carlo. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 13\u201324. Springer, Heidelberg (2008)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 2883, pp. 88\u2013107. Springer, Heidelberg (2003)"},{"key":"9_CR19","unstructured":"Nijssen, J.A.M., Winands, M.H.M.: An overview of search techniques in multi-player games. In: Computer Games Workshop at ECAI 2012, pp. 50\u201361 (2012)"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0004-3702(83)90004-8","volume":"20","author":"J Pearl","year":"1983","unstructured":"Pearl, J.: On the nature of pathology in game searching. Artif. Intell. 20(4), 427\u2013453 (1983)","journal-title":"Artif. Intell."},{"key":"9_CR21","volume-title":"Artificial Intelligence - A Modern Approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach, 3rd edn. Pearson Education, Upper Saddle River (2010)","edition":"3"},{"key":"9_CR22","unstructured":"Saffidine, A., Cazenave, T.: Multiple-outcome proof number search. In: De Raedt, L., Bessiere, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P. (eds.) 20th European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, Montpellier, France, vol. 242, pp. 708\u2013713. IOS Press, August 2012"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.knosys.2011.11.014","volume":"34","author":"A Saffidine","year":"2011","unstructured":"Saffidine, A., Cazenave, T., M\u00e9hat, J.: UCD: Upper Confidence bound for rooted Directed acyclic graphs. Knowl. Based Syst. 34, 26\u201333 (2011)","journal-title":"Knowl. Based Syst."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Saffidine, A., Finnsson, H., Buro, M.: Alpha-beta pruning for games with simultaneous moves. In: Hoffmann,J., Selman, B. (eds.) 26th AAAI Conference on Artificial Intelligence (AAAI), Toronto, Canada, pp. 556\u2013562. AAAI Press, July 2012","DOI":"10.1609\/aaai.v26i1.8148"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TCIAIG.2011.2107323","volume":"3","author":"MPD Schadd","year":"2011","unstructured":"Schadd, M.P.D., Winands, M.H.M.: Best reply search for multiplayer games. IEEE Trans. Comput. Intell. AI Games 3(1), 57\u201366 (2011)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"9_CR26","unstructured":"Schensted, C., Titus, C.: Mudcrack Y & Poly-Y. Neo Press (1975)"},{"issue":"2","key":"9_CR27","first-page":"63","volume":"17","author":"M Schijf","year":"1994","unstructured":"Schijf, M., Victor Allis, L., Uiterwijk, J.W.H.M.: Proof-number search and transpositions. ICCA J. 17(2), 63\u201374 (1994)","journal-title":"ICCA J."},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/321439.321444","volume":"15","author":"JR Slagle","year":"1968","unstructured":"Slagle, J.R., Bursky, P.: Experiments with a multipurpose, theorem-proving heuristic program. J. ACM 15(1), 85\u201399 (1968)","journal-title":"J. ACM"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T.: Learning to solve game trees. In: 24th International Conference on Machine Learning, ICML \u201907, pp. 839\u2013846. ACM, New York (2007)","DOI":"10.1145\/1273496.1273602"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Sturtevant, N.R.: A comparison of algorithms for multi-player games. In: Computer and Games (2002)","DOI":"10.1007\/978-3-540-40031-8_8"},{"key":"9_CR31","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":"HJ van den Herik","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.) Oppos. Concepts in Comp. Intel., SCI, vol. 155, pp. 91\u2013118. Springer, Heidelberg (2008)"},{"key":"9_CR32","unstructured":"van Rijswijck, J.: Search and evaluation in Hex. Technical report, University of Alberta (2002)"},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TCIAIG.2010.2061050","volume":"2","author":"MHM Winands","year":"2010","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte Carlo tree search in lines of action. IEEE Trans. Comput. Intell. AI Games 2(4), 239\u2013250 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume-title":"Computers and Games","author":"MHM Winands","year":"2008","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte-Carlo tree search solver. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 25\u201336. Springer, Heidelberg (2008)"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:33:50Z","timestamp":1675121630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_9","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"}}]}}