{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:32Z","timestamp":1759637852620,"version":"3.40.5"},"reference-count":17,"publisher":"Elsevier BV","issue":"35","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,10,11]],"date-time":"2015-10-11T00:00:00Z","timestamp":1444521600000},"content-version":"vor","delay-in-days":1532,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1016\/j.tcs.2011.04.033","type":"journal-article","created":{"date-parts":[[2011,5,8]],"date-time":"2011-05-08T00:45:15Z","timestamp":1304815515000},"page":"4558-4569","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Drawn <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k<\/mml:mi><\/mml:math>-in-a-row games"],"prefix":"10.1016","volume":"412","author":[{"given":"Sheng-Hao","family":"Chiang","sequence":"first","affiliation":[]},{"given":"I-Chen","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ping-Hung","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.04.033_br000005","unstructured":"L.V. Allis, Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg, Maastricht, the Netherlands, 1994."},{"key":"10.1016\/j.tcs.2011.04.033_br000010","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1111\/j.1467-8640.1996.tb00250.x","article-title":"Go-moku solved by new search techniques","volume":"12","author":"Allis","year":"1996","journal-title":"Computational Intelligence"},{"key":"10.1016\/j.tcs.2011.04.033_br000015","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0097-3165(81)90001-7","article-title":"On positional games","volume":"30","author":"Beck","year":"1981","journal-title":"Journal of Combinatorial Theory Series A"},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/j.tcs.2011.04.033_br000020"},{"year":"2003","series-title":"Winning Ways for your Mathematical Plays, vol. 3","author":"Berlekamp","key":"10.1016\/j.tcs.2011.04.033_br000025"},{"key":"10.1016\/j.tcs.2011.04.033_br000030","unstructured":"S.-H. Chiang, I-C. Wu, P.-H. Lin, On drawn k-in-a-row games, in: The 12th Advances in Computer Games Conference, ACG12, Pamplona, Spain, May 2009."},{"key":"10.1016\/j.tcs.2011.04.033_br000035","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(90)90282-M","article-title":"On a combinatorial game with an application to Go-moku","volume":"29","author":"Csirmaz","year":"1980","journal-title":"Discrete Mathematics"},{"year":"2000","series-title":"Graph Theory","author":"Diestel","key":"10.1016\/j.tcs.2011.04.033_br000040"},{"key":"10.1016\/j.tcs.2011.04.033_br000045","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0004-3702(01)00152-7","article-title":"Games solved: now and in the future","volume":"134","author":"van den Herik","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.tcs.2011.04.033_br000050","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.tcs.2007.05.031","article-title":"On the fairness and complexity of generalized k-in-a-row games","volume":"385","author":"Hsieh","year":"2007","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2011.04.033_br000055","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/S0304-3975(01)00115-3","article-title":"The accelerated k-in-a-row game","volume":"270","author":"Pluhar","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2011.04.033_br000060","unstructured":"I-C. Wu, D.-Y. Huang, A new family of k-in-a-row games, in: The 11th Advances in Computer Games, ACG11, Conference, Taipei, Taiwan, 2005."},{"issue":"4","key":"10.1016\/j.tcs.2011.04.033_br000065","first-page":"234","article-title":"Connect6","volume":"28","author":"Wu","year":"2006","journal-title":"ICGA Journal"},{"key":"10.1016\/j.tcs.2011.04.033_br000070","unstructured":"I-C. Wu, P.-H. Lin, Search tree for drawn Connect(11, 2). Available at http:\/\/www.connect6.org\/articles\/drawn-connect-games\/."},{"issue":"3","key":"10.1016\/j.tcs.2011.04.033_br000075","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TCIAIG.2010.2060262","article-title":"Relevance-zone-oriented proof search for Connect6","volume":"2","author":"Wu","year":"2010","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"key":"10.1016\/j.tcs.2011.04.033_br000080","unstructured":"I-C. Wu, H.-H. Lin, P.-H. Lin, D.-J. Sun, Y.-C. Chan, B.-T. Chen, Job-Level Proof-Number Search for Connect6. in: The International Conference on Computers and Games 2010, CG2010, Kanazawa, Japan, September 2010."},{"key":"10.1016\/j.tcs.2011.04.033_br000085","first-page":"575","article-title":"8(or more) in a row","volume":"87","author":"Zetters","year":"1980","journal-title":"American Mathematical Monthly"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511003422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511003422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:06:13Z","timestamp":1660269973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511003422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":17,"journal-issue":{"issue":"35","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["S0304397511003422"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.04.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2011,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Drawn -in-a-row games","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2011.04.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2011 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}