{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:19:42Z","timestamp":1725808782499},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444399"},{"type":"electronic","value":"9783662444405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44440-5_1","type":"book-chapter","created":{"date-parts":[[2014,10,30]],"date-time":"2014-10-30T00:56:22Z","timestamp":1414630582000},"page":"3-20","source":"Crossref","is-referenced-by-count":2,"title":["Investigations with Monte Carlo Tree Search for Finding Better Multivariate Horner Schemes"],"prefix":"10.1007","author":[{"given":"H. Jaap","family":"van den Herik","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kuipers","sequence":"additional","affiliation":[]},{"given":"Jos A. M.","family":"Vermaseren","sequence":"additional","affiliation":[]},{"given":"Aske","family":"Plaat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,31]]},"reference":[{"key":"1_CR1","unstructured":"Allis, V.: Searching for Solutions in Games and Artificial Intelligence. (Ph.D. thesis), University of Limburg, Maastricht, The Netherlands (1994)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.3233\/ICG-2012-35105","volume":"35","author":"I Alth\u00f6fer","year":"2012","unstructured":"Alth\u00f6fer, I.: The origin of dynamic komi. ICGA J. 35(1), 31\u201334 (2012)","journal-title":"ICGA J."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aoyama, T., Hayakawa, M., Kinoshita, T., Nio, M.: Tenth-Order QED Lepton Anomalous Magnetic Moment \u2013 Eighth-Order Vertices Containing a Second-Order Vacuum Polarization. e-Print: arXiv:1110.2826 [hep-ph] (2011)","DOI":"10.1103\/PhysRevD.83.053002"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"1_CR5","series-title":"International Federation for Information Processing","first-page":"159","volume-title":"10th Advances in Computer Games Conference (ACG-10)","author":"B Bouzy","year":"2003","unstructured":"Bouzy, B., Helmstetter, B.: Monte-Carlo Go developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) ACG-10. IFIP, vol. 135, pp. 159\u2013174. Springer, Boston (2003)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-31866-5_9","volume-title":"Advances in Computer Games","author":"B Bouzy","year":"2012","unstructured":"Bouzy, B., M\u00e9tivier, M., Pellier, D.: MCTS experiments on the voronoi game. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 96\u2013107. Springer, Heidelberg (2012)"},{"key":"1_CR7","unstructured":"Br\u00fcgmann, B.: Monte-Carlo Go. In: AAAI Fall symposium on Games: Playing, Planning, and Learning (1993). http:\/\/www.cgl.ucsf.edu\/go\/Programs\/Gobble.html"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., 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":"1_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/980175.980179","volume":"38","author":"M Ceberio","year":"2004","unstructured":"Ceberio, M., Kreinovich, V.: Greedy algorithms for optimizing multivariate Horner schemes. ACM SIGSAM Bull. 38, 8\u201315 (2004)","journal-title":"ACM SIGSAM Bull."},{"key":"1_CR10","unstructured":"Chaslot, G., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo strategies for computer Go. In: Proceedings of the 18th BeNeLux Conference on Articial Intelligence, pp. 83\u201390 (2006)"},{"key":"1_CR11","unstructured":"Chaslot, G.M.J.-B., de Jong, S., Saito, J.-T., Uiterwijk, J.W.H.M.: Monte-Carlo tree search in production management problems. In: Proceedings of the BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 91\u201398 (2006)"},{"key":"#cr-split#-1_CR12.1","doi-asserted-by":"crossref","unstructured":"Chaslot, G.M.J-B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655-661. World Scientific Publishing Co., Pte. Ltd. (2007)","DOI":"10.1142\/9789812709677_0246"},{"key":"#cr-split#-1_CR12.2","unstructured":"New Mathematics and Natural Computation, vol. 4(3), pp. 343-357 (2008)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Chaslot, G.M.J-B., Bakkes, S., Szita, I., Spronck, P.: Monte-Carlo tree search: a new framework for game AI. In: Mateas, M., Darken, C. (eds.) Proceedings of the 4th Artificial Intelligence and Interactive Digital Entertainment Conference. AAAI Press, Menlo Park (2008)","DOI":"10.1609\/aiide.v4i1.18700"},{"issue":"3","key":"1_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/ICG-2008-31310","volume":"31","author":"GMJ-B Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Hoock, J.-B., Rimmel, A., Teytaud, O., Lee, C.-S., Wang, M.-H., Tsai, S.-R., Hsu, S.-C.: Human-computer go revolution 2008. ICGA J. 31(3), 179\u2013185 (2008)","journal-title":"ICGA J."},{"issue":"3","key":"1_CR15","first-page":"181","volume":"19","author":"S Chinchalkar","year":"1996","unstructured":"Chinchalkar, S.: An upper bound for the number of reachable positions. ICCA J. 19(3), 181\u2013182 (1996)","journal-title":"ICCA J."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2005.09.049","volume":"349","author":"JHLM Donkers","year":"2005","unstructured":"Donkers, J.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M.: Selecting evaluation functions in opponent model search. Theoret. Comput. Sci. (TCS) 349(2), 245\u2013267 (2005)","journal-title":"Theoret. Comput. Sci. (TCS)"},{"key":"#cr-split#-1_CR18.1","unstructured":"de Groot, A.D.: Het denken van den schaker, Ph. D. thesis in dutch (1946)"},{"key":"#cr-split#-1_CR18.2","unstructured":"translated in 1965 as \"Thought and Choice in chess\", Mouton Publishers, The Hague (2nd edn. 1978). Freely available as e-book from Google (1946)"},{"key":"1_CR19","series-title":"The International Federation for Information Processing","first-page":"97","volume-title":"Proceedings of the 10th Advances in Computer Games Conference","author":"M Enzenberger","year":"2003","unstructured":"Enzenberger, M.: Evaluation in go by a neural network using soft segmentation. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games. IFIP, vol. 135, pp. 97\u2013108. Springer, Boston (2003)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Horner, W.G.: A new method of\u00a0solving numerical equations of all orders, by continuous\u00a0approximation. Philos. Trans. (R. Soc. Lond.) 109, 308\u2013335 (1819); Reprinted with appraisal in Smith, D.E.: A Source Book in Mathematics, McGraw-Hill (1929); Dover reprint, vol. 2 (1959)","DOI":"10.1098\/rstl.1819.0023"},{"key":"1_CR21","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in monte-carlo go. Inst. Nat. Rech. Inform. Auto. (INRIA), Paris, Technical report (2006)"},{"issue":"1","key":"1_CR22","first-page":"14","volume":"10","author":"D Hartmann","year":"1987","unstructured":"Hartmann, D.: How to extract relevant knowledge from grandmaster games. Part 1: Grandmaster have insights\u2013the problem is what to incorporate into practical problems. ICCA J. 10(1), 14\u201336 (1987)","journal-title":"ICCA J."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"van den Herik, H.J.: Informatica en het Menselijk Blikveld. Inaugural address Rijksuniversiteit Limburg, Maastricht, The Netherlands (1988)","DOI":"10.26481\/spe.19881021hh"},{"issue":"1","key":"1_CR24","first-page":"14","volume":"21","author":"A Junghanns","year":"1998","unstructured":"Junghanns, A.: Are there practical alternatives to alpha-beta? ICCA J. 21(1), 14\u201332 (1998)","journal-title":"ICCA J."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Kocsis, L., Szepesv\u00e0ri, C.: Bandit based monte-carlo planning. In: European Conference on Machine Learning, pp. 282\u2013293. Springer, Berlin, Germany (2006)","DOI":"10.1007\/11871842_29"},{"key":"1_CR26","unstructured":"Kuipers, J., Vermaseren, J.A.M., Plaat, A., van den Herik, H.J.: Improving multivariate Horner schemes with Monte Carlo tree search, July 2012. arXiv 1207.7079"},{"key":"1_CR27","unstructured":"Kuipers, J., Ueda, T., Vermaseren, J.A.M., Vollinga, J.: FORM version 4.0 (2012) (preprint). arXiv:1203.6543"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-17928-0_12","volume-title":"Computers and Games","author":"J Kloetzer","year":"2011","unstructured":"Kloetzer, J.: Monte-Carlo opening books for amazons. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 124\u2013135. Springer, Heidelberg (2011)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1070\/RM2001v056n05ABEH000448","volume":"56","author":"EM Landis","year":"2001","unstructured":"Landis, E.M., Yaglom, I.M.: About aleksandr semenovich kronrod. Russ. Math. Surv. 56, 993\u20131007 (2001)","journal-title":"Russ. Math. Surv."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-15582-6_55","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"CE Leiserson","year":"2010","unstructured":"Leiserson, C.E., Li, L., Maza, M.M., Xie, Y.: Efficient evaluation of large polynomials. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 342\u2013353. Springer, Heidelberg (2010)"},{"issue":"3","key":"1_CR31","doi-asserted-by":"crossref","first-page":"140","DOI":"10.3233\/ICG-2011-34303","volume":"34","author":"R Lorentz","year":"2011","unstructured":"Lorentz, R.: Experiments with monte carlo tree search in the game of havannah. ICGA J. 34(3), 140\u2013149 (2011)","journal-title":"ICGA J."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-31866-5_5","volume-title":"Advances in Computer Games","author":"RJ Lorentz","year":"2012","unstructured":"Lorentz, R.J.: An MCTS program to play einstein w\u00fcrfelt nicht!. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 52\u201359. Springer, Heidelberg (2012)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Moch, S.-O., Vermaseren, J.A.M., Vogt, A.: Nucl. Phys. B688, B691, 101\u2013134, 129\u2013181 (2004); B724, 3\u2013182 (2005)","DOI":"10.1016\/j.nuclphysb.2004.03.030"},{"issue":"1\u20132","key":"1_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0004-3702(01)00121-7","volume":"134","author":"M M\u00fcller","year":"2002","unstructured":"M\u00fcller, M.: Computer Go. Artif. Intell. 134(1\u20132), 145\u2013179 (2002)","journal-title":"Artif. Intell."},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","volume":"14","author":"J Pearl","year":"1980","unstructured":"Pearl, J.: Asymptotical properties of minimax trees and game searching procedures. Artif. Intell. 14(2), 113\u2013138 (1980)","journal-title":"Artif. Intell."},{"key":"1_CR36","volume-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics Intelligent Search Strategies for Computer Problem Solving. Addison-WesleyPublishing Co, Reading (1984)"},{"issue":"1\u20132","key":"1_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(95)00126-3","volume":"87","author":"A Plaat","year":"1996","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence 87(1\u20132), 255\u2013293 (1996)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"1_CR38","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","volume":"34","author":"R Rivest","year":"1988","unstructured":"Rivest, R.: Game-tree searching by min-max approximation. Artif. Intell. 34(1), 77\u201396 (1988)","journal-title":"Artif. Intell."},{"key":"1_CR39","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for monte carlo tree search. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-2011, pp. 649\u2013654 (2011)"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-75538-8_5","volume-title":"Computers and Games","author":"J-T Saito","year":"2007","unstructured":"Saito, J.-T., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-carlo proof-number search for computer go. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 50\u201361. Springer, Heidelberg (2007)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"MPD Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-player 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. 1\u201312. Springer, Heidelberg (2008)"},{"issue":"2","key":"1_CR42","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","volume":"12","author":"GC Stockman","year":"1979","unstructured":"Stockman, G.C.: A minimax algorithm better than alpha-beta? Artif. Intell. 12(2), 179\u2013196 (1979)","journal-title":"Artif. Intell."},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-12993-3_3","volume-title":"Advances in Computer Games","author":"I Szita","year":"2010","unstructured":"Szita, I., Chaslot, G., Spronck, P.: Monte-Carlo tree search in settlers of catan. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 21\u201332. Springer, Heidelberg (2010)"},{"issue":"2","key":"1_CR44","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.tcs.2005.09.045","volume":"349","author":"ECD Werf van der","year":"2005","unstructured":"van der Werf, E.C.D., van den Herik, H.J., Uiterwijk, J.W.H.M.: Learning to score final positions in the game of Go. Theoret. Comput. Sci. 349(2), 168\u2013183 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ins.2004.04.013","volume":"175","author":"ECD Werf van der","year":"2005","unstructured":"van der Werf, E.C.D., Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M.: Learning to predict Life and Death from Go game records. Inf. Sci. 175(4), 258\u2013272 (2005)","journal-title":"Inf. Sci."}],"container-title":["Communications in Computer and Information Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44440-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T14:06:07Z","timestamp":1689602767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44440-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444399","9783662444405"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44440-5_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}