Uniform-budget solo chess with only rooks or only knights is hard

Download PDF
Open Webpage

Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci

Published: 01 Jan 2025, Last Modified: 27 Sept 2025Theor. Comput. Sci. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We study the Solo-Chess problem [Aravind et al.] when all piece budgets are uniform.•We show that Solo-Chess is NP-Hard even when only rooks with budget 2 are present.•We show that Uniform-Budget Solo-Chess is NP-Hard even when only knights are present.•The above results answer two problems left open by [Aravind et al.].