|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/4709
|
| Title: | Generalized Hi-Q is NP-Complete |
| Authors: | UEHARA, Ryuhei
IWATA, Shigeki |
| Issue Date: | 1990-02-20 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | The TRANSACTIONS of the IEICE |
| Volume: | E73-E |
| Number: | 2 |
| Start page: | 270 |
| End page: | 273 |
| Abstract: | 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. |
| Rights: | Copyright (C)1990 IEICE. Ryuhei Uehara and Shigeki Iwata, The TRANSACTIONS of the IEICE, E73-E(2), 1990, 270-273. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/4709 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 3951.pdf | | 278Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
