Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Go Go! - Evaluating Different Variants of Monte Carlo Tree Search for Playing 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]

Monte Carlo Tree Search (MCTS) is a Go algorithm that is used in many recent strong go playing agents. In this report we test and compare different algorithms related to Monte Carlo simulation, seeing how well they do against each other under different time constraints on consumer hardware. This is done with our own implementation of Go rules and algorithms written in Java. The All Moves As First (AMAF) algorithmhad the best performance in the performed tests.

Place, publisher, year, edition, pages
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-157520OAI: oai:DiVA.org:kth-157520DiVA: diva2:770360
Examiners
Available from: 2014-12-11 Created: 2014-12-10 Last updated: 2014-12-11Bibliographically approved

Open Access in DiVA

fulltext(432 kB)