2015
DOI: 10.1587/transinf.2014fcl0001
|View full text |Cite
|
Sign up to set email alerts
|

Computational Complexity of Generalized Golf Solitaire

Abstract: SUMMARYGolf is a solitaire game, where the object is to move all cards from a 5 × 8 rectangular layout of cards to the foundation. A top card in each column may be moved to the foundation if it is either one rank higher or lower than the top card of the foundation. If no cards may be moved, then the top card of the stock may be moved to the foundation. We prove that the generalized version of Golf Solitaire is NP-complete.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
(12 reference statements)
0
0
0
Order By: Relevance
“…After the publication of this book, a lot of Nikoli's pencil puzzles were shown to be NP-complete. Recently, Double Choco [3], Five Cells and Tilepaint [5], Sukoro [6], Tatamibari [2] Yajisan-Kazusan and Stained Glass [7] were shown to be NP-complete. for each 𝑐 𝑗 ∈ 𝐶 and (ii) the graph 𝐺 = (𝑉, 𝐸), defined by 𝑉 = 𝑈 ∪ 𝐶 and 𝐸 = { (𝑥 𝑖 , 𝑐 𝑗 ) | 𝑥 𝑖 ∈ 𝑐 𝑗 ∈ 𝐶 }, is planar.…”
Section: Introductionmentioning
confidence: 99%
“…After the publication of this book, a lot of Nikoli's pencil puzzles were shown to be NP-complete. Recently, Double Choco [3], Five Cells and Tilepaint [5], Sukoro [6], Tatamibari [2] Yajisan-Kazusan and Stained Glass [7] were shown to be NP-complete. for each 𝑐 𝑗 ∈ 𝐶 and (ii) the graph 𝐺 = (𝑉, 𝐸), defined by 𝑉 = 𝑈 ∪ 𝐶 and 𝐸 = { (𝑥 𝑖 , 𝑐 𝑗 ) | 𝑥 𝑖 ∈ 𝑐 𝑗 ∈ 𝐶 }, is planar.…”
Section: Introductionmentioning
confidence: 99%