Chess is hard even for a single player

N. R. Aravind, Neeldhara Misra, Harshil Mittal

Abstract: Highlights•We formalize computational questions based on the game of Solo Chess.•We study special cases of Solo Chess: for instance, by restricting the dimensions of the board and/or the nature of pieces involved in the game.•We study generalized variants of Solo Chess: for instance, by allowing for each piece having a designated number of captures remaining. Note that in the traditional game each piece can capture at most twice.