Deep learning and computer chess (part 2)
Monte Carlo Tree Search (MCTS) is a probabilistic search algorithm that uses random simulations to build a search tree. It is computationally expensive, and the quality of the results correlate with the effectiveness of the algorithm. This goal of this project was to develop enhancements to improve...
Saved in:
Main Author: | Xu, Shiguang |
---|---|
Other Authors: | He Ying |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/156528 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Deep learning for computer chess (part 1)
by: Arora, Manav
Published: (2022) -
Deep learning and computer chess (part 1)
by: Pereddy Vijai Krishna Reddy
Published: (2020) -
Deep learning and computer chess
by: Low, Benedict Yu
Published: (2021) -
Using deep neural networks for chess position evaluation
by: Phang, Benito Yan Feng
Published: (2023) -
Deep learning and computer chess (part 2)
by: Seah, Yu Liang
Published: (2022)