2000 character limit reached
Solitaire Chess is NP-complete (1501.06398v1)
Published 26 Jan 2015 in cs.CC and math.CO
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.