Generalized Hi-Q is NP-Complete

Ryuhei UEHARA; Shigeki IWATA

Copy

Ryuhei UEHARA, Shigeki IWATA, "Generalized Hi-Q is NP-Complete" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 2, pp. 270-273, February 1990, doi: .
Abstract: This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extended to the size nn, 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_2_270/_p

Copy

@ARTICLE{e73-e_2_270,
author={Ryuhei UEHARA, Shigeki IWATA, },
journal={IEICE TRANSACTIONS on transactions},
title={Generalized Hi-Q is NP-Complete},
year={1990},
volume={E73-E},
number={2},
pages={270-273},
abstract={This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extended to the size nn, 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.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Generalized Hi-Q is NP-Complete
T2 - IEICE TRANSACTIONS on transactions
SP - 270
EP - 273
AU - Ryuhei UEHARA
AU - Shigeki IWATA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1990
AB - This paper deals with a popular puzzle known as Hi-Q. The puzzle is generalized: the board is extended to the size nn, 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.
ER -

IEICE TRANSACTIONS on transactions