The Influence of the Size of the Search Space on Learning to Play Chess using Deep Reinforcement Learning Algorithms
A. Hakim Zakuto (TU Delft - Electrical Engineering, Mathematics and Computer Science)
M.M. de Weerdt – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
G. Neustroev – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The current state-of-the-art solutions for playing Chess, are created using deep reinforcement learning. AlphaZero, the current world champion, uses ’policy networks’ and ’value network’ for selecting moves and evaluating positions respectively. However, the training of these networks are done using reinforcement learning from games of selfplay. There are many factors which determine the learning speed of reinforcement learning algorithms, where the size of the search space is a main one. In this research, we have tried to see the effect of the size of the search space on the time it takes the reinforcement learning agent to learn.