{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:45:25Z","timestamp":1743039925814,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_16","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"177-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Push-Pull Block Puzzles are Hard"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Isaac","family":"Grosof","sequence":"additional","affiliation":[]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"16_CR1","unstructured":"Abdelkader, A., Acharya, A., Dasler, P.: 2048 without new tiles is still hard. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 49. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Demaine, E.D., Guo, A., Viglietta, G.: Classic nintendo games are (NP-)hard. In: Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Italy, 1\u20133 July 2014","DOI":"10.1007\/978-3-319-07890-8_4"},{"key":"16_CR3","unstructured":"Culberson, J.C.: Sokoban is PSPACE-complete. In: Proceedings International Conference on Fun with Algorithms (FUN 1998), pp. 65\u201376. Carleton Scientific, Waterloo, Ontario, Canada, June 1998"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Demaine, M.L., O\u2019Rourke, J.: PushPush and Push-1 are NP-hard in 2D. In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG 2000), pp. 211\u2013219. Fredericton, New Brunswick, Canada, 16\u201318 August 2000","DOI":"10.1016\/S0925-7721(99)00056-5"},{"key":"16_CR5","unstructured":"Demaine, E.D., Hearn, R.A., Hoffmann, M.: Push-2-F is PSPACE-complete. In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 31\u201335. Lethbridge, Alberta, Canada, 12\u201314 August 2002"},{"key":"16_CR6","unstructured":"Demaine, E.D., Hoffmann, M.: Pushing blocks is NP-complete for noncrossing solution paths. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), pp. 65\u201368. Waterloo, Ontario, Canada, 13\u201315 August 2001"},{"key":"16_CR7","unstructured":"Demaine, E.D., Hoffmann, M., Holzer, M.: PushPush-$$k$$ is PSPACE-complete. In: Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), pp. 159\u2013170. Isola d\u2019Elba, Italy, 26\u201328 May 2004"},{"key":"16_CR8","unstructured":"Dhagat, A., O\u2019Rourke, J.: Motion planning amidst movable square blocks. In: Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG 1992) (1992)"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-7721(99)00017-6","volume":"13","author":"D Dor","year":"1999","unstructured":"Dor, D., Zwick, U.: SOKOBAN and other motion planning problems. Comput. Geom. 13(4), 215\u2013228 (1999)","journal-title":"Comput. Geom."},{"issue":"1\u20132","key":"16_CR10","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/S0304-3975(01)00173-6","volume":"270","author":"GW Flake","year":"2002","unstructured":"Flake, G.W., Baum, E.B.: Rush hour is PSPACE-complete, or why you should generously tip parking lot attendants. Theoret. Comput. Sci. 270(1\u20132), 895\u2013911 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York (1979)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Guala, L., Leucci, S., Natale, E.: Bejeweled, candy crush and other match-three games are (NP-) hard. In: IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932866"},{"issue":"1","key":"16_CR13","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. Theoret. Comput. Sci. 343(1), 72\u201396 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR14","unstructured":"Hoffman, M.: Push-* is NP-hard. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG 2000), Lethbridge, Alberta, Canada (2000)"},{"key":"16_CR15","unstructured":"Ratner, D., Warmuth, M.K.: Finding a shortest solution for the n $$\\times $$ n extension of the 15-PUZZLE is intractable. In: Proceedings of AAAI, pp. 168\u2013172 (1986)"},{"key":"16_CR16","unstructured":"Ritt, M.: Motion planning with pull moves. arXiv:1008.2952 (2010)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01530890","volume":"3","author":"G Wilfong","year":"1991","unstructured":"Wilfong, G.: Motion planning in the presence of movable obstacles. Ann. Math. Artif. Intell. 3(1), 131\u2013150 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR19","unstructured":"Zubaran, T., Ritt, M.: Agent motion planning with pull and push moves. In: Anais do VIII Encontro Nacional de Intelig\u00c3\u0142ncia Artificial (ENIA), Natal, July 2011"}],"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-57586-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:49:10Z","timestamp":1710341350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}