{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T06:02:58Z","timestamp":1766210578170,"version":"3.48.0"},"reference-count":8,"publisher":"Information Processing Society of Japan","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2025]]},"DOI":"10.2197\/ipsjjip.33.1077","type":"journal-article","created":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T22:09:18Z","timestamp":1765750158000},"page":"1077-1091","source":"Crossref","is-referenced-by-count":0,"title":["Hardness Results on Generalized Puyo Puyo"],"prefix":"10.2197","volume":"33","author":[{"given":"Hiroshi","family":"Eto","sequence":"first","affiliation":[{"name":"School of Computer Science and Systems Engineering, Kyushu Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hironori","family":"Kiya","sequence":"additional","affiliation":[{"name":"Department of Core Informatics, Osaka Metropolitan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[{"name":"Department of Mathematical Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1012","reference":[{"key":"1","unstructured":"[1] Arabu209: 17-chain (2022)."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Asif, S., Coulombe, M., Demaine, E.D., Demaine, M.L., Hesterberg, A., Lynch, J. and Singhal, M.: Tetris is NP-hard even with O(1) Rows or Columns, <i>Journal of Information Processing<\/i>, Vol.28, pp.942-958 (online), DOI: 10.2197\/ipsjjip.28.942 (2020).","DOI":"10.2197\/ipsjjip.28.942"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Breukelaar, R., Demaine, E.D., Hohenberger, S., Hoogeboom, H.J., Kosters, W.A. and Liben-Nowell, D.: Tetris is hard, even to approximate, <i>Int. J. Comput. Geom. Appl.<\/i>, Vol.14, No.1-2, pp.41-68 (online), DOI: 10.1142\/S0218195904001354 (2004).","DOI":"10.1142\/S0218195904001354"},{"key":"4","unstructured":"[4] Garey, M.R. and Johnson, D.S.: <i>Computers and intractability<\/i>, Vol.174, freeman San Francisco (1979)."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Guala, L., Leucci, S. and Natale, E.: Bejeweled, Candy Crush and other match-three games are (NP-) hard, <i>2014 IEEE Conference on Computational Intelligence and Games<\/i>, pp.1-8, IEEE (2014).","DOI":"10.1109\/CIG.2014.6932866"},{"key":"6","unstructured":"[6] Kiba, Y., Muneshige, N. and Uejima, A.: Irosu to Ojama-Puyo wo seigenshita ippannka puyopuyo no rensasuhanteimondaino NP-kanzensei (in Japanese), <i>Abstracts of The Operations Research Society of Japan<\/i> (<i>Fall 2011<\/i>), pp.370-371, The Operations Research Society of Japan (2011)."},{"key":"7","unstructured":"[7] Matsukane, T. and Takenaga, Y.: NP-Completeness of Maximum Chain Problem on Puyopuyo, <i>IEICE Trans. Information and Systems D<\/i> (<i>Japanese edition<\/i>), Vol.J89-D, No.3, pp.405-413 (2006)."},{"key":"8","unstructured":"[8] Muta, H.: PUYOPUYO is NP-complete, <i>IEICE Technical Report<\/i>, COMP2005-14 (2005)."}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_1077\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T03:53:17Z","timestamp":1766202797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_1077\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":8,"journal-issue":{"issue":"0","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.33.1077","relation":{},"ISSN":["1882-6652"],"issn-type":[{"type":"electronic","value":"1882-6652"}],"subject":[],"published":{"date-parts":[[2025]]}}}