Skip to main content

Dependency-Based Search for Connect6

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8427))

Abstract

Allis proposed dependency-based search (DBS) to solve Go-Moku, a kind of five-in-a-row game. DBS is critical for threat space search (TSS) when there are many independent or nearly independent TSS areas. Similarly, DBS is also important for the game Connect6, a kind of six-in-a-row game with two pieces per move. Unfortunately, the rule that two pieces are played per move in Connect6 makes DBS extremely difficult to apply to Connect6 programs. This paper is the first attempt to apply DBS to Connect6 programs. The targeted program is NCTU6, which won Connect6 tournaments in the Computer Olympiad twice and defeated many professional players in Man-Machine Connect6 championships. The experimental results show that DBS yields a speedup factor of 4.12 on average, and up to 50 for some hard positions.

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

Buying options

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

Notes

  1. 1.

    Practically, stones are placed on empty intersections of Renju or Go boards. In this paper, when we say squares, we mean intersections.

  2. 2.

    In actual implementation for the zone \( Z^{*} \left( {M_{a} } \right) \), all lines centered on \( P(M_{a}^{A} ) \) are not longer than 6 in all directions. Moreover, the lines are shortened when encountering opponent pieces. The zone is denoted by \( Z^{*} \), since these lines form a star-like shape from the attacking pieces.

References

  1. Allis, L.V.: Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands (1994)

    Google Scholar 

  2. Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-Moku solved by new search techniques. Comput. Intell. 12, 7–23 (1996)

    Article  Google Scholar 

  3. van den Herik, H.J., Uiterwijk, J.W.H.M., Rijswijck, J.V.: Games solved: now and in the future. Artif. Intell. 134, 277–311 (2002)

    Article  MATH  Google Scholar 

  4. ICGA (International Computer Games Association). http://ticc.uvt.nl/icga/

  5. Lin, H.-H., Sun, D.-J., Wu, I.-C., Yen, S.-J.: The 2010 TAAI computer-game tournaments. ICGA J. 34(1), 51–55 (2011)

    Google Scholar 

  6. Lin, P.-H., Wu, I.-C.: NCTU6 wins in the Man-Machine Connect6 championship 2009. ICGA J. (SCI) 32(4), 230–233 (2009)

    Google Scholar 

  7. Little Golem website. http://www.littlegolem.net/

  8. Renju International Federation: The International Rules of Renju. http://www.renju.net/study/rifrules.php

  9. Taiwan Connect6 Association: Connect6 Homepage. http://www.connect6.org/

  10. TCGA Association: TCGA Computer Game Tournaments. http://tcga.ndhu.edu.tw/TCGA2011/

  11. Allis, Private Communication (2012)

    Google Scholar 

  12. Thomsen, T.: Lambda-search in game trees - with application to Go. ICGA J. 23(4), 203–217 (2000)

    Google Scholar 

  13. Wu, I.-C., Huang, D.-Y., Chang, H.-C.: Connect6. ICGA J. 28(4), 234–242 (2006)

    Google Scholar 

  14. Wu, I.-C., Huang, D.-Y.: A new family of k-in-a-row games. In: The 11th Advances in Computer Games Conference (ACG’11), pp. 180–194, Taipei, Taiwan, (2005)

    Google Scholar 

  15. Wu, I.-C., Lin, P.-H.: NCTU6-Lite wins Connect6 tournament. ICGA J. 31(4), 240–243 (2008)

    Google Scholar 

  16. Wu, I.-C., Lin, P.-H.: Relevance-Zone-Oriented proof search for Connect6. IEEE Trans. Comput. Intell. AI Games (SCI) 2(3), pp. 191–207 (2010)

    Google Scholar 

  17. Wu, I.-C., Yen, S.-J.: NCTU6 wins Connect6 tournament. ICGA J. 29(3), 157–158 (2006)

    Google Scholar 

  18. Yen, S.-J., Yang, J.-K.: 2-Stage Monte Carlo tree search for Connect6. IEEE Trans. Comput. Intell. AI Games (SCI) 3(2), pp. 100–118, ISSN: 1943–068X, (2011). doi:10.1109/TCIAIG.2011.2134097

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank the National Science Council of the Republic of China (Taiwan) for financial support of this research under contract numbers NSC 97-2221-E-009-126-MY3, NSC 99-2221-E-009-102-MY3 and NSC 99-2221-E-009-104-MY3.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I-Chen Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Wu, IC., Kang, HH., Lin, HH., Lin, PH., Wei, TH., Chang, CM. (2014). Dependency-Based Search for Connect6. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09165-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09164-8

  • Online ISBN: 978-3-319-09165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics