Solitaire Lattices

One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, known as pagoda-functions, and the so-called rule-of-three. Here we introduce and study another necessary condition: the solitaire lattice criterion. While the lattice criterion is shown to be equivalent to the rule-of-three for the classical English 33-board and French 37-board as well as for any m

• Type: Journal
• Year: 2002
• Where: GC
• Authors: Antoine Deza, Shmuel Onn
• Keywords: Applied Computing, GC 2002, Lattice Criterion, Solitaire Lattice Criterion, Various Peg Games