Related papers: Diagonal Peg Solitaire
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg at a specified board location. We develop necessary and…
Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have…
Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining…
We consider the one-person game of peg solitaire played on a computer. Two popular board shapes are the 33-hole cross-shaped board, and the 15-hole triangle board---we use them as examples throughout. The basic game begins from a full board…
We solve the problem of one-dimensional Peg Solitaire. In particular, we show that the set of configurations that can be reduced to a single peg forms a regular language, and that a linear-time algorithm exists for reducing any…
Peg solitaire is classically a one-player game played on a grid board containing pegs. The goal of the game is to have a single peg remaining on the board by sequentially jumping with a peg over an adjacent peg onto an empty cell while…
We investigate the game of peg solitaire on different board shapes, and find those of diamond or rhombus shape have interesting properties. When one peg captures many pegs consecutively, this is called a sweep. Rhombus boards of side 6 have…
We consider the problem of determining the minimum number of moves needed to solve a certain one-dimensional peg puzzle. Let N be a positive integer. The puzzle apparatus consists of a block with a single row of 2N+1 equally spaced holes…
Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at…
Despite its long history, the classical game of peg solitaire continues to attract the attention of the scientific community. In this paper, we consider two problems with an algorithmic flavour which are related with this game, namely…
The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph $G$. If $xyz$ forms a path in $G$ and there are pegs on vertices $x$ and $y$ but not…
We solve the problem of one-dimensional peg solitaire. In particular, we show that the set of configurations that can be reduced to a single peg forms a regular language, and that a linear-time algorithm exists for reducing any…
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…
We first prove that solving Mahjong Solitaire boards with peeking is NP-complete, even if one only allows isolated stacks of the forms /aab/ and /abb/. We subsequently show that layouts of isolated stacks of heights one and two can always…
Domineering is a two-player game played on a checkerboard in which one player places dominoes vertically, while the other places them horizontally. In this paper, we find out the minimum number of moves for a game of Domineering to end on…
In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We…
Some old peg solitaire boards are brought down from the literature, dusted off, and re-examined, and some remarkable problems are displayed on them.
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple…
In any periodic direction on the regular pentagon billiard table, there exists two combinatorially different billiard paths, with one longer than the other. For each periodic direction, McMullen asked if one could determine whether the…