HANANO Puzzle is NP-hard

Liu, ZW; Yang, C

Yang, C (reprint author), Sun Yat Sen Univ, Sch Math, Guangzhou 510275, Guangdong, Peoples R China.

INFORMATION PROCESSING LETTERS, 2019; 145 (): 6

Abstract

We show that the HANANO Puzzle, a side-viewed 2-dimensional combinatorial puzzle with gravity and colored blocks, is NP-hard. (C) 2019 Elsevier B.V. A......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索