The Surakarta Bot Revealed

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

The board game surakarta has been played at the icga computer olympiad since 2007. In this paper the ideas behind the agent sia, which won the competition five times, are revealed. The paper describes its aß \alpha \beta -based variable-depth search mechanism. Search enhancements such as multi-cut forward pruning and realization probability search are shown to improve the agent considerably. Additionally, features of the static evaluation function are presented. Experimental results indicate that features, which reward distribution of the pieces and penalize pieces that clutter together, give a genuine improvement in the playing strength.
Original languageEnglish
Title of host publicationComputer Games
PublisherSpringer
Pages71-82
ISBN (Print)978-3-319-39401-5
DOIs
Publication statusPublished - 12 May 2016

Publication series

SeriesCommunications in Computer and Information Science
Volume614
ISSN1865-0929

Cite this

Winands, M. H. M. (2016). The Surakarta Bot Revealed. In Computer Games (pp. 71-82). [Chapter 6] Springer. Communications in Computer and Information Science, Vol.. 614 https://doi.org/10.1007/978-3-319-39402-2_6