Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Single State Agents for Computer Go
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]

When it comes to Computer Go agents, the most common strategy is to traverse the game state tree to find as close to optimal solutions as possible. The goal is to sacrifice performance for a higher result accuracy. Going in the other direction — sacrificing accuracy for performance — is a less explored approach to the problem.In this report, a method combining the Copy-Move algorithm from the field of image forensics and computer vision with some pattern-based Computer Go digestion methods is tested against a large database of Go games. The partial soundness and fitness of the strategy is evaluated against a distinct subset of games by evaluating the predictability of human moves. The result is that while pattern-based Go strategies are still clearly inferior to game-tree search algorithms, they sometimes yield promising results that can be used to adjust the pruning approaches typically employed in tree traversal algorithms.1

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

Open Access in DiVA

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

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 50 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: 32 hits
ReferencesLink to record
Permanent link

Direct link