{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:22Z","timestamp":1742913202545,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279916"},{"type":"electronic","value":"9783319279923"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27992-3_11","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"113-121","source":"Crossref","is-referenced-by-count":2,"title":["First Player\u2019s Cannot-Lose Strategies for Cylinder-Infinite-Connect-Four with Widths\u00a02\u00a0and\u00a06"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Yamaguchi","sequence":"first","affiliation":[]},{"given":"Todd W.","family":"Neller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-319-09165-5_14","volume-title":"Computer and Games","author":"Y Yamaguchi","year":"2014","unstructured":"Yamaguchi, Y., Tanaka, T., Yamaguchi, K.: Cylinder-infinite-connect-four except for widths 2, 6, and 11 is solved: draw. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 163\u2013174. Springer, Heidelberg (2014)"},{"key":"11_CR2","first-page":"134","volume-title":"Heuristic Programming in Artificial Intelligence, The first Computer Olympiad","author":"JD Allen","year":"1989","unstructured":"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\u2013135. Ellis Horwood, Chinchester (1989)"},{"key":"11_CR3","volume-title":"The Complete Book of Connect 4: History, Strategy, Puzzles","author":"JD Allen","year":"2010","unstructured":"Allen, J.D.: The Complete Book of Connect 4: History, Strategy, Puzzles. Sterling Publishing Co., Inc., New York (2010)"},{"doi-asserted-by":"crossref","unstructured":"Allis, L.V.: A Knowledge-Based Approach to Connect-Four. The game is solved: White wins, Master\u2019s thesis, Vrije Universiteit (1988)","key":"11_CR4","DOI":"10.3233\/ICG-1988-11410"},{"unstructured":"Mahalko, E.M.: A Possible Win Strategy for the Game of Qubic, Computer Science Master\u2019s thesis, Brigham Young University (1976)","key":"11_CR5"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.2307\/2689613","volume":"53","author":"O Patashnik","year":"1980","unstructured":"Patashnik, O.: Qubic: \n                    \n                      \n                    \n                    $$4 \\times 4 \\times 4$$\n                   Tic-Tac-Toe. Math. Mag. 53, 202\u2013216 (1980)","journal-title":"Math. Mag."},{"unstructured":"Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence, Thesis, University of Limburg (1994)","key":"11_CR7"},{"unstructured":"God\u2019s Number is 20. \n                    http:\/\/www.cube20.org","key":"11_CR8"},{"issue":"2","key":"11_CR9","first-page":"110","volume":"31","author":"J Tromp","year":"2008","unstructured":"Tromp, J.: Solving connect-4 on medium board sizes. ACG 31(2), 110\u2013112 (2008)","journal-title":"ACG"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-31866-5_18","volume-title":"Advances in Computer Games","author":"Y Yamaguchi","year":"2012","unstructured":"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\u2013219. Springer, Heidelberg (2012)"},{"unstructured":"Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-Moku and Threat-Space Search, Report CS 93\u201302. Faculty of General Sciences, University of Limburg, Department of Computer Science (1993)","key":"11_CR11"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.3233\/ICG-2001-24104","volume":"24","author":"J Wagner","year":"2001","unstructured":"Wagner, J., Virag, I.: Note solving renju. ICGA J. 24, 30\u201335 (2001)","journal-title":"ICGA J."},{"unstructured":"Harary, F., Harborth, H.: Achievement and avoidance games with triangular animals. J. Recreational Math. 18(2), 110\u2013115 (1985\u20131986)","key":"11_CR13"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1038\/scientificamerican0479-18","volume":"240","author":"M Gardner","year":"1979","unstructured":"Gardner, M.: Mathematical games. Sci. Amer. 240, 18\u201326 (1979)","journal-title":"Sci. Amer."},{"unstructured":"Halupczok, I., Puchta, J.C.S.: Achieving snaky integers. Electron. J. Comb. Number Theor. 7, G02 (2007)","key":"11_CR15"},{"key":"11_CR16","first-page":"79","volume":"2","author":"F Harary","year":"1993","unstructured":"Harary, F.: Is snaky a winner? Geombinatorics 2, 79\u201382 (1993)","journal-title":"Geombinatorics"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"575","DOI":"10.2307\/2321433","volume":"87","author":"TGL Zetters","year":"1980","unstructured":"Zetters, T.G.L.: 8 (or More) in a row. Am. Math. Mon. 87, 575\u2013576 (1980)","journal-title":"Am. Math. Mon."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0012-365X(99)00204-6","volume":"212","author":"JP Bode","year":"2000","unstructured":"Bode, J.P., Harborth, H.: Hexagonal polyomino achievement. Discrete Math. 212, 5\u201318 (2000)","journal-title":"Discrete Math."},{"unstructured":"Inagaki, K., Matsuura, A.: Winning strategies for hexagonal polyomino achievement. In: 12th WSEAS International Conference on Applied Mathematics, pp. 252\u2013259 (2007)","key":"11_CR19"},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCIAIG.2010.2060262","volume":"2","author":"IC Wu","year":"2010","unstructured":"Wu, I.C.: Relevance-zone-oriented proof search for connect 6. IEEE Trans. Intell. AI Games (SCI) 2(3), 191\u2013207 (2010)","journal-title":"IEEE Trans. Intell. AI Games (SCI)"},{"unstructured":"Geselowitz, L.: Freed Go. \n                    http:\/\/www.leweyg.com\/lc\/freedgo.html","key":"11_CR21"},{"unstructured":"TetroSpin Free APK 1.2. \n                    http:\/\/m.downloadatoz.com\/apps\/emre.android.tetrominofree,158809.html","key":"11_CR22"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27992-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:26:55Z","timestamp":1559348815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}