Investigating Reinforcement Learning and Evolutionary Computation for Games with Stochasticity and Incomplete Information

This thesis presents an application of reinforcement learning and evolutionary computation for solving complex games with incomplete information and stochasticity. Although there has been significant recent progress on AI game players, traditional deep reinforcement learning methods have mainly shown success in games with simpler properties. In this thesis, we evaluate two deep reinforcement learning methods: policy gradient and evolutionary strategies for training the neural network behind the AI players for Ticket to Ride, a complex strategic board game. By comparing AI players’ performance and policies with existing heuristics players, we show that the AI players learn well under both training algorithms. Furthermore, the results indicate that training the AI players under the complete information game environment has a positive influence on their performance under the incomplete information game environment as well.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2022

Author dc:creator

• Zhou, Xinhe

Advisor dc:contributor.advisor

• Hemberg, Erik

Statement dc:rights

• In Copyright - Educational Use Permitted
• Copyright MIT

Licence dc:rights.uri

• http://rightsstatements.org/page/InC-EDU/1.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/147529

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/147529