Strength Estimation and Human-Like Strength Adjustment in Games
Chun Jung Chen, Chung-Chin Shih, Ti-Rong Wu
Abstract
Strength estimation and adjustment are crucial in designing human-AI interactions, particularly in games where AI surpasses human players. This paper introduces a novel strength system, including a strength estimator (SE) and an SE-based Monte Carlo tree search, denoted as SE-MCTS, which predicts strengths from games and offers different playing strengths with human styles. The strength estimator calculates strength scores and predicts ranks from games without direct human interaction. SE-MCTS utilizes the strength scores in a Monte Carlo tree search to adjust playing strength and style. We first conduct experiments in Go, a challenging board game with a wide range of ranks. Our strength estimator significantly achieves over 80% accuracy in predicting ranks by observing 15 games only, whereas the previous method reached 49% accuracy for 100 games. For strength adjustment, SE-MCTS successfully adjusts to designated ranks while achieving a 51.33% accuracy in aligning to human actions, outperforming a previous state-of-the-art, with only 42.56% accuracy. To demonstrate the generality of our strength system, we further apply SE and SE-MCTS to chess and obtain consistent results. These results show a promising approach to strength estimation and adjustment, enhancing human-AI interactions in games. Our code is available at https://rlg.iis.sinica.edu.tw/papers/strength-estimator.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7a3893ce-e6f2-4528-aa3b-649e3c4be09dRelated papers
- Human-Aligned Chess With a Bit of SearchYiming Zhang, Athul Paul Jacob, Vivian Lai, Daniel Fried et al.ICLR 2025 · 1 citation
- Split Moves for Monte-Carlo Tree SearchJakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz et al.AAAI 2022 · 1 citation
- Mastering Board Games by External and Internal Planning with Language ModelsJohn Schultz, Jakub Adámek, Matej Jusup, Marc Lanctot et al.ICML 2025
- SeeA*: Efficient Exploration-Enhanced A* Search by Selective SamplingDengwei Zhao, Shikui Tu, Lei XuNeurIPS 2024 · 4 citations
- Accelerating Monte Carlo Tree Search with Probability Tree State AbstractionYangqing Fu, Ming Sun, Buqing Nie, Yue GaoNeurIPS 2023 · 5 citations
