Generalized Hi-Q is NP-Complete

• UEHARA, Ryuhei

• IWATA, Shigeki

抄録

This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extended to the size n × n, an initial position of the puzzle is given, and a place is given on which only one token is finally placed. The complexity of the generalized Hi-Q is proved NP-complete.

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/4709

収録刊行物

• The TRANSACTIONS of the IEICE

  The TRANSACTIONS of the IEICE E73-E (2), 270-273, 1990-02-20

  電子情報通信学会

詳細情報

• CRID: 1050282812513871744
• NII論文ID: 120000861596
• NII書誌ID: AN10071294
• Web Site: http://hdl.handle.net/10119/4709
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles