{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T16:37:24Z","timestamp":1775925444249,"version":"3.50.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T00:00:00Z","timestamp":1599350400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Ministry of Science and Technology of the Republic of China","award":["102-2221-E-009-069-MY2"],"award-info":[{"award-number":["102-2221-E-009-069-MY2"]}]},{"name":"Ministry of Science and Technology of the Republic of China","award":["102-2221-E-009-080-MY2"],"award-info":[{"award-number":["102-2221-E-009-080-MY2"]}]},{"name":"Ministry of Science and Technology of the Republic of China","award":["104-2221-E-009-127-MY2"],"award-info":[{"award-number":["104-2221-E-009-127-MY2"]}]},{"name":"Ministry of Science and Technology of the Republic of China","award":["104-2221-E-009-074-MY2"],"award-info":[{"award-number":["104-2221-E-009-074-MY2"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1016\/j.tcs.2016.06.025","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T11:59:33Z","timestamp":1467201573000},"page":"63-75","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["An analysis for strength improvement of an MCTS-based program playing Chinese dark chess"],"prefix":"10.1016","volume":"644","author":[{"given":"Chu-Hsuan","family":"Hsueh","sequence":"first","affiliation":[]},{"given":"I-Chen","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wen-Jie","family":"Tseng","sequence":"additional","affiliation":[]},{"given":"Shi-Jim","family":"Yen","sequence":"additional","affiliation":[]},{"given":"Jr-Chang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2\u20133","key":"10.1016\/j.tcs.2016.06.025_br0010","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"10.1016\/j.tcs.2016.06.025_br0020","series-title":"Computer Games","first-page":"45","article-title":"Monte Carlo tree search and minimax hybrids with heuristic evaluation functions","volume":"vol. 504","author":"Baier","year":"2014"},{"issue":"1","key":"10.1016\/j.tcs.2016.06.025_br0030","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TCIAIG.2009.2018702","article-title":"CadiaPlayer: a simulation-based general game player","volume":"1","author":"Bj\u00f6rnsson","year":"2009","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"key":"10.1016\/j.tcs.2016.06.025_br0040","series-title":"Proc. BeNeLux Conf. Artif. Intell.","first-page":"57","article-title":"A comparison of Monte Carlo methods for phantom Go","author":"Borsboom","year":"2007"},{"issue":"1","key":"10.1016\/j.tcs.2016.06.025_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","article-title":"A survey of Monte Carlo tree search methods","volume":"4","author":"Browne","year":"2012","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"key":"10.1016\/j.tcs.2016.06.025_br0060","series-title":"Computers and Games","first-page":"151","article-title":"A quantitative study of 2\u00d74 Chinese dark chess","author":"Chang","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0070","series-title":"2015 IEEE Conference on Computational Intelligence and Games (CIG2015)","first-page":"260","article-title":"Convergence and correctness analysis of Monte Carlo tree search algorithms: a case study of 2 by 4 Chinese dark chess","author":"Chang","year":"2015"},{"key":"10.1016\/j.tcs.2016.06.025_br0080","series-title":"Monte Carlo tree search","author":"Chaslot","year":"2010"},{"key":"10.1016\/j.tcs.2016.06.025_br0090","series-title":"Advances in Computer Games","first-page":"1","article-title":"Adding expert knowledge and exploration in Monte Carlo tree search","volume":"vol. 6048","author":"Chaslot","year":"2010"},{"key":"10.1016\/j.tcs.2016.06.025_br0100","doi-asserted-by":"crossref","DOI":"10.1142\/S1793005708001094","article-title":"Progressive strategies for Monte Carlo tree search","volume":"4","author":"Chaslot","year":"2008","journal-title":"New Math. Nat. Comput."},{"key":"10.1016\/j.tcs.2016.06.025_br0110","series-title":"Computers and Games","first-page":"221","article-title":"Automatic generation of opening books for dark chess","author":"Chen","year":"2014"},{"issue":"2","key":"10.1016\/j.tcs.2016.06.025_br0120","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/ICG-2010-33204","article-title":"Chinese dark chess","volume":"33","author":"Chen","year":"2010","journal-title":"ICGA J."},{"key":"10.1016\/j.tcs.2016.06.025_br0130","series-title":"2015 IEEE Conference on Computational Intelligence and Games (CIG2015)","first-page":"254","article-title":"Compressing Chinese dark chess endgame databases","author":"Chen","year":"2015"},{"issue":"2","key":"10.1016\/j.tcs.2016.06.025_br0140","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TCIAIG.2014.2317832","article-title":"Equivalence classes in Chinese dark chess endgames","volume":"7","author":"Chen","year":"2015","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"key":"10.1016\/j.tcs.2016.06.025_br0150","series-title":"Proceeding of TCGA Workshop","first-page":"5","article-title":"Design and implementation of computer Chinese dark chess endgame database","author":"Chen","year":"2012"},{"issue":"4","key":"10.1016\/j.tcs.2016.06.025_br0160","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/TCIAIG.2010.2083662","article-title":"Fuego: an open-source framework for board games and Go engine based on Monte Carlo tree search","volume":"2","author":"Enzenberger","year":"2010","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"key":"10.1016\/j.tcs.2016.06.025_br0170","series-title":"The Twenty-Sixth AAAI Conference on Artificial Intelligence","first-page":"1550","article-title":"Generalized Monte Carlo tree search extensions for general game playing","author":"Finnsson","year":"2012"},{"key":"10.1016\/j.tcs.2016.06.025_br0180","series-title":"Proceedings of the 24th International Conference on Machine Learning","first-page":"273","article-title":"Combining online and offline knowledge in UCT","author":"Gelly","year":"2007"},{"issue":"11","key":"10.1016\/j.tcs.2016.06.025_br0190","doi-asserted-by":"crossref","first-page":"1856","DOI":"10.1016\/j.artint.2011.03.007","article-title":"Monte Carlo tree search and rapid action value estimation in computer Go","volume":"175","author":"Gelly","year":"2011","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.tcs.2016.06.025_br0200","series-title":"Modification of UCT with patterns in Monte Carlo Go","author":"Gelly","year":"2006"},{"issue":"4","key":"10.1016\/j.tcs.2016.06.025_br0210","doi-asserted-by":"crossref","first-page":"249","DOI":"10.3233\/ICG-2015-38411","article-title":"DarkKnight wins Chinese dark chess tournament","volume":"38","author":"Hsueh","year":"2016","journal-title":"ICGA J."},{"key":"10.1016\/j.tcs.2016.06.025_br0220","series-title":"The 14th Conference on Advances in Computer Games (ACG2015)","article-title":"Strength improvement and analysis for an MCTS-based Chinese dark chess program","author":"Hsueh","year":"2015"},{"key":"10.1016\/j.tcs.2016.06.025_br0230","series-title":"New heuristics for Monte Carlo tree search applied to the game of Go","author":"Huang","year":"2011"},{"key":"10.1016\/j.tcs.2016.06.025_br0240","series-title":"Computers and Games","first-page":"26","article-title":"Efficiency of static knowledge bias in Monte Carlo tree search","author":"Ikeda","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0250","series-title":"Proceeding of TCGA Workshop","first-page":"86","article-title":"Varying complexity in CHINESE DARK CHESS stochastic game","author":"Jouandeau","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0260","series-title":"Technologies and Applications of Artificial Intelligence","first-page":"228","article-title":"Monte Carlo tree reductions for stochastic games","volume":"vol. 8916","author":"Jouandeau","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0270","series-title":"Computer Games","first-page":"78","article-title":"Small and large MCTS playouts applied to Chinese dark chess stochastic game","volume":"vol. 504","author":"Jouandeau","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0280","series-title":"Machine Learning: ECML 2006","first-page":"282","article-title":"Bandit based Monte Carlo planning","volume":"vol. 4212","author":"Kocsis","year":"2006"},{"key":"10.1016\/j.tcs.2016.06.025_br0290","series-title":"2014 IEEE Conference on Computational Intelligence and Games","first-page":"1","article-title":"Monte Carlo tree search with heuristic evaluations using implicit minimax backups","author":"Lanctot","year":"2014"},{"issue":"4","key":"10.1016\/j.tcs.2016.06.025_br0300","doi-asserted-by":"crossref","first-page":"248","DOI":"10.3233\/ICG-2011-34413","article-title":"TAAI 2011 computer-game tournaments","volume":"34","author":"Lin","year":"2011","journal-title":"ICGA J."},{"key":"10.1016\/j.tcs.2016.06.025_br0310","series-title":"Computers and Games","first-page":"13","article-title":"Amazons discover Monte Carlo","volume":"vol. 5131","author":"Lorentz","year":"2008"},{"key":"10.1016\/j.tcs.2016.06.025_br0320","series-title":"The 14th Conference on Advances in Computer Games (ACG2015)","article-title":"Early playout termination in MCTS","author":"Lorentz","year":"2015"},{"key":"10.1016\/j.tcs.2016.06.025_br0330","series-title":"Computers and Games","first-page":"49","article-title":"Programming breakthrough","author":"Lorentz","year":"2014"},{"key":"10.1016\/j.tcs.2016.06.025_br0340","series-title":"Knowledge and Systems Engineering","first-page":"325","article-title":"Fast optimization of the pattern shapes in board games with simulated annealing","author":"Nguyen","year":"2015"},{"key":"10.1016\/j.tcs.2016.06.025_br0350","series-title":"21st European Conf. on Artif. Intell.","article-title":"Quality-based rewards for Monte Carlo tree search simulations","author":"Pepels","year":"2014"},{"issue":"3","key":"10.1016\/j.tcs.2016.06.025_br0360","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10472-011-9258-6","article-title":"Multi-armed bandits with episode context","volume":"61","author":"Rosin","year":"2011","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.tcs.2016.06.025_br0370","series-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"1995"},{"key":"10.1016\/j.tcs.2016.06.025_br0380","series-title":"Computers and Games","first-page":"187","article-title":"Material symmetry to partition endgame tables","author":"Saffidine","year":"2014"},{"issue":"1","key":"10.1016\/j.tcs.2016.06.025_br0390","doi-asserted-by":"crossref","first-page":"33","DOI":"10.3233\/ICG-2014-37107","article-title":"TAAI 2012 computer game tournaments","volume":"37","author":"Su","year":"2014","journal-title":"ICGA J."},{"issue":"3","key":"10.1016\/j.tcs.2016.06.025_br0420","doi-asserted-by":"crossref","first-page":"166","DOI":"10.3233\/ICG-2013-36310","article-title":"TCGA 2013 computer game tournament report","volume":"36","author":"Tseng","year":"2013","journal-title":"ICGA J."},{"key":"10.1016\/j.tcs.2016.06.025_br0430","series-title":"Computer Games Workshop","first-page":"175","article-title":"Monte Carlo tree search in Backgammon","author":"Van Lishout","year":"2007"},{"issue":"4","key":"10.1016\/j.tcs.2016.06.025_br0440","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TCIAIG.2010.2061050","article-title":"Monte Carlo tree search in lines of action","volume":"2","author":"Winands","year":"2010","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"key":"10.1016\/j.tcs.2016.06.025_br0450","series-title":"Computers and Games","first-page":"25","article-title":"Monte Carlo tree search solver","volume":"vol. 5131","author":"Winands","year":"2008"},{"issue":"3","key":"10.1016\/j.tcs.2016.06.025_br0460","doi-asserted-by":"crossref","first-page":"178","DOI":"10.3233\/ICG-2012-35305","article-title":"TCGA 2012 computer game tournament report","volume":"35","author":"Yang","year":"2012","journal-title":"ICGA J."},{"issue":"1","key":"10.1016\/j.tcs.2016.06.025_br0470","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TCIAIG.2014.2329034","article-title":"Design and implementation of Chinese dark chess programs","volume":"7","author":"Yen","year":"2015","journal-title":"IEEE Trans. Computat. Intell. AI Games"},{"issue":"3","key":"10.1016\/j.tcs.2016.06.025_br0480","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/ICG-2013-36315","article-title":"DarkKnight wins Chinese dark chess tournament","volume":"36","author":"Yen","year":"2013","journal-title":"ICGA J."},{"issue":"2","key":"10.1016\/j.tcs.2016.06.025_br0490","doi-asserted-by":"crossref","first-page":"108","DOI":"10.3233\/ICG-2011-34216","article-title":"The TCGA 2011 computer-games tournament","volume":"34","author":"Yen","year":"2011","journal-title":"ICGA J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302705?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302705?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T14:12:50Z","timestamp":1599401570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516302705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":47,"alternative-id":["S0304397516302705"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.06.025","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An analysis for strength improvement of an MCTS-based program playing Chinese dark chess","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.06.025","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}