Change search
ReferencesLink to record
Permanent link

Direct link
Heuristics in MCTS-based Computer Go: Can heuristics improve the performance of MCTS-based computer go?
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The subject of computer Go is an active eld under AI and has achieved much attention in research. The current state of the art computer Go im-plementations uses a game tree search approach rather than advanced heuristics. This thesis aims to bridge these two approaches and combineMonte Carlo Tree Search with heuristics to deduce if any general results can be found. The results of the thesis indicate that the performance of a combined MCTS-heuristic approach correlates strongly with performance of the heuristic. Furthermore, MCTS can be used with any heuristic to improve its performance.1

Place, publisher, year, edition, pages
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-157529OAI: diva2:770405
Available from: 2014-12-11 Created: 2014-12-10 Last updated: 2014-12-11Bibliographically approved

Open Access in DiVA

fulltext(384 kB)155 downloads
File information
File name FULLTEXT01.pdfFile size 384 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 155 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 169 hits
ReferencesLink to record
Permanent link

Direct link