Skip to main content
SpringerLink
Log in
Book cover

Workshop on Computer Games

International Workshop on General Intelligence in Game-Playing Agents

CGW 2015, GIGA 2015: Computer Games pp 71–82Cite as

The Surakarta Bot Revealed

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 614))

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 \(\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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic. In: 1977 ACM Annual Conference Proceedings, pp. 466–473. ACM, New York (1977)

    Google Scholar 

  2. Björnsson, Y., Marsland, T.A.: Multi-cut alpha-beta pruning in game-tree search. Theoret. Comput. Sci. 252(1–2), 177–196 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Replacement schemes and two-level tables. ICCA J. 19(3), 175–180 (1996)

    Google Scholar 

  4. Chen, J.C., Wu, I.C., Tseng, W.J., Lin, B.H., Chang, C.H.: Job-Level Alpha-Beta Search. IEEE Trans. Comput. Intell. AI Games 7(1), 28–38 (2015)

    Article  Google Scholar 

  5. Gray, S.B.: Local properties of binary images in two dimensions. IEEE Trans. Comput. 20(5), 551–561 (1971)

    Article  MATH  Google Scholar 

  6. Handscomb, K.: Surakarta. Abstr. Games 4(1), 8 (2003)

    Google Scholar 

  7. Kaindl, H., Horacek, H., Wagner, M.: Selective search versus brute force. ICCA J. 9(3), 140–145 (1986)

    Google Scholar 

  8. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293–326 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Marsland, T.A., Björnsson, Y.: Variable-depth search. In: van den Herik, H.J., Monien, B. (eds.) Advances in Computer Games 9, pp. 9–24. Universiteit Maastricht, Maastricht (2001)

    Google Scholar 

  10. Marsland, T.: A review of game-tree pruning. ICCA J. 9(1), 3–19 (1986)

    Google Scholar 

  11. Schaeffer, J., Plaat, A.: New advances in alpha-beta searching. In: Proceedings of the 1996 ACM 24th Annual Conference on Computer Science, pp. 124–130. ACM, New York (1996)

    Google Scholar 

  12. Schrüfer, G.: A strategic quiescence search. ICCA J. 12(1), 3–9 (1989)

    Google Scholar 

  13. Tsuruoka, Y., Yokoyama, D., Chikayama, T.: Game-tree search algorithm based on realization probability. ICGA J. 25(3), 132–144 (2002)

    Google Scholar 

  14. Winands, M.H.M., Björnsson, Y.: Enhanced realization probability search. New Math. Nat. Comput. 4(3), 329–342 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M., van der Werf, E.C.D.: Enhanced forward pruning. Inf. Sci. 175(4), 315–329 (2005)

    Article  MathSciNet  Google Scholar 

  16. Winands, M.H.M., van der Werf, E.C.D., van den Herik, H.J., Uiterwijk, J.W.H.M.: The relative history heuristic. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 262–272. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Acknowledgments

Special thanks go to the anonymous referees whose comments helped to improve this paper.

Author information

Authors and Affiliations

  1. Games and AI Group, Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, The Netherlands

    Mark H. M. Winands

Authors
  1. Mark H. M. Winands
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mark H. M. Winands .

Editor information

Editors and Affiliations

  1. Université Paris-Dauphine, Paris, France

    Tristan Cazenave

  2. Maastricht University, Maastricht, The Netherlands

    Mark H.M. Winands

  3. Universität Bremen, Bremen, Bremen, Germany

    Stefan Edelkamp

  4. Reykjavik University, Reykjavik, Iceland

    Stephan Schiffel

  5. The University of New South Wales, Sydney, New South Wales, Australia

    Michael Thielscher

  6. New York University, Brooklyn, New York, USA

    Julian Togelius

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Winands, M.H.M. (2016). The Surakarta Bot Revealed. In: Cazenave, T., Winands, M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds) Computer Games. CGW GIGA 2015 2015. Communications in Computer and Information Science, vol 614. Springer, Cham. https://doi.org/10.1007/978-3-319-39402-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39402-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39401-5

  • Online ISBN: 978-3-319-39402-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation