PDF] Solitaire Chess is NP-complete

It is proved that deciding if a given instance of Solitaire Chess is solvable is NP-complete. "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.

I've made a ton of improvements to my custom 108 card multideck! (Details and links to get a copy in the comments!) : r/boardgames

Chess Cash Game App - Top, Best University in Jaipur, Rajasthan

Solitaire Chess Solver — Zachary Roberts-Weigert

How to play Chess - Solitaired

Checkmate by Royal Appointment - Chessable Blog

best selling in large quantity pure

strategy - Solitaire Chess - Puzzling Stack Exchange

Listen to Perpetual Chess Podcast podcast

pdf catalogue - Chess Direct Ltd

Chess life january 2013