{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:52Z","timestamp":1725474352592},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318658"},{"type":"electronic","value":"9783642318665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31866-5_9","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T21:51:08Z","timestamp":1342648268000},"page":"96-107","source":"Crossref","is-referenced-by-count":2,"title":["MCTS Experiments on the Voronoi Game"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Bouzy","sequence":"first","affiliation":[]},{"given":"Marc","family":"M\u00e9tivier","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Pellier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H.-K. Ahn","year":"2004","unstructured":"Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Theoretical Computer Science\u00a0310(1-3), 457\u2013467 (2004)","journal-title":"Theoretical Computer Science"},{"unstructured":"Anuth, J.: Strategien fur das Voronoi-spiel. Master\u2019s thesis, FernUniverist\u00e4t in Hagen (July 2007)","key":"9_CR2"},{"key":"9_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-72927-3_33","volume-title":"Learning Theory","author":"P. Auer","year":"2007","unstructured":"Auer, P., Ortner, R., Szepesv\u00e1ri, C.: Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In: Bshouty, N., Gentile, C. (eds.) COLT 2007. LNCS (LNAI), vol.\u00a04539, pp. 454\u2013468. Springer, Heidelberg (2007)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Computing Surveys\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ins.2004.04.010","volume":"175","author":"B. Bouzy","year":"2005","unstructured":"Bouzy, B.: Associating domain-dependent knowledge and Monte-Carlo approaches within a go playing program. Information Sciences\u00a0175(4), 247\u2013257 (2005)","journal-title":"Information Sciences"},{"unstructured":"Brochu, E., Cora, V., de Freitas, N.: A tutorial on bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. Technical Report\u00a023, Univ. of Brit. Col. (2009)","key":"9_CR6"},{"key":"9_CR7","first-page":"1655","volume":"12","author":"S. Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesv\u00e1ri, C.: X-armed bandits. Journal of Machine Learning Research\u00a012, 1655\u20131695 (2011)","journal-title":"Journal of Machine Learning Research"},{"unstructured":"Chaslot, G.: Monte-Carlo Tree Search. PhD thesis, Maastricht Univ (2010)","key":"9_CR8"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"G. Chaslot","year":"2008","unstructured":"Chaslot, G., Winands, M., van den Herik, J., Uiterwijk, J., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Mathematics and Natural Computation\u00a04(3), 343\u2013357 (2008)","journal-title":"New Mathematics and Natural Computation"},{"doi-asserted-by":"crossref","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matou\u0161ek, J.: The one-round Voronoi game. In: 18th Symposium on Computational Geometry, pp. 97\u2013101. ACM (2002)","key":"9_CR10","DOI":"10.1145\/513400.513413"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-25566-3_32","volume-title":"Learning and Intelligent Optimization","author":"A. Cou\u00ebtoux","year":"2011","unstructured":"Cou\u00ebtoux, A., Hoock, J.-B., Sokolovska, N., Teytaud, O., Bonnard, N.: Continuous Upper Confidence Trees. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol.\u00a06683, pp. 433\u2013445. Springer, Heidelberg (2011)"},{"key":"9_CR12","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.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/3-540-36136-7_54","volume-title":"Algorithms and Computation","author":"F. Dehne","year":"2002","unstructured":"Dehne, F., Klein, R., Seidel, R.: Maximizing a Voronoi Region: The Convex Case. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 624\u2013634. Springer, Heidelberg (2002)"},{"unstructured":"Faidley, M., Poultney, C., Shasha, D.: The Voronoi game, \n                  \n                    http:\/\/home.dti.net\/crispy\/Voronoi.html","key":"9_CR14"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"S.P. Fekete","year":"2005","unstructured":"Fekete, S.P., Meijer, H.: The one-round Voronoi game replayed. Computational Geometry Theory Appl.\u00a030, 81\u201394 (2005)","journal-title":"Computational Geometry Theory Appl."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02(2), 153\u2013174 (1987)","journal-title":"Algorithmica"},{"unstructured":"Gelly, S., Silver, D.: Achieving master level play in 9x9 computer go. In: AAAI, pp. 1537\u20131540 (2008)","key":"9_CR17"},{"doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. In: 15th ACM Symposium on Theory Of Computing, pp. 221\u2013234. ACM (1983)","key":"9_CR18","DOI":"10.1145\/800061.808751"},{"unstructured":"Kleinberg, R.: Nearly tight bounds for the continuum-armed bandit problem. In: NIPS 17, pp. 697\u2013704. MIT Press (2005)","key":"9_CR19"},{"key":"9_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S.P. Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Transactions on Information Theory\u00a028, 129\u2013137 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0098-3004(03)00017-7","volume":"29","author":"M.A. Mostafavi","year":"2003","unstructured":"Mostafavi, M.A., Gold, C., Dakowicz, M.: Delete and insert operations in Voronoi\/Delaunay methods and applications. Computers and Geosciences\u00a029(4), 523\u2013530 (2003)","journal-title":"Computers and Geosciences"},{"doi-asserted-by":"crossref","unstructured":"Edward Rasmussen, C., Williams, C.K.I.: GaussianProcesses for Machine Learning. MIT Press (2006)","key":"9_CR23","DOI":"10.7551\/mitpress\/3206.001.0001"},{"unstructured":"Selimi, I.: The Voronoi game (2008), \n                  \n                    http:\/\/www.voronoigame.com\/","key":"9_CR24"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J. Shewchuk","year":"1996","unstructured":"Shewchuk, J.: Triangle: Engineering a 2d Quality Mesh Generator and Delaunay Triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996)"}],"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-31866-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:05:16Z","timestamp":1556924716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31866-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318658","9783642318665"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31866-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}