An analysis for strength improvement of an MCTS-based program playing Chinese dark chess

DOI10.1016/j.tcs.2016.06.025zbMath1370.68262OpenAlexW2475181187MaRDI QIDQ307781

I-Chen Wu, Wen-Jie Tseng, Jr-Chang Chen, Chu-Hsuan Hsueh, Shi-Jim Yen

Publication date: 5 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.025

zbMATH Keywords

Monte Carlo tree searchChinese dark chessearly playout terminationsimplicit minimax backupsprogressive biasquality-based rewards

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Multi-armed bandits with episode context
• Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search
• A Quantitative Study of $$2 \times 4$$ Chinese Dark Chess
• Material Symmetry to Partition Endgame Tables
• Automatic Generation of Opening Books for Dark Chess
• Amazons Discover Monte-Carlo
• Monte-Carlo Tree Search Solver
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: An analysis for strength improvement of an MCTS-based program playing Chinese dark chess