Deep learning and computer chess (part 2)
Monte Carlo Tree Search (MCTS) is a probabilistic algorithm that has gained traction in recent years. MCTS uses lightweight random simulations to selectively grow a game tree and has experienced success in domains with vast search spaces, such as chess. This project explores the usage of the MCTS...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/144972 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |