{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:56:30Z","timestamp":1770278190023,"version":"3.49.0"},"reference-count":22,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,5,14]]},"abstract":"<jats:p>\u00a0In this paper, we present a comparative analysis of two selection policies in the General Game Playing (GGP) context: Upper Confidence Bound (UCB) and Upper Confidence Bound Tuned (UCB-Tuned). The aim of the analysis is to identify which policy has the best performance in terms of victories in the GGP domain, a measure used in most of literature with other policies. In order to carry out the comparison, two agents were programmed using the GGP-base framework and the Monte Carlo Tree Search (MCTS) method. The games Breakthrough, Knightthrough and Connect Four were used as experimental scenarios, not compared previously to the best of our knowledge. The results show that UCB-Tuned is better when less than 100 simulations are used in MCTS; however, when 1000 simulations are used, both policies have similar performance.<\/jats:p>","DOI":"10.3233\/jifs-179052","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T12:18:33Z","timestamp":1557836313000},"page":"5073-5079","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":15,"title":["A comparison between UCB and UCB-Tuned as selection policies in GGP"],"prefix":"10.1177","volume":"36","author":[{"given":"Iv\u00e1n","family":"Francisco-Valencia","sequence":"first","affiliation":[{"name":"Facultad de Ingenier\u00eda, Universidad Aut\u00f3noma del Estado de M\u00e9xico, Cerro de Coatepec S\/N Ciudad Universitaria C.P. 50100. Toluca, Estado de M\u00e9xico"}]},{"given":"Jos\u00e9 Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[{"name":"Facultad de Ingenier\u00eda, Universidad Aut\u00f3noma del Estado de M\u00e9xico, Cerro de Coatepec S\/N Ciudad Universitaria C.P. 50100. Toluca, Estado de M\u00e9xico"}]},{"given":"Rosa Mar\u00eda","family":"Valdovinos-Rosas","sequence":"additional","affiliation":[{"name":"Facultad de Ingenier\u00eda, Universidad Aut\u00f3noma del Estado de M\u00e9xico, Cerro de Coatepec S\/N Ciudad Universitaria C.P. 50100. Toluca, Estado de M\u00e9xico"}]}],"member":"179","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"217","article-title":"Minimax policies for adversarial and stochastic bandits","author":"Audibert J.-Y.","year":"2009","unstructured":"AudibertJ.-Y. and BubeckS., Minimax policies for adversarial and stochastic bandits, In COLT, 2009, pp. 217\u2013226.","journal-title":"COLT"},{"key":"e_1_3_2_3_2","first-page":"150","volume-title":"ALT","author":"Audibert J.-Y.","year":"2007","unstructured":"AudibertJ.-Y., MunosR. and Szepesv\u00e1riC., Tuning bandit algorithms in stochastic environments, In ALT, volume 4754, Springer, 2007, pp. 150\u2013165."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_5_2","first-page":"55","volume-title":"Proceedings of the IJCAI-13 Workshop on General Game Playing (GIGA\u201913)","author":"Bj\u00f6rnsson Y.","year":"2013","unstructured":"Bj\u00f6rnssonY. and SchiffelS., Comonparis of GDL reasoners, In Proceedings of the IJCAI-13 Workshop on General Game Playing (GIGA\u201913), 2013, pp. 55\u201362."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00129-1"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27992-3_3"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.024"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.26481\/dis.20100930gc"},{"key":"e_1_3_2_11_2","first-page":"259","article-title":"Simulation-based approach to general game playing","volume":"8","author":"Finnsson H.","year":"2008","unstructured":"FinnssonH. and Bj\u00f6rnssonY., Simulation-based approach to general game playing, In AAAI, volume 8, 2008, pp. 259\u2013264.","journal-title":"AAAI"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v34i2.2475"},{"issue":"2","key":"e_1_3_2_13_2","first-page":"62","article-title":"General game playing: Overview of the AAAI competition","volume":"26","author":"Genesereth M.","year":"2005","unstructured":"GeneserethM., LoveN. and PellB., General game playing: Overview of the AAAI competition, AI Magazine26(2) (2005), 62.","journal-title":"AI Magazine"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27992-3_4"},{"key":"e_1_3_2_15_2","first-page":"5","volume-title":"European Workshop on Reinforcement Learning","author":"Maes F.","year":"2011","unstructured":"MaesF., WehenkelL. and ErnstD., Automatic discovery of ranking formulas for playing with multi-armed bandits, In European Workshop on Reinforcement Learning, Springer, 2011, pp. 5\u201317."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000038"},{"key":"e_1_3_2_17_2","first-page":"242","volume-title":"Computational Intelligence and Games (CIG), 2012 IEEE Conference on","author":"Perick P.","year":"2012","unstructured":"PerickP., St-PierreD.L., MaesF. and ErnstD., Comparison of different selection strategies in montecarlo tree search for the game of tron, In Computational Intelligence and Games (CIG), 2012 IEEE Conference on, IEEE, 2012, pp. 242\u2013249."},{"key":"e_1_3_2_18_2","first-page":"196","volume-title":"Advances in Computer Games","author":"Saffidine A.","year":"2011","unstructured":"SaffidineA., JouandeauN. and CazenaveT., Solving breakthrough with race patterns and job-level proof number search, In Advances in Computer Games, Springer, 2011, pp. 196\u2013207."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"issue":"1","key":"e_1_3_2_20_2","first-page":"21","article-title":"Chinook the world man-machine checkers champion","volume":"17","author":"Schaeffer J.","year":"1996","unstructured":"SchaefferJ., LakeR., LuP. and BryantM., Chinook the world man-machine checkers champion, AI Magazine17(1) (1996), 21.","journal-title":"AI Magazine"},{"key":"e_1_3_2_21_2","unstructured":"SuttonR.S. and BartoA.G. Reinforcement learning: An introduction volume 1 MIT Press Cambridge 1998."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11313-5_23"},{"key":"e_1_3_2_23_2","article-title":"A survey on contextual multi-armed bandits","author":"Zhou L.","year":"2015","unstructured":"ZhouL., A survey on contextual multi-armed bandits. CoRR, abs\/1508.03326, 2015.","journal-title":"CoRR"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179052","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179052","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:18:14Z","timestamp":1770229094000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,14]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5,14]]}},"alternative-id":["10.3233\/JIFS-179052"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179052","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,14]]}}}