National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Heuristics for the Scotland Yard Board Game
Cejpek, Michal ; Zbořil, František (referee) ; Zbořil, František (advisor)
This thesis explores the possibility of using deep and reinforcement learning algorithms to solve problems with incomplete information. The main algorithm under investigation is PPO – Proximal Policy Optimization. In order to test the suitability of the PPO algorithm, a simplified implementation of the Scotland Yard game was created as well as an environment for training and testing the algorithms. From performed experiments, it emerged that the PPO algorithm is very suitable for solving problems with incomplete information. The agents very quickly gained a sense of the game’s goals and built appropriate strategies to meet those goals through training.

See also: similar author names
4 Cejpek, Martin
4 Cejpek, Miroslav
Interested in being notified about new results for this query?
Subscribe to the RSS feed.