Please use this identifier to cite or link to this item:
Title: Deep learning and computer chess (part 2)
Authors: Ngoh, Guang Wei
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Publisher: Nanyang Technological University
Project: SCSE19-0594
Abstract: 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 algorithm in chess engines as well as the various ways MCTS can be improved beyond the base algorithm through the use of a static board state evaluation function. Methods such as early playout termination, implicit minimax backups, MCTS-Solver, as well as a few novel methods were implemented with their results being analyzed and discussed. The implemented methods proved to be a promising step in the right direction in developing a MCTS chess engine that can rival and potentially outperform chess engines that use deterministic algorithms with further development.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Deep Learning and Computer Chess (Part 2).pdf
  Restricted Access
2.27 MBAdobe PDFView/Open

Page view(s)

Updated on Jan 22, 2022

Download(s) 50

Updated on Jan 22, 2022

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.