Triangle Peg Board Game - Solutions to amaze your friends

• Peg Board Game Instructions
• Basketball Peg Game Instructions
• Peg Solitaire Game Instructions
• Wooden Peg Golf Game Instructions
• Starburst Peg Game Instructions

This movie explains how to solve the peg game and remember the solution. You will be a Genius! This movie explains how to solve the peg game and remember the solution. You will be a Genius! Begin the game at the start of the hens night party. Prepare 5 to 10 pegs for each guest. If no pegs are available use paper clips instead although pegs really do work better. Each guest must wear a prearranged number of pegs on their clothes.

When visiting the Cracker Barrel restaurant, you will find a 15-peg triangle board game on each table. This page describes how to solve the puzzle from any starting position.

The game board is a triangle with 15 holes in the same shape as bowing pins, except with an extra row. The game starts with pegs (golf tees) in all the holes except one; the goal is to jump pegs one at a time, removing the jumped peg until only one peg remains. The instructions on the board say that if you leave only one peg, you are a genius. I suspect that the genius title is overstated, but if you follow the instructions on this page and you're sure to impress the family!

If you find this a useful page or if you have recommendations for changes, send an email to peggame at this domain.

Enjoy,

Joe Nord

For the pages that follow, the puzzle is viewed in this orientation and the hole numbers referenced. Photographs follow showing the board from start of game through completion.

The normal starting hole (empty hole) is hole #1. The initial discussion on this page shows how to solve the puzzle with hole #1 empty. That is followed by instructions on how to solve for the other starting positions, with the happy addition that most of the starting positions are just variations of the standard #1 start. After 3 moves, they all look the same; except the evil #5!

The first 3 jumps are: 4-1, 6-4 and 1-6. With these complete, the 'magic' base follows. This shape will be referenced later in this document as the 'goal position' for the other variations of the game using different starting holes. Learning to solve the puzzle from this point is the key to success with the game.

The next moves, 7-2, 13-4 and 2-7. This shape is not too critical, the photo just shows the puzzle progressing.

The next steps are to clear the second from bottom row (the yellow tees) and the bottom row.

First, 10-8, 7-9 clears the second row.

15-13 and 12-14 clears the bottom. To mix it up, jump them in reverse and it won't look like you're solving the puzzle the same way every time.

Almost there, the diagonal jump clears all but the bottom of the puzzle and the bottom clears 'easy'.

6-13, 14-12 and 11-13 > Winner!

Starting position (1) - Full solution

For the other starting positions (except position 5 which we will cover later), the same solution is used after the third jump. The 'trick' is to get to the same pattern after the first three moves, the goal shape. From there, solve solve as if it were starting position 1. Notice that there is only one sequence to remember as you can get to the goal position from any of the starting positions based purely on shape.

Here are the moves for 'after' the goal position is reached.

How many starting positions are there?

There are 15 pegs in the board, but only 4 starting positions. For example, all the points are position '1', even if they are otherwise called '11' or '15' the puzzle is the same once you rotate the board; even if only mentally. 2 and 3 are really the same if you view them 'mirrored'. Even if seen backwards, after the first 3 moves, both line up for the same standard solution. Starting positions 4/6 are also swappable; 13 is the same as 4/6 once you rotate the board.

Here are all the starting positions.

The neat thing to observe is that start positions 1, 2 and 4 and 11, 15, 3, 7, 12, 10, 14, 6 and 13 are really the same as they have the same solution once you get past the first 3 moves! This means that there are only 2 puzzle solutions that need to be memorized to solve all positions on the puzzle. If someone figures out how to get to the 'magic' 3rd position when start with hole 5 empty, please let me know.

First three moves for starting position (1, 11, 15 -- Collectively called '1').

The middle holes

I have not found a method to get to the 'same as the others' solution when start with hole #5 (aka 8, 9). A full solution follows and interestingly, it also ends with the final peg standing in hole 13; there must be a good reason. With practice, solving this 'hard one' is really just remembering that there are only 2 possible first moves and this solution starts from the right, the next couple moves are filling the pegs just jumped over or from and the 4th is opening the middle hole on the right side of the triangle. From there, it pretty much solves itself! ?

