{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:38:46Z","timestamp":1764239926495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_30","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"403-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PSPACE-Completeness of Bloxorz and of Games with 2-Buttons"],"prefix":"10.1007","author":[{"given":"Tom C.","family":"van der Zanden","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"30_CR1","unstructured":"Bloxorz, DX Interactive. http:\/\/dxinteractive.com\/#!\/bloxorz"},{"key":"30_CR2","unstructured":"Ice Cube Caveman, Google Play Store. https:\/\/play.google.com\/store\/apps\/details?id=com.TwistedGames.Caveman"},{"key":"30_CR3","unstructured":"Ice Cube Caveman, iTunes App Store. https:\/\/itunes.apple.com\/app\/ice-cube-caveman\/id456179222?mt=8"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"van der Zanden, T.C., Bodlaender, H.L.: PSPACE-Completeness of Bloxorz and of Games with 2-Buttons arXiv:1411.5951 (2014)","DOI":"10.1007\/978-3-319-18173-8_30"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-30347-0_35","volume-title":"Fun with Algorithms","author":"G Viglietta","year":"2012","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it!. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 357\u2013367. Springer, Heidelberg (2012)"},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00224-013-9497-5","volume":"54","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Gaming Is a Hard Job, but Someone Has to Do It!. Theory Comput. Syst. 54(4), 595\u2013621 (2014)","journal-title":"Theory Comput. Syst."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-13122-6_22","volume-title":"Fun with Algorithms","author":"M Fori\u0161ek","year":"2010","unstructured":"Fori\u0161ek, M.: Computational complexity of two-dimensional platform games. In: Boldi, P. (ed.) FUN 2010. LNCS, vol. 6099, pp. 214\u2013227. Springer, Heidelberg (2010)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343, 72\u201396 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"719","DOI":"10.2197\/ipsjjip.20.719","volume":"20","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Buchin, M.: Rolling block mazes are PSPACE-complete. Journal of Information Processing 20(3), 719\u2013722 (2012)","journal-title":"Journal of Information Processing"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177\u2013192 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games Puzzles, and Computation. A K Peters\/CRC Press (2009)","DOI":"10.1201\/b10581"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM 55(4), article 17 (2008)","DOI":"10.1145\/1391289.1391291"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:59:07Z","timestamp":1676941147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}