{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:23:43Z","timestamp":1767677023894,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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":"http:\/\/www.springer.com\/tdm"}],"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_6","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"60-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["MoHex 2.0: A Pattern-Based MCTS Hex Player"],"prefix":"10.1007","author":[{"given":"Shih-Chieh","family":"Huang","sequence":"first","affiliation":[]},{"given":"Broderick","family":"Arneson","sequence":"additional","affiliation":[]},{"given":"Ryan B.","family":"Hayward","sequence":"additional","affiliation":[]},{"given":"Martin","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Pawlewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.3233\/ICG-2000-23312","volume":"23","author":"VV Anshelevich","year":"2000","unstructured":"Anshelevich, V.V.: Hexy wins Hex tournament. ICGA J. 23(3), 181\u2013184 (2000)","journal-title":"ICGA J."},{"issue":"1\u20132","key":"6_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0004-3702(01)00154-0","volume":"134","author":"VV Anshelevich","year":"2002","unstructured":"Anshelevich, V.V.: A hierarchical approach to computer Hex. Artif. Intell. 134(1\u20132), 101\u2013120 (2002)","journal-title":"Artif. Intell."},{"issue":"2","key":"6_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.3233\/ICG-2009-32218","volume":"32","author":"B Arneson","year":"2009","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Mohex wins Hex tournament. ICGA J. 32(2), 114\u2013116 (2009)","journal-title":"ICGA J."},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/ICG-2009-32111","volume":"32","author":"B Arneson","year":"2009","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Wolve 2008 wins Hex tournament. ICGA J. 32(1), 49\u201353 (2009)","journal-title":"ICGA J."},{"issue":"3","key":"6_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.3233\/ICG-2010-33316","volume":"33","author":"B Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Mohex wins Hex tournament. ICGA J. 33(3), 181\u2013186 (2010)","journal-title":"ICGA J."},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2010.2067212","volume":"2","author":"B Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Monte-Carlo tree search in Hex. IEEE Trans. Comput. Intell. AI Games 2(4), 251\u2013258 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rnsson, Y., Hayward, R.B., Johanson, M., van Rijswijck, J.: Dead cell analysis in Hex and the Shannon game. In: Bondy, A., Fonlupt, J., Fouquet, J.-L., Fournier, J.-C., Ramirez Alfonsin, J.L. (eds.) Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge, pp. 45\u201360. Birkh\u00e4user (2007)","DOI":"10.1007\/978-3-7643-7400-6_5"},{"key":"6_CR8","volume-title":"Hex Strategy: Making the Right Connections","author":"C Browne","year":"2000","unstructured":"Browne, C.: Hex Strategy: Making the Right Connections. A.K. Peters, Natick (2000)"},{"key":"6_CR9","volume-title":"Connection Games: Variations on a Theme","author":"C Browne","year":"2005","unstructured":"Browne, C.: Connection Games: Variations on a Theme. A.K. Peters, Wellesley (2005)"},{"issue":"03","key":"6_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"04","author":"GMJ-B Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M., Bouzy, B.: Progressive strategies for monte-carlo tree search. New Math. Nat. Comput. (NMNC) 04(03), 343\u2013357 (2008)","journal-title":"New Math. Nat. Comput. (NMNC)"},{"key":"6_CR11","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)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Computing \u201celo ratings\u201d of move patterns in the game of go. ICGA J. 30(4), 198\u2013208 (2007). http:\/\/remi.coulom.free.fr\/Amsterdam2007\/","DOI":"10.3233\/ICG-2007-30403"},{"key":"6_CR13","unstructured":"Coulom, R.: Criticality: a monte-carlo heuristic for go programs (2009). http:\/\/remi.coulom.free.fr\/Criticality\/"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Coulom, R.: CLOP: confident local optimization for noisy black-box parameter tuning. In: 13th Advances in Computer Games, pp. 146\u2013157 (2011). http:\/\/remi.coulom.free.fr\/CLOP\/","DOI":"10.1007\/978-3-642-31866-5_13"},{"key":"6_CR15","unstructured":"Enzenberger, M., M\u00fcller, M., Arneson, B., Segal, R., Xie, F., Huang, A.: Fuego (2007\u20132012). http:\/\/fuego.sourceforge.net\/"},{"key":"6_CR16","unstructured":"Ewalds, T.: Playing and solving havannah. Master\u2019s thesis, University of Alberta (2012)"},{"key":"6_CR17","unstructured":"Gardner, M.: Recreational topology. In: The 2nd Scientific American Book of Mathematical Puzzles and Diversions, Chap. 7, pp. 78\u201388. Simon and Schuster, New York (1961)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Ghahramani, Z. (ed.) ICML. ACM International Conference Proceeding Series, vol. 227, pp. 273\u2013280. ACM (2007)","DOI":"10.1145\/1273496.1273531"},{"issue":"3","key":"6_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.3233\/ICG-2006-29313","volume":"29","author":"RB Hayward","year":"2006","unstructured":"Hayward, R.B.: Six wins Hex tournament. ICGA J. 29(3), 163\u2013165 (2006)","journal-title":"ICGA J."},{"issue":"3","key":"6_CR20","doi-asserted-by":"crossref","first-page":"180","DOI":"10.3233\/ICG-2013-36318","volume":"36","author":"RB Hayward","year":"2013","unstructured":"Hayward, R.B.: Mohex wins Hex tournament. ICGA J. 36(3), 180\u2013183 (2013)","journal-title":"ICGA J."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Hayward, R.B., van Rijswijck, J.: Hex and combinatorics. Discrete Math. 306 (19\u201320), 2515\u20132528 (2006)","DOI":"10.1016\/j.disc.2006.01.029"},{"key":"6_CR22","unstructured":"Hein, P.: Vil de laere Polygon? Politiken, 26 December 1942"},{"key":"6_CR23","unstructured":"Henderson, P.: Playing and Solving the Game of Hex. Ph.D. thesis, University of Alberta, Edmonton, Alberta, Canada (2010)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Huang, S.-C.: New Heuristics for Monte Carlo Tree Search Applied to the Game of Go. Ph.D. thesis, Nat. Taiwan Normal Univ., Taipei (2011)","DOI":"10.1109\/TAAI.2010.78"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Huang, S.-C., Coulom, R., Lin, S.-S.: Time management for Monte-Carlo tree search applied to the game of go. In: 2010 International Conference on Technologies and Applications of Artificial Intelligence (TAAI), pp. 462\u2013466, November 2010","DOI":"10.1109\/TAAI.2010.78"},{"volume-title":"The Essential John Nash","year":"2002","key":"6_CR26","unstructured":"Kuhn, H.W., Nasar, S. (eds.): The Essential John Nash. Princeton University Press, Princeton (2002)"},{"key":"6_CR27","unstructured":"Nasar, S.: A Beautiful Mind: A Biography of John Forbes Nash. Jr, Simon and Schuster (1998)"},{"key":"6_CR28","unstructured":"Nash, J.: Some games and machines for playing them. Technical report D-1164, RAND, February 1952"},{"key":"6_CR29","first-page":"1234","volume":"41","author":"CE Shannon","year":"1953","unstructured":"Shannon, C.E.: Computers and automata. Proc. Inst. Radio Eng. 41, 1234\u20131241 (1953)","journal-title":"Proc. Inst. Radio Eng."},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gelly, S.: Modifications of uct and sequence-like simulations for monte-carlo go. In: CIG, pp. 175\u2013182. IEEE (2007)","DOI":"10.1109\/CIG.2007.368095"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:33:19Z","timestamp":1675121599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_6","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"}}]}}