2008/01/04 by Olivier Ramaré, Ramaré, Olivier
Mathematics · #05A99 (Primary) 91A46 #52B12 (Secondary) #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #FOS: Mathematics #math.AG #math.CO #msc:05A99 #msc:52B12 #msc:91A46
paper · pdf · doi:10.48550/arxiv.0801.0679
27 pages, 31 figures
arxiv created 2008/01/04 · arxiv updated 2009/12/01
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.