Abstract
Linear Go is the game of Go played on the 1 \(\times \) \(n\) board. Positional Linear Go is Linear Go with a rule set that uses positional superko. We explore game-theoretic properties of Positional Linear Go, and incorporate them into a solver based on MTD(f) search, solving states on boards up to 1 \(\times \) \(9\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We wanted a rule set that is concise, precise, and—like Asian Go—has no suicide.
References
Moyer, C.: How Google’s AlphaGo beat a Go world champion. Atlantic (2016)
Silver, D., Huang, A., Maddison, C.J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., Dieleman, S., Grewe, D., Nham, J., Kalchbrenner, N., Sutskever, I., Lillicrap, T., Leach, M., Kavukcuoglu, K., Graepel, T., Hassabis, D.: Mastering the game of Go with deep neural networks and tree search. Nature 529(7587), 484–489 (2016)
van der Werf, E.: \(5\times 5\) Go is solved (2002). http://erikvanderwerf.tengen.nl/5x5/5x5solved.html. Accessed 01 Jan 2017
van der Werf, E.C., van den Herik, H.J., Uiterwijk, J.W.: Solving Go on small boards. ICGA J. 26, 92–107 (2003)
van der Werf, E.: AI techniques for the game of Go. Ph.D. thesis, Maastricht University (2004)
van der Werf, E.: First player scores for \({M}\times {N}\) Go (2009). http://erikvanderwerf.tengen.nl/mxngo.html. Accessed 01 Jan 2017
van der Werf, E.C., Winands, M.H.M.: Solving Go for rectangular boards. ICGA J. 32, 77–88 (2009)
Tromp, J.: The game of Go aka Weiqi in Chinese, Baduk in Korean. http://tromp.github.io/go.html. Accessed 01 Jan 2017
Tromp, J.: Number of legal Go positions (2016). https://tromp.github.io/go/legal.html. Accessed 01 Jan 2017
Müller, M.: Playing it safe: recognizing secure territories in computer Go by using static rules and search. In: Proceedings of Game Programming Workshop, Computer Shogi Association (1997)
Chess Programming Wiki: Aspiration windows (2017). https://chessprogramming.wikispaces.com/Aspiration+Windows. Accessed 01 Jan 2017
Shams, R., Kaindl, H., Horacek, H.: Using aspiration windows for minimax algorithms. In: Proceedings of IJCAI 1991, pp. 192–197. Morgan Kaufmann Publishers (1991)
Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87, 255–293 (1996)
Kishimoto, A., Müller, M.: A general solution to the graph history interaction problem. In: 19th National Conference on Articial Intelligence, AAAI, pp. 644–649 (2004)
Kishimoto, A.: Correct and efficient search algorithms in the presence of repetitions. Ph.D. thesis, University of Alberta (2005)
Tromp, J.: Solving \(2\,\times \,2\) Go (2016). https://tromp.github.io/java/go/twoxtwo.html. Accessed 01 Jan 2017
Acknowledgments
We are grateful to Martin Müller, Erik van der Werf, Victor Allis, and the referees for helpful comments, and to the NSERC Discovery Grants Program for research funding.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Weninger, N., Hayward, R. (2017). Exploring Positional Linear Go. In: Winands, M., van den Herik, H., Kosters, W. (eds) Advances in Computer Games. ACG 2017. Lecture Notes in Computer Science(), vol 10664. Springer, Cham. https://doi.org/10.1007/978-3-319-71649-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-71649-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71648-0
Online ISBN: 978-3-319-71649-7
eBook Packages: Computer ScienceComputer Science (R0)