Paper
28 March 2023 Efficient reinforcement learning for reversi AI
Haoran Chen, Keqin Liu
Author Affiliations +
Proceedings Volume 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022); 125973Y (2023) https://doi.org/10.1117/12.2672198
Event: Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 2022, Nanjing, China
Abstract
Reversi (or Othello) is a simple and popular board game played on an eight-by-eight board. In the field of reinforcement learning, searching of the game tree of Reversi is widely studied as a classic problem, since it has a small board and thus a state space not too complex to analyze. Monte Carlo tree search (MCTS) is a heuristic search algorithm for decision tree search, which is often applied to the AI methods for board games, such as the application of AlphaGo in the field of Go games. We modify and apply the Monte Carlo tree search strategy to Reversi AI. Applying some engineering optimizations (such as multithreading), we achieve significant results with high time efficiency.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Haoran Chen and Keqin Liu "Efficient reinforcement learning for reversi AI", Proc. SPIE 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 125973Y (28 March 2023); https://doi.org/10.1117/12.2672198
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Monte Carlo methods

Artificial intelligence

Evolutionary algorithms

Computer simulations

Parallel computing

Computation time

Deep learning

RELATED CONTENT


Back to Top