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:
書目詳細資料
主要作者: Ngoh, Guang Wei
其他作者: He Ying
格式: Final Year Project
語言:English
出版: Nanyang Technological University 2020
主題:
在線閱讀:https://hdl.handle.net/10356/144972
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!