A stronger model for peg solitaire, II
| dc.creator | Ramaré, Olivier | |
| dc.date | 2008-01-04 | |
| dc.date.accessioned | 2026-07-07T08:52:36Z | |
| dc.date.available | 2026-07-07T08:52:36Z | |
| dc.description | The main problem addressed here is to decide whether it is possible or not to go from a given position on a peg-solitaire board to another one. No non-trivial sufficient conditions are known, but tests have been devised to show impossibility. We expose the way these tests work in a unified formalism and provide a new test which is strictly stronger than all previous ones. | |
| dc.description | 27 pages, 31 figures | |
| dc.identifier | https://arxiv.org/abs/0801.0679 | |
| dc.identifier | http://arxiv.org/abs/0801.0679 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145335 | |
| dc.subject | Combinatorics | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 05A99 (Primary) 91A46, 52B12 (Secondary) | |
| dc.title | A stronger model for peg solitaire, II | |
| dc.type | text |