{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:17Z","timestamp":1742911997297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_15","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"160-176","source":"Crossref","is-referenced-by-count":1,"title":["Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game"],"prefix":"10.1007","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[]},{"given":"Florian","family":"Jamain","sequence":"additional","affiliation":[]},{"given":"Abdallah","family":"Saffidine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2010.2067212","volume":"2","author":"B Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Monte Carlo tree search in Hex. IEEE Trans. Comput. Intell. AI Games 2(4), 251\u2013258 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-319-09165-5_15","volume-title":"Computer and Games","author":"\u00c9 Bonnet","year":"2014","unstructured":"Bonnet, \u00c9., Jamain, F., Saffidine, A.: Havannah and TwixT are PSPACE-complete. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 175\u2013186. Springer, Heidelberg (2014)"},{"key":"15_CR3","unstructured":"Bonnet, \u00c9., Jamain, F., Saffidine, A.: On the complexity of trick-taking card games. In: Rossi, F. (ed.) 23rd International Joint Conference on Artificial Intelligence (IJCAI), Beijing, China, August 2013, pp. 482\u2013488. AAAI Press (2013)"},{"key":"15_CR4","volume-title":"Connection Games: Variations on a Theme","author":"C Browne","year":"2005","unstructured":"Browne, C.: Connection Games: Variations on a Theme. A K Peters, Massachusetts (2005)"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1145\/321978.321989","volume":"23","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: A combinatorial problem which is complete in polynomial space. J. ACM (JACM) 23(4), 710\u2013719 (1976)","journal-title":"J. ACM (JACM)"},{"key":"15_CR6","unstructured":"Ewalds, T.: Playing and solving Havannah. Master\u2019s thesis, University of Alberta (2012)"},{"key":"15_CR7","unstructured":"Furtak, T., Kiyomi, M., Uno, T., Buro, M.: Generalized Amazons is PSPACE-complete. In: Kaelbling, L.P., Saffiotti, A. (eds.) 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 132\u2013137 (2005)"},{"key":"15_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters, USA (2009)"},{"key":"15_CR9","unstructured":"Henderson, P.T.: Playing and solving the game of Hex. Ph.D. thesis, University of Alberta, August 2010"},{"issue":"1\u20133","key":"15_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2007.05.031","volume":"385","author":"MY Hsieh","year":"2007","unstructured":"Hsieh, M.Y., Tsai, S.-C.: On the fairness and complexity of generalized-in-a-row games. Theor. Comput. Sci. 385(1\u20133), 88\u2013100 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig. Acta Informatica 15(2), 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR13","unstructured":"Steane, A.M.: Threat, support and dead edges in the Shannon game, October 2012"},{"key":"15_CR14","unstructured":"Steane, A.M.: Minimal and irreducible links in the Shannon game, January 2013"},{"key":"15_CR15","unstructured":"van Rijswijck, J.: Set colouring games. Ph.D. thesis, University of Alberta, October 2006"},{"key":"15_CR16","unstructured":"Yato, T.: On the NP-completeness of the Slither link puzzle. In: Notes of the 74th Meeting of IPSJ SIG ALgorithms, pp. 25\u201332 (2000)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"176","DOI":"10.3390\/a5020176","volume":"5","author":"R Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Saitoh, T., Kawahara, J., Tsuruma, K., Iwashita, H., Minato, S.-I.: Finding all solutions and instances of Numberlink and Slitherlink by ZDDs. Algorithms 5(2), 176\u2013213 (2012)","journal-title":"Algorithms"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T19:07:06Z","timestamp":1567451226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}