Solvability of Peg Solitaire on Graphs is NP-Complete

被引：0
|
作者：
Ito, Kazushi [1 ]
Takenaga, Yasuhiko [1 ]
机构：
[1] Univ Electrocommun, Dept Comp & Net Engn, Chofu 1828585, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2023年 / E106D卷 / 06期
关键词：
key words; peg solitaire; puzzle; NP-completeness; graph;
D O I：
10.1587/transinf.2022EDP7092
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Peg solitaire is a single-player board game. The goal of the game is to remove all but one peg from the game board. Peg solitaire on graphs is a peg solitaire played on arbitrary graphs. A graph is called solvable if there exists some vertex s such that it is possible to remove all but one peg starting with sas the initial hole. In this paper, we prove that it is NP-complete to decide if a graph is solvable or not.
引用
收藏
页码：1111 / 1116
页数：6
相关论文
共 50 条
12345