Peg solitaire (or Solo Noble) is a board game for one player involving movement of pegs on a board with holes. Some sets use marbles in a board with indentations. The game is known simply as Solitaire in the United Kingdom where the card games are called Patience. It is also called Brainvita (mainly in India, where sets are sold commercially under this name).

The first evidence of the game can be traced back to the court of Louis XIV, and the specific date of 1697, with an engraving made ten years later by Claude Auguste Berey of Anne de Rohan-Chabot, Princess of Soubise, with the puzzle by her side. The August 1687 edition of the French literary magazine Mercure galant contains a description of the board, rules and sample problems. This is the first known reference to the game in print.

The standard game fills the entire board with pegs except for the central hole. The objective is, making valid moves, to empty the entire board except for a solitary peg in the central hole.

Board[edit]

There are two traditional boards ('.' as an initial peg, 'o' as an initial hole):

Play[edit]

A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg.

In the diagrams which follow, · indicates a peg in a hole, * emboldened indicates the peg to be moved, and o indicates an empty hole. A blue ¤ is the hole the current peg moved from; a red * is the final position of that peg, a red o is the hole of the peg that was jumped and removed.

Thus valid moves in each of the four orthogonal directions are:

On an English board, the first three moves might be:

Strategy[edit]

There are many different solutions to the standard problem, and one notation used to describe them assigns letters to the holes:

This mirror image notation is used, amongst other reasons, since on the European board, one set of alternative games is to start with a hole at some position and to end with a single peg in its mirrored position. On the English board the equivalent alternative games are to start with a hole and end with a peg at the same position.

There is no solution to the European board with the initial hole centrally located, if only orthogonal moves are permitted. This is easily seen as follows, by an argument from Hans Zantema. Divide the positions of the board into A, B and C positions as follows:

Initially with only the central position free, the number of covered A positions is 12, the number of covered B positions is 12, and also the number of covered C positions is 12. After every move the number of covered A positions increases or decreases by one, and the same for the number of covered B positions and the number of covered C positions. Hence after an even number of moves all these three numbers are even, and after an odd number of moves all these three numbers are odd. Hence a final position with only one peg cannot be reached, since that would require that one of these numbers is one (the position of the peg, one is odd), while the other two numbers are zero, hence even.

There are, however, several other configurations where a single initial hole can be reduced to a single peg.

A tactic that can be used is to divide the board into packages of three and to purge (remove) them entirely using one extra peg, the catalyst, that jumps out and then jumps back again. In the example below, the * is the catalyst.:

This technique can be used with a line of 3, a block of 2·3 and a 6-peg L shape with a base of length 3 and upright of length 4.

Other alternate games include starting with two empty holes and finishing with two pegs in those holes. Also starting with one hole here and ending with one peg there. On an English board, the hole can be anywhere and the final peg can only end up where multiples of three permit. Thus a hole at a can only leave a single peg at a, p, O or C.

Studies on peg solitaire[edit]

A thorough analysis of the game is known.^[1] This analysis introduced a notion called pagoda function which is a strong tool to show the infeasibility of a given, generalized, peg solitaire, problem.

A solution for finding a pagoda function, which demonstrates the infeasibility of a given problem, is formulated as a linear programming problem and solvable in polynomial time.^[2]

A paper in 1990 dealt with the generalized Hi-Q problems which are equivalent to the peg solitaire problems and showed their NP-completeness.^[3]

A 1996 paper formulated a peg solitaire problem as a combinatorial optimization problem and discussed the properties of the feasible region called 'a solitaire cone'.^[4]

In 1999 peg solitaire was completely solved on a computer using an exhaustive search through all possible variants. It was achieved making use of the symmetries, efficient storage of board constellations and hashing.^[5]

In 2001 an efficient method for solving peg solitaire problems was developed.^[2]

An unpublished study from 1989 on a generalized version of the game on the English board showed that each possible problem in the generalized game has 2⁹ possible distinct solutions, excluding symmetries, as the English board contains 9 distinct 3×3 sub-squares. One consequence of this analysis is to put a lower bound on the size of possible 'inverted position' problems, in which the cells initially occupied are left empty and vice versa. Any solution to such a problem must contain a minimum of 11 moves, irrespective of the exact details of the problem.

It can be proved using abstract algebra that there are only 5 fixed board positions where the game can successfully end with one peg.^[6]

