Skip to main content

Can We Infer Move Sequences in Go from Stone Arrangements?

  • Conference paper
  • First Online:
Advances in Computer Games (ACG 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14528))

Included in the following conference series:

  • 90 Accesses

Abstract

Inference commonly happens in our daily lives and is also a hot topic for AI research. In this paper, we infer move sequences in Go, i.e., the order in which moves are played, from stone arrangements on the board. We formulate the problem as likelihood maximization and employ a general optimization algorithm, simulated annealing, to solve it. Our experiments on professional and amateur games show that the proposed approach sometimes produces more natural move sequences than those played by humans.

This work was supported by JSPS KAKENHI Grant Numbers JP23K17021 and JP23K11381.

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    In some cases, players may intentionally play unexpected moves (e.g., to transpose to openings that are not well-studied so that the opponent may make mistakes). Such cases are not the inference targets in this paper.

  2. 2.

    https://sjeng.org/zero/best_v1.txt.zip from the Leela Zero project, https://github.com/leela-zero/leela-zero.

  3. 3.

    Professional: https://mega.co.nz/#!xFE2kTaK!Oj3_N9NpGmYVGTuka7Nc3T0HTmp3kKcXZR6p1Q7U5YU, amateur (1d): https://github.com/featurecat/go-dataset.

References

  1. Cui, L., Chen, J., He, W., Li, H., Guo, W., Su, Z.: Achieving approximate global optimization of truth inference for crowdsourcing microtasks. Data Sci. and Eng. 6(3), 294–309 (2021). https://doi.org/10.1007/s41019-021-00164-2

    Article  Google Scholar 

  2. Guindon, S., Gascuel, O.: A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Systematic Biol. 52(5), 696–704 (2003). https://doi.org/10.1080/10635150390235520

    Article  Google Scholar 

  3. Kang, D.C., Kim, H.J., Jung, K.H.: Automatic extraction of game record from TV Baduk program. In: The 7th International Conference on Advanced Communication Technology (ICACT 2005), pp. 1185–1188 (2005). https://doi.org/10.1109/icact.2005.246173

  4. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983). https://doi.org/10.1126/science.220.4598.671

    Article  MathSciNet  Google Scholar 

  5. McIlroy-Young, R., Sen, S., Kleinberg, J., Anderson, A.: Aligning superhuman AI with human behavior. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1677–1687 (2020). https://doi.org/10.1145/3394486.3403219

  6. McIlroy-Young, R., Wang, R., Sen, S., Kleinberg, J., Anderson, A.: Learning models of individual behavior in chess. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1253–1263 (2022). https://doi.org/10.1145/3534678.3539367

  7. Ogawa, T., Hsueh, C.H., Ikeda, K.: Improving the human-likeness of game AI’s moves by combining multiple prediction models. In: Proceedings of the 15th International Conference on Agents and Artificial Intelligence (ICAART 2023), pp. 931–939 (2023). https://doi.org/10.5220/0011804200003393

  8. Shiba, K., Furuya, T., Nishi, S., Mori, K.: Automatic Go-record system using image processing. IEEJ Trans. Electron. Inf. Syst. 126(8), 980–989 (2006). https://doi.org/10.1541/ieejeiss.126.980

  9. Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing System (NIPS 2017) (2017)

    Google Scholar 

  10. Wu, D.J.: Accelerating self-play learning in Go. In: The 34th AAAI Conference on Artificial Intelligence (AAAI-20). Workshop on Reinforcement Learning in Games (2020). https://arxiv.org/abs/1902.10565

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chu-Hsuan Hsueh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hsueh, CH., Ikeda, K. (2024). Can We Infer Move Sequences in Go from Stone Arrangements?. In: Hartisch, M., Hsueh, CH., Schaeffer, J. (eds) Advances in Computer Games. ACG 2023. Lecture Notes in Computer Science, vol 14528. Springer, Cham. https://doi.org/10.1007/978-3-031-54968-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-54968-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-54967-0

  • Online ISBN: 978-3-031-54968-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics