Losing at Checkers is Hard

Jeffrey Bosboom, Spencer Congero, Erik D. Demaine +2

We prove computational intractability of variants of checkers: (1) deciding whether there is a move that forces the other player to win in one move is NP-complete; (2) checkers whe…