BoxOff is NP-Complete

被引：0

作者：

Hayward, Ryan ^{[1
]}

Hearn, Robert ^{[1
]}

Jamshidian, Mahya ^{[1
]}

机构：

[1] Univ Alberta, Edmonton, AB T6G 2R3, Canada

来源：

ADVANCES IN COMPUTER GAMES, ACG 2021 | 2022年 / 13262卷

关键词：

BoxOff puzzle; NP-Complete; Satisfiability;

D O I：

10.1007/978-3-031-11488-5_11

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

BoxOff is a one-player game invented by Steven Meyers: a rectangular board is covered with colored stones; a legal move is to remove two same-colored stones from opposite corners of an otherwise empty rectangle. Removing all stones wins the game. We show that it can be hard to determine whether a BoxOff puzzle is winnable: by reducing from Boolean Satisfiability, we show that BoxOff is NP-complete, even when only four colors are used.

引用

页码：118 / 127

页数：10

共 50 条

[1] Shellability is NP-complete
Goaoc, Xavier
Patak, Pavel
Patakova, Zuzana
Tancer, Martin
Wagner, Uli
[J]. JOURNAL OF THE ACM, 2019, 66 (03)
[2] Hashiwokakero is NP-complete
Andersson, Daniel
[J]. INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
[3] Minesweeper is NP-complete
Richard Kaye
[J]. The Mathematical Intelligencer, 2000, 22 : 9 - 15
[4] Rikudo is NP-complete
Viet-Ha Nguyen
Perrot, Kevin
[J]. THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
[5] Minesweeper is NP-complete
Kaye, R
[J]. MATHEMATICAL INTELLIGENCER, 2000, 22 (02): : 9 - 15
[6] BLOCKSUM is NP-Complete
Haraguchi, Kazuya
Ono, Hirotaka
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
[7] HIROIMONO is NP-Complete
Andersson, Daniel
[J]. Fun with Algorithms, Proceedings, 2007, 4475 : 30 - 39
[8] Tipover is NP-complete
Robert A. Hearn
[J]. The Mathematical Intelligencer, 2006, 28 : 10 - 14
[9] TETRAVEX is NP-complete
Takenaga, Yasuhiko
Walsh, Toby
[J]. INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 171 - 174
[10] TipOver is NP-complete
Hearn, Robert A.
[J]. MATHEMATICAL INTELLIGENCER, 2006, 28 (03): : 10 - 14

← 1 2 3 4 5 →