A Stronger Model for Peg Solitaire
Résumé
The main problem addressed here is to decide whether it is or not possible 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 it is not possible. We expose the way these tests work in a unified formalism and provide a new one which is strictly stronger than all the previous ones.
Origine : Fichiers produits par l'(les) auteur(s)