Solutions to the English game[edit]

The shortest solution to the standard English game involves 18 moves, counting multiple jumps as single moves:

This solution was found in 1912 by Ernest Bergholt and proven to be the shortest possible by John Beasley in 1964.^[7]

This solution can also be seen on a page that also introduces the Wolstenholme notation, which is designed to make memorizing the solution easier.

Other solutions include the following list. In these, the notation used is

• List of starting holes
• Colon
• List of end target pegs
• Equals sign
• Source peg and destination hole (the pegs jumped over are left as an exercise to the reader)
• , or / (a slash is used to separate 'chunks' such as a six-purge out)

Peg Board Game Instructions

Brute force attack on standard English peg solitaire[edit]

The only place it is possible to end up with a solitary peg is the centre, or the middle of one of the edges; on the last jump, there will always be an option of choosing whether to end in the centre or the edge.

Following is a table over the number (Possible Board Positions) of possible board positions after n jumps, and the possibility of the same pawn moved to make a further jump (No Further Jumps).

NOTE: If one board position can be rotated and/or flipped into another board position, the board positions are counted as identical.

Since there can only be 31 jumps, modern computers can easily examine all game positions in a reasonable time.^[8]

The above sequence 'PBP' has been entered as A112737 in OEIS. Note that the total number of reachable board positions (sum of the sequence) is 23,475,688, while the total number of possible board positions is 8,589,934,590 (33bit-1) (2^33) , So only about 2.2% of all possible board positions can be reached starting with the center vacant.

It is also possible to generate all board positions. The results below have been obtained usingthe mcrl2 toolset (see the peg_solitaire example in the distribution).

In the results below It is generate all board positions really reached starting with the center vacant and finish in central hole.

Solutions to the European game[edit]

There are 3 initial non-congruent positions that have solutions.^[9] These are:

1)

Possible solution: [2:2-0:2, 2:0-2:2, 1:4-1:2, 3:4-1:4, 3:2-3:4, 2:3-2:1, 5:3-3:3, 3:0-3:2, 5:1-3:1, 4:5-4:3, 5:5-5:3, 0:4-2:4, 2:1-4:1, 2:4-4:4, 5:2-5:4, 3:6-3:4, 1:1-1:3, 2:6-2:4, 0:3-2:3, 3:2-5:2, 3:4-3:2, 6:2-4:2, 3:2-5:2, 4:0-4:2, 4:3-4:1, 6:4-6:2, 6:2-4:2, 4:1-4:3, 4:3-4:5, 4:6-4:4, 5:4-3:4, 3:4-1:4, 1:5-1:3, 2:3-0:3, 0:2-0:4]

2)

Possible solution: [1:1-1:3, 3:2-1:2, 3:4-3:2, 1:4-3:4, 5:3-3:3, 4:1-4:3, 2:1-4:1, 2:6-2:4, 4:4-4:2, 3:4-1:4, 3:2-3:4, 5:1-3:1, 4:6-2:6, 3:0-3:2, 4:5-2:5, 0:2-2:2, 2:6-2:4, 6:4-4:4, 3:4-5:4, 2:3-2:1, 2:0-2:2, 1:4-3:4, 5:5-5:3, 6:3-4:3, 4:3-4:1, 6:2-4:2, 3:2-5:2, 4:0-4:2, 5:2-3:2, 3:2-1:2, 1:2-1:4, 0:4-2:4, 3:4-1:4, 1:5-1:3, 0:3-2:3]

and 3)

Possible solution: [2:1-2:3, 0:2-2:2, 4:1-2:1, 4:3-4:1, 2:3-4:3, 1:4-1:2, 2:1-2:3, 0:4-0:2, 4:4-4:2, 3:4-1:4, 6:3-4:3, 1:1-1:3, 4:6-4:4, 5:1-3:1, 2:6-2:4, 1:4-1:2, 0:2-2:2, 3:6-3:4, 4:3-4:1, 6:2-4:2, 2:3-2:1, 4:1-4:3, 5:5-5:3, 2:0-2:2, 2:2-4:2, 3:4-5:4, 4:3-4:1, 3:0-3:2, 6:4-4:4, 4:0-4:2, 3:2-5:2, 5:2-5:4, 5:4-3:4, 3:4-1:4, 1:5-1:3]

