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: | Ngoh, Guang Wei |
---|---|
Other Authors: | He Ying |
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 |
Similar Items
-
Deep learning and computer chess (part 2)
by: Seah, Yu Liang
Published: (2022) -
Deep learning and computer chess (part 2)
by: Lee, Zachary Varella Zheyu,
Published: (2023) -
Deep learning and computer chess (part 2)
by: Xu, Shiguang
Published: (2022) -
Deep learning and computer chess (part 1)
by: Ngui, Seng Yang
Published: (2020) -
Deep learning and computer chess (part 1)
by: Pereddy Vijai Krishna Reddy
Published: (2020)