The following pages link to Fool's solitaire on graphs (Q365932):
Displaying 18 items.
- Fool's solitaire on joins and Cartesian products of graphs (Q482200) (← links)
- Morpion solitaire 5D: a new upper bound of 121 on the maximum score (Q509879) (← links)
- The complexity of solitaire (Q1034532) (← links)
- Solitaire lattices (Q1606024) (← links)
- Peg solitaire in three colors on graphs (Q2036701) (← links)
- Peg solitaire on Cartesian products of graphs (Q2045384) (← links)
- Examples of edge critical graphs in peg solitaire (Q2089538) (← links)
- Peg solitaire on graphs with jumping and merging allowed (Q2109085) (← links)
- Reversible peg solitaire on graphs (Q2352067) (← links)
- Merging peg solitaire on graphs (Q2398941) (← links)
- Constructing solvable graphs in peg solitaire (Q2839649) (← links)
- Impartial solitaire clobber played on powers of paths (Q2840546) (← links)
- Peg solitaire on graphs with seven vertices or less (Q2869343) (← links)
- Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire (Q5009671) (← links)
- Making graphs solvable in peg solitaire (Q5054035) (← links)
- Path-Stick Solitaire on Graphs (Q5057213) (← links)
- Peg solitaire game on Sierpinski graphs (Q5059561) (← links)
- Peg solitaire on graphs -- a survey (Q6650320) (← links)