Board variants[edit]

Peg solitaire has been played on other size boards, although the two given above are the most popular. It has also been played on a triangular board, with jumps allowed in all 3 directions. As long as the variant has the proper 'parity' and is large enough, it will probably be solvable.

Basketball Peg Game Instructions

A common triangular variant has five pegs on a side. A solution where the final peg arrives at the initial empty hole is not possible for a hole in one of the three central positions. An empty corner-hole setup can be solved in ten moves, and an empty midside-hole setup in nine (Bell 2008):

Video game[edit]

On June 26, 1992, a video game based on peg solitaire was released for the Game Boy. Titled simply 'Solitaire', the game was developed by Hect. In North America, DTMC released the game as 'Lazlos' Leap'.

References[edit]

1. ^Berlekamp, E. R.; Conway, J. H.; Guy, R. K. (2001) [1981], Winning Ways for your Mathematical Plays(paperback)|format= requires |url= (help) (2nd ed.), A K Peters/CRC Press, ISBN978-1568811307, OCLC316054929
2. ^ ^abKiyomi, M.; Matsui, T. (2001), 'Integer Programming Based Algorithms for Peg Solitaire Problems', Proc. 2nd Int. Conf. Computers and Games (CG 2000): Integer programming based algorithms for peg solitaire problems, Lecture Notes in Computer Science, 2063, pp. 229–240, CiteSeerX10.1.1.65.6244, doi:10.1007/3-540-45579-5_15, ISBN978-3-540-43080-3
3. ^Uehara, R.; Iwata, S. (1990). 'Generalized Hi-Q is NP-complete'. Trans. IEICE. 73: 270–273.
4. ^Avis, D.; Deza, A. (2001), 'On the solitaire cone and its relationship to multi-commodity flows', Mathematical Programming, 90 (1): 27–57, doi:10.1007/PL00011419, S2CID7852133
5. ^Eichler; Jäger; Ludwig (1999), c't 07/1999 Spielverderber, Solitaire mit dem Computer lösen (in German), 7, p. 218
6. ^'Mathematics and brainvita', Notes on Mathematics, 28 August 2012, retrieved 6 September 2018
7. ^For Beasley's proof see Winning Ways, volume #4 (second edition).
8. ^'solboard'. github. 2020-08-31. Retrieved 2020-08-31. Implementation of brute force calculation of the Peg solitaire game
9. ^Brassine, Michel (December 1981), 'Découvrez... le solitaire', Jeux et Stratégie (in French)

Peg Solitaire Game Instructions

Further reading[edit]

• Beasley, John D. (1985), The Ins & Outs of Peg Solitaire, Oxford University Press, ISBN978-0198532033
• Bell, G. I. (2008), 'Solving triangular peg solitaire', Journal of Integer Sequences, 11: Article 08.4.8, arXiv:math.CO/0703865, Bibcode:2007math......3865B.
• Bruijn, N.G. de (1972), 'A solitaire game and its relation to a finite field'(PDF), Journal of Recreational Mathematics, 5: 133–137
• Cross, D. C. (1968), 'Square solitaire and variations', Journal of Recreational Mathematics, 1: 121–123
• Gardner, M., 'Mathematical games', Scientific American206 (6): 156–166, June 1962; 214 (2): 112–113, Feb. 1966; 214 (5): 127, May 1966.
• Jefferson, Chris; et al. (October 2006), 'Modelling and Solving English Peg Solitairet', Computers & Operations Research, 33 (10): 2935–2959, CiteSeerX10.1.1.5.7805, doi:10.1016/j.cor.2005.01.018

Wooden Peg Golf Game Instructions

External links[edit]

Starburst Peg Game Instructions

• Bogomolny, Alexander, 'Peg Solitaire and Group Theory', Interactive Mathematics Miscellany and Puzzles, retrieved 7 September 2018
• White Pixels (24 October 2017), Peg Solitaire: Easy to remember symmetrical solution (video), Youtube
• Play Multiple Versions of Peg Solitaire including English, European, Triangular, Hexagonal, Propeller, Minimum, 4Holes, 5Holes, Easy Pinwheel, Banzai7, Megaphone, Owl, Star and Arrow at pegsolitaire.org