Solitaire Chess is NP-complete
Computational Complexity
2015-01-27 v1 Combinatorics
Abstract
"Solitaire Chess" is a logic puzzle published by Thinkfun, that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but one using only moves that are allowed in chess. Moreover, in each move one piece has to be captured. We prove that deciding if a given instance of Solitaire Chess is solvable is NP-complete.
Cite
@article{arxiv.1501.06398,
title = {Solitaire Chess is NP-complete},
author = {Jens Maßberg},
journal= {arXiv preprint arXiv:1501.06398},
year = {2015}
}
Comments
7 pages