Solitaire Clobber
| dc.creator | Demaine, Erik D. | |
| dc.creator | Demaine, Martin L. | |
| dc.creator | Fleischer, Rudolf | |
| dc.date | 2002-04-09 | |
| dc.date | 2002-07-30 | |
| dc.date.accessioned | 2026-07-07T03:18:17Z | |
| dc.date.available | 2026-07-07T03:18:17Z | |
| dc.description | Clobber is a new two-player board game. In this paper, we introduce the one-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and two columns, we show that a checkerboard configuration can be reduced to a single stone if and only if the number of stones is not a multiple of three, and otherwise it can be reduced to two stones. We also show that in general it is NP-complete to decide whether an arbitrary Clobber configuration can be reduced to a single stone. | |
| dc.description | 14 pages. v2 fixes small typo | |
| dc.identifier | https://arxiv.org/abs/cs/0204017 | |
| dc.identifier | http://arxiv.org/abs/cs/0204017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31049 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Computational Geometry | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | G.2.1; G.2.2; F.2.2; I.3.5 | |
| dc.title | Solitaire Clobber | |
| dc.type | text |