Skip to main content

Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw

  • Conference paper
  • First Online:
Book cover Computers and Games (CG 2013)

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

Included in the following conference series:

Abstract

Cylinder-Infinite-Connect-Four is a variant of the Connect-Four game played on cylindrical boards of differing cyclic widths and infinite height. In this paper, we show strategies to avoid losing at Cylinder-Infinite-Connect-Four except for Widths 2, 6, and 11. If both players use the strategies, the game will be drawn. This result can also be used to show that Width-Limited-Infinite-Connect-Four is drawn for any width. We also show that Connect-Four of any size with passes allowed is drawn.

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

References

  1. Allen, J.D.: A note on the computer solution of Connect-Four. In: Levy, D.N.L., Beal, D.F. (eds.) Heuristic Programming in Artificial Intelligence, The First Computer Olympiad, pp. 134–135. Ellis Horwood, Chinchester (1989)

    Google Scholar 

  2. Allis, L.V.: A knowledge-based approach to Connect-Four. The game is solved: white wins. Master’s thesis, Vrije Universiteit (1988)

    Google Scholar 

  3. Beck, J.: Positional games. Comb. Probab. Comput. 14, 649–696 (2005)

    Article  MATH  Google Scholar 

  4. Gardner, M.: Mathematical games. Sci. Am. 240, 18–26 (1979)

    Article  Google Scholar 

  5. Geselowitz, L.: Freed Go. http://www.leweyg.com/lc/freedgo.html

  6. Halupczok, I., Puchta, J.C.S.: Achieving snaky. Integers: Electron. J. Comb. Number Theor. 7, G02 (2007)

    Google Scholar 

  7. Harary, F.: Is snaky a winner? Geombinatorics 2, 79–82 (1993)

    MATH  MathSciNet  Google Scholar 

  8. Harary, F., Harborth, H.: Achievement and avoidance games with triangular animals. J. Recreat. Math. 18(2), 110–115 (1985-1986)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. NAMCO, PAC-MAN. http://pacman.com

  11. Torus and Klein Bottle Games. http://www.math.ntnu.no/dundas/75060/TorusGames/TorusGames.html

  12. Tromp, J.: Solving Connect-4 on medium board sizes. ICGA J. 31(2), 110–112 (2008)

    Google Scholar 

  13. Yamaguchi, Y., Yamaguchi, K., Tanaka, T., Kaneko, T.: Infinite Connect-Four is solved: draw. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 208–219. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Yasda, H.: Hakotumi (Infinite-Connect-Four with Gravity). http://homepage3.nifty.com/yasda/dwnload/hako.htm

  15. Zetters, T.G.L.: 8 (or more) in a row. Am. Math. Monthly 87, 575–576 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

We are grateful to the reviewers for their valuable suggestions regarding Cylinder-Infinite-Connect-Four and passing.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoshiaki Yamaguchi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yamaguchi, Y., Tanaka, T., Yamaguchi, K. (2014). Cylinder-Infinite-Connect-Four Except for Widths 2, 6, and 11 Is Solved: Draw. 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_14

Download citation

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

  • 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