Triangle Peg Board Game Cheat
- Tricky Triangle - Bullet Peg Game Puzzle - Cracker Barrel Board Game - Wood Jumping Peg Game - Gifts For Kids CrookedCreekAntlers From shop CrookedCreekAntlers.
- A classic wooden triangle peg game. Hand made, stained and glossed. Great for keeping on the coffee table for guests who want to take another try at this game. Feel free to customize with wood burned names dates or short phrases (under 5 words) for free!
In Peg Solitaire, your goal is to remove pegs from the board until only one peg is left. You will be given a cross-shaped board with multiple pegs, while the hole at the center is left empty. You may click and drag a peg to jump over a horizontally or vertically adjacent peg and move to the empty space next to it, so that the peg being jumped. Easy Peg Solitaire tricks hints guides reviews promo codes easter eggs and more for android application. Avoid Easy Peg Solitaire hack cheats for your own safety, choose our tips and advices confirmed by pro players, testers and users like you. Ask a question or add answers, watch video tutorials & submit own opinion about this game/app. Tricky Triangle Board game tricks hints guides reviews promo codes easter eggs and more for android application. Avoid Tricky Triangle Board game hack cheats for your own safety, choose our tips and advices confirmed by pro players, testers and users like you. Ask a question or add answers, watch video tutorials & submit own opinion about this game/app. I remember this game from Bell's Book 'Board Games from around the World.' The triangle on the board has rows of 3, 3, 3, 1. The triangular shape is to get the board to converge on the tiger's starting spot.
I became intrigued with the 5x5 triangular peg board puzzle game while dining at a Cracker Barrel restaurant. The puzzle is often referred to as the I.Q. test. I once saw a 13 year old British girl solve the puzzle on a jet plane in about 10 minutes. (She started the game with an unusual starting position which I've found to provide the most possible winning solutions :-)
Not being able to consistently solve the puzzle myself, I decided to try my hand at programming a solution. This page provides all possible solutions, some analysis, and the source code to the program I wrote to solve the puzzle.
INTRODUCTION
The basic board is a triangle of pegs. In my simulation, I used the numeric 1 to show a peg in a hole and a numeric 0 to show an empty hole. For example, one possible starting board might look like this:
The top hole is empty, and all the other holes are filled. A single move consists of a single pin jumping a neighbor into an empty slot, capturing the jumped neighbor, and thus removing that pin from the board. This is much like the game checkers. For the above board layout, one possible play would result in the following board layout:
Moves continue until no more moves are possible. The goal of the game is to remove all but the last peg. This is considered a winning game. If more than one pin is left and no more moves are possible, then this is a final, non-winning game. A solution is a winning game.
CONVENTIONS
The program I wrote takes a starting pin that will be vacant and then proceeds to solve the puzzle for all possible solutions. The pins are numbered by row and column starting with zero (sorry, most computer programs begin numbering with zero instead of one). Thus board positions are numbered as follows:
Owing to symmetry many starting board positions are equivalent. For example, an empty pin in 0,0 is the same as a starting position with an empty pin at 4,0 or at 4,4. Therefore, all possible starting positions are contained in the top half of the board, namely 0,0; 1,0; 2,0; and 2,1. All other starting positions are duplicate of these by either rotating or flipping the board. This fact will be important later if you wish to download a complete solution. You will have to decide what starting position solution set to download.
ANALYSIS
But first some analysis. I ran all possible starting positions through my program and learned a few interesting facts.
Number of Winning Games |
29760 |
14880 |
85258 |
1550 |
Notice that the starting board with an empty pin at position 2,0 provides the maximum number of possible winning games. This is the starting position chosen by the young British girl. She unknowingly (or perhaps she did) picked a starting position providing the maximum chance of finding a solution.
The end game, that is the game with only one peg, is quite interesting. I looked at all possible end games for the 0,0 starting board. There are only four positions where that single peg is left. This table lists the end games for the 0,0 starting board along with the number of games that lead to that solution.
Number of Winning Games |
16128 |
3408 |
3408 |
6816 |
Note: Jim (SN..@XYZ.com) noted in email that all the winning boards that starts in the 2,1 position also leave the pin in 4,2! I hadn't noticed this in all my examinations of the puzzle results. As the saying goes 'None of us is as smart as all of us!'. Thanks, Jim!
SOLUTION
The interesting solutions are those that leave the final pin in the original empty hole. One winning solution out of the 6816 solutions that leave the pin in the original hole is listed in the table below:
Winning Game Leaving the Last Pin in the Starting Empty Slot |
1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 |
1 1 0 0 1 1 1 1 0 1 1 1 1 0 1 |
1 1 0 0 1 1 1 1 0 1 1 0 1 0 0 |
1 0 0 0 1 1 1 1 0 1 0 0 1 0 0 |
1 0 1 1 1 0 1 0 0 0 0 0 0 0 0 |
0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 |
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 |
Starting Board | Size (bytes) | Size (bytes) |
PegBoard00.txt | ||
1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 | 177,568 | 10,996,320 |
PegBoard20.txt | ||
1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 | 16,878 | 1,145,450 |
SOURCE FILES
The program which generated these solutions is written in C++ using STL components. It was developed under FreeBSD 4.4 using GNU compiler 2.95.3. It has also been compiled and run under RedHat Linux 7.1 running on DEC Alpha with GNU compiler 2.96.
Here is the source file: pegboard.cpp.
NEW!
Triangle Peg Board Game Cheat Age Of Empires 2
In response to a comment that I had perhaps not found all possible solutions, I decided to write a new version of the program from scratch. I wrote a full solution solver in Java without referring to the original C++ implementation. I tested the new solver and it create the same number of solutions per starting position as the original C++ program. The funny thing is that the Java version runs twice as fast as the C++ version. I think I used better algorithms to find possible moves so it is more efficient. Have fun with it.
Here is the Java source file: PegBoard.zip.
RELATED LINKS
Triangle Peg Game Solve
Danceguy has a cool Java applet version of the game online at http://mywebpages.comcast.net/danceguy/PegGame.htmlTeam Mad Overload has an extensive discussion and analysis at http://www.madoverlord.com/projects/crackerbarrel.t
Don Hartzler has his own page and long time experience with programming this game http://www.medjh.com/triang/.
The Cracker Barrel site also sells the board game online. You can find it HERE!
ADDENDUM
- I was asked what is the worst losing game, i.e., what is the game that leaves the most number of pegs remaining. So I tweaked up my simulation to output the losing boards, and found the worst game. It leaves 10 pegs remaining starting with the center peg removed.
- Also, I was asked about solutions to a 4x4 puzzle, a board with only 10 holes vs 15. I reran the simulation and it seems not all starting positions have solutions. The full solution set for 4x4 puzzle is here.1
1 1
1 0 1
1 1 1 1
1 1 1 1 11
1 0
1 0 1
1 1 1 1
1 0 1 1 11
1 1
1 0 1
1 0 0 1
1 0 1 0 1 - Kent Loberternos asked me via email for a solution that starts with 14 pegs and then terminates with 8 pegs and no further moves. I ran this simulation for all unique starting positions and there are exactly three solutions! The full solution set is here.
- Got a note from Daniel C. Alsmeyer, PhD, on work he has done. He writes:
Greetings from a kindred spirit. I recently became 're-engaged' with the 'Cracker Barrel' peg jump game. One of my hobbies is to make wood puzzles and I decided to make a few of these. I typically give these things away to my family and friends as Christmas (or other occasion) gifts. Since most folks don't like to be completely stumped by a problem (and love having a 'cheat sheet' answer) I try to include a solution to the puzzle.
Well, on this one I wasted away a few hours and kept drawing a blank, so I decided to write a quick program to solve the thing. Oddly, in my manual attempts I kept trying to find a solution from the (2,1) starting position (which has the fewest solutions and worst percentage chance of finding one!!). After completing the brute force coded solution I became slightly despondent when I learned of all the potential solutions!!
For some reason I decided to search the web after I had achieved the long list of solutions. This is when I discovered your site. It seems you wrote a program that solved the puzzle in a similar manner.
I thought you'd be interested to know that I achieved the same basic results as you. I had also thought up similar challenges as those you describe (leaving the final peg in the initial vacancy, what's the worst you can do, etc.). I note that you reduce the problem to the four redundant starting peg solutions. I might argue that most of the starting positions have a symmetry that also really reduces the number of 'unique' solutions (i.e. (0,0) has a mirror image symmetry).
One also finds that jump order is not taken into account and so truly 'unique' solutions are significantly over counted. I actually counted solutions for all 15 beginning positions and declared 12 solutions for the 'leave 8' problem. I set my program up to evaluate all avenues and to count the number of instances of each.
Thus I tallied all possible games (one peg left, two pegs left, three pegs left, etc.). In this manner I decided that there were almost 440,000 correct ways of solving the puzzle (all redundancies included) with total possible avenues of some 22,000,000. Basically, with dumb luck, you'd expect to achieve a solution 2% of the time.
I was also fascinated with the challenge of leaving the final peg in the initial vacancy. You indicate 6816 solutions for this, however that is only for the initial vacancy at (0,0). You will find 720 solutions for the (1,0) set of redundant initial vacancies and 51,452 for the (2,0). Interestingly the (2,1) set can not be solved in this manner.
I did an analysis of ending peg positions and found it to have a symmetry in number to the initial vacancy solutions. In retrospect this makes sense in that one could be jumping holes as opposed to pegs and one should find the solutions mirror. - As in any endeavor exposed on the Internet for all to see and comment on, there will always be haters. I received email from an alleged 20 year old female, a certain Courtney Rowe, who claims that my solution set is incomplete in that she found a solution on her phone that I don't have listed. I politely asked her several times for a listing of her solution to check my results. She never responded back. Here is here email to me (text as quoted):
Your complete solutions section isn't complete! I'm a 20 yr old female and I have the game on my phone and I was able to solve this puzzle in 37 seconds.. (mind u that was the first time i solved it).. different from any of ur solutions. my record for solving this puzzle is 9sec and until today i've never even seen a solution for this game let alone see anyone solve it.. If u r going to have a 'complete soulutions' section then i suggest that u have it complete before u put it up online so it doesn't make u look like a idiot when others can prove u wrong..my suggestion would be to change ur 'complete solutions' to something more like 'Solutions I've found' or something to that nature.. Have a nice day! :) - rgomez@i<EDIT>.com sent me the following email:
Congratulations on your work, I would only like to point one tiny missinformation, complementing what Daniel C Alsmeyer said, there are around 440,000 possible solutions including all redundancies (actually 438,984 according to the numbers you presented and the 15 possible initial positions (also redundant); If Daniel is right about the 22million possible outcomes, we would first need to know how many possible outcomes there are for each initial position in order to be certain that the 2,0 initial position that the brit girl used has the highest probabilities of being solved. Numbers look that they will probe u right about this, but I think it would be interesting to run your program to find out. And yes u did mentioned that 2,0 has the highest number of solutions not the highest percentage but I think its interesting just to find out!
So, I tweaked the java solution to print the number of winning boards and losing boards with percentages of the total. The percentages are very close, but the highest winning percentage (7.4%) is the one with the most winning games: 2,0
Start hole: 0,0 Winning boards: 29760 (5.2%) Losing Boards: 538870 (94.8%)
Start hole: 1,0 Winning boards: 14880 (5.1%) Losing Boards: 279663 (94.9%)
Start hole: 2,0 Winning boards: 85258 (7.4%) Losing Boards: 1064310 (92.6%)
Start hole: 2,1 Winning boards: 1550 (1.1%) Losing Boards: 136296 (98.9%) - Achim D. (JDAF.@XYZ.com) sent me the following email:
My daughter Joy, was about to fail 6th grade math, when her teacher gave herone last chance to come up with a project that would include all the formsof math they used that year and turn it in on time. She came up with theTriangle Puzzle (she also enjoyed playing the game but we had never won orfound a solution)..Well, she in her simplistic way said, 'Dad, if we solve the triangle puzzle,she'll have to pass my. It says right on the puzzle you are a genius if youleave just one.' I smiled, because I usually left three or four. But herteacher saw intelligence in her way of doing many other things, just a lazybone and procrastination. Even w/o study or turning in homework she wouldmake C on most math tests.
Anyway.. We made the puzzle using protractor and compass (geometry),measuring out the angles..
Then she began the attempts at problem solving..Obviously many wrong solutions as you noted in your web site..Then her first critical problem solving though process kicked in.
She asked dad there are just too many wrong answers, we can't remember themall, we need a way of writing down the moves. When you play chess, don'tyou write down the moves using algebraic notation (she heard Steve a friendand I talking about this).. I said, well, Steve does, but I use coordinatepositioning..
Then she said, well, why don't we number each hole, and then record startingand ending position for each move.. OK (she had just created a language tocommunicate and pass on information) -- the basis of all intelligence thatis passed on.
Still there were many many wrong solutions written down.
Then she came up with an idea, 'Why don't we start from the solution andwork our way back?' I said Hmmmm, let's give it a try. Well it didn't workexactly, just sort of. In that when we worked our way back we recognized amid game position that we had already recorded.. We went back through allthe recorded positions put the two together and wallaa.. A solution, moreimportantly.. A way of repeating and recording the solutions. My mom,like you began playing and recording solutions.. Many pages..
We found out that there are really only 4 unique starting positions, allothers are symply variations..
1.. Center side (3 variations)
2.. Off center side (6 variations)
3.. Corner (3 variations)
4.. Center (3 variations)
I'll attach our direction sheet we now have passed on to all we give thispuzzle to. By the way she passed 6th grade math and is a teacher now.
Also her teacher then began to us this puzzle as a project in her class.
My highest compliment was being at a school in the area when another mathteacher had been speaking, and he had the puzzle in a baggie (I immediatelyrecognized it as one of ours) and asked where he got it and what he wasusing it for. He had been asked to speak about math in a conference and hadused Joy's puzzle solution as a way of solving all math problems..
Language and solution back the two principles..
I was impressed. - I received the following from a fellow PegBoard enthusiast, steven.r.sides@gmail.com.
Grandpa's Peg Jumping Game
January 11, 2011
by Steve Sides
I wrote a program for my computer that analyzes Grandpa's peg jumping game. I found 2,150,587 solutions. There are really about 7.34 million, but a lot of those are duplicates, so I don't count them. You play the game by removing one peg. Then you jump pegs, checkers style, until you can't make any more jumps. The goal is to have only one peg left when you're done. Of the 2.15 million solutions, 131,448, or 6 % end up with only one peg. To make it harder, you could remember which peg you took out first, and try to make the last peg end up in that position. There are 58,988 ways to do that.
To analyze the game, I numbered the positions like this.1 Then I wrote 2-9, for example, to mean jump the peg in position 2 over the peg in position 5 to the empty space at position 9. As far as I know, my program tried all the possibilities, but there's no way I can manually check them all.
2 3
4 5 6
7 8 9 10
11 12 13 14 15
If you give up trying for one peg left at the end; if you find it too frustrating, you might want to go for broke and leave 10 pegs. But that is even harder. There are only two ways to do that. Here's one of them. Remove the peg in position 8 and do these jumps.
3-8, 12-5, 10-8, 5-12
If you still want to go for broke, you could leave 8 pegs at the end. There are three ways to do that. (There are actually more, but they are rotations or mirror images of the 3 I'm counting.) Start by removing a peg in position 11 and make these jumps.
4-11, 6-4, 14-5, 2-9, 13-6, 11-13
If you jump rather aimlessly, you'll probably end up with three pegs at the end. There are 966,789 ways to do that. There are 991,019 ways to end up with either 2 or 4 pegs. Leaving 5, 6, or 7 pegs is somewhat harder with only 61,326 ways to get one of those. I don't believe there is any way to end up with 9 pegs. You can arrange 9 pegs, so that none can be jumped, but there's is no way to create that formation by jumping. If I'm wrong, please show me how to do it.
While we're on the subject of impossible, it's interesting that if you start by removing pegs, 5, 8, or 9, and if you end up with one peg, that peg will be in position 13, 6, or 4, respectively. In other words if you start with position 8 empty, the last peg will always be in position 6. It can't be anywhere else. There's no other way to do it. As I said before, if I'm wrong, please show me.
----------------
I decided to write the program without any outside influence. I wrote the program, analyzed my results, then found your website. I've attached my Python program. It gets the same results as yours. The Python program writes .CSV files which I pulled into MS-Access for analysis.
Best regards,
Steve
NOTE: the SQL statements I used to analyze the results:
For example, I gave 11 as the argument to listroads3.py and redirected std out to listroads11.txt. I imported the .CSV file into MS-Access and ran these queries.
/* Get the total number of solutions for each number of pegs left. */select NUM_PEGS_LEFT,count(*) as TOTALfrom Listroads11 group by NUM_PEGS_LEFT;
/* OneLeft: Get a list of PEGS_LEFT where NUM_PEGS_LEFT = 1 */select Listroads11.NUM_PEGS_LEFT, Listroads11.PEGS_LEFTfrom Listroads11where (((Listroads11.NUM_PEGS_LEFT)=1));
/* OneLeftTotals: Count the number of ways to leave one peg in the various positions. */select PEGS_LEFT,count(*) as TOTALfrom OneLeft group by PEGS_LEFT; - I received this note from Jann Schott:
Hello! I was doing a search regarding the peg board puzzle (triangle shape) and came across your website. When I was in 8th grade (1977!), I received one of these puzzles in my Christmas stocking.
I'd play it periodically and then one day I actually 'WON!' Not only did I 'WIN' but I managed to end with one peg in the original starting hole.
This is the Solution that is 'My claim to fame.'
Using Steve Sides' model:1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
I start with #13 empty. 6-13, 15-6, 13-15, 3-10, 15-6, 4-13, 1-4, 7-2, 2-9, 12-14, 6-13, 14-12, 11-13.
Enjoy!
Jann Schott,
Peoria, AZ - Brian Adkins sent me email about solving the puzzle using Haskell. I never heard of the language, but hissolution is small and elegent:
I found your site when I was searching for description of the Cracker Barrel golf tee puzzle. I implemented a solution in Haskell that you're welcome to point to:
http://lojic.com/blog/2011/03/10/cracker-barrel-peg-board-puzzle-in-haskell/
I'm just learning Haskell, but it seemed to allow a pretty concise solution. I simply had it print the first solution in which the last tee is in the original empty hole instead of enumerating all solutions. I think enumerating all would only add a few lines of code.
Thanks,
Brian AdkinsLojic Technologies, LLChttp://lojic.com/ - Vincent Toups sent me this email about solving the puzzle using emacslisp. Amazing.
I've implemented the peg puzzle as a way of demonstrating some ideas from functional programming. My solution returns a lazy list of all possible solutions, including instructions for generating each one. It is in emacs lisp, which is kind of wacky. I wrote an entire blog post/tutorial about it:http://dorophone.blogspot.com/2011/04/deep-emacs-lisp-part-2.html
-Vincent Toups - Sam Barnum sent me his Java GUI application that runs the game interactively presenting options for the next move. Very nicepresentation. He permitted me to add it to the download collection here. Download ZIP file.Run it by simply 'java -jar pegboard.jar'.
- Jared Proffitt created a MAC version of the game. I haven't tried it:http://jproffitt.com/PegGame.zip
- Dr. Roger Butenuth has a blog post about multitasking, data structures, and performance in solving this game. Very intestesting read.http://blog.codecentric.de/en/2012/11/java-forkjoin-improve-performance/
- Paul Sanders sent me this note:
I was very interested in the game one day at a cracker barrel, and began on writing a code. I used mathematica, and my solutions were exactly the same as yours. Maybe a mathematica version wouldn't hurt..yo dawg.nb
Thanks,
Paul Sanders - Juan Mendez sent me this note:
I liked your site. Don’t know if you are still maintaining and adding links, but in case you do, here is an app for iPhone, iPads, and Macs, in case you want to list as a resource:
https://itunes.apple.com/us/app/pegs/id795966104
https://itunes.apple.com/us/app/pegs/id799510644
Best regards,
Juan C. Mendez
How to Solve Peg Solitaire (Hi-Q) with Step-by-Step Advice
Peg Solitaire is one of the most recognizable and popular board games of all time. With easy-to-learn rules and seemingly simple goals, many are taken by surprise when they discover how deceivingly difficult the puzzle turns out to be. The object of the game is to not only remove all of the pegs from the board by jumping over them with any of the other pegs, but also to accomplish this daunting task while simultaneously ending your jumping spree with a peg resting exactly in the center hole of the board. If you've ever tried your hand at solving a Peg Solitaire board, you'll surely understand how frustratingly elusive these simple tasks turn out to be. However, many players worked very hard over the more than 300 years that the game has been played to discover a solution to the challenging puzzle, manually hashing out the moves by hand until they could successfully map out the proper configurations. In fact, a man named Ernest Bergholt actually provided a solution to Peg Solitaire back in 1912 that required only 18 moves to sweep the board of pegs except for a lone fellow landing beautifully in the center hole on the final move of the game. The Chess and Poker Dot Com Peg Solitaire guide follows this solution with a clear, graphical explanation below. To begin, let's take a quick refresher course on how a game of Peg Solitaire is played.
How to Play Peg Solitaire
A player selects a peg and then moves it across the board by legally jumping any other peg that it chooses. Whenever a peg is jumped, it is removed from the board and is out of play. Pegs can only jump over pegs that are horizontally or vertically adjacent to the jumping peg, and can only jump over one peg at a time. Diagonal jumps are not allowed, and there must always be an empty target hole on the other side of the peg being jumped in order for the move to be legal (they can't jump over one peg and land on another). However, a player can make multiple jumps with the same starting peg (without putting it down and selecting another) during the same turn as long as they are still following the standard rules above. Actually, these multiple jumps with the same peg actually only count as one total move, even though it jumped and removed multiple pegs from the board in the same sequence.
In the Peg solitaire solution below, we'll be using arrows to illustrate which peg should be used and in which direction it should be jumping other pegs for each move. The arrows will lead out from the peg that will be doing the jumping, known as the Target Peg (colored blue in our graphics), and will end at the indicated square following the initial jump. In some cases, there will be multiple arrows in the same move indicating that multiple legal jumps are to be performed to execute the move correctly. After a few practice games with your own Peg solitaire board, you should have the hang of it in no time at all. To aide in the memorization of this optimal Peg solitaire solution, we've listed each of the 18 maneuvers in two-move groupings (left to right in each category) along with headlines that note the move counts and a helpful title for each set of moves. Now it's time to get started!
Throughout the guide, I'll discuss the direction of jumps based on whether or not they're moving toward the Left or Right sides of the board, and also if they are migrating Up (towards the top of the board) or Down (towards the bottom of the board). Occasionally, there will be multiple jumps during the same move. As previously stated these will be indicated with multiple arrows on the same graphic. Simply jump the original peg over each successive peg as shown in the graphic until you've reached the destination peg-hole. Even though there were multiple jumps, as long as they were consecutive jumps (all in a row, jumped with the same peg) they still only count as one total move.
Moves 1 and 2 : The First T
To unravel the seemingly complex peg solitaire board, we'll work in two move groupings until we completely solve the game (in the least amount of moves to boot). Move #1 is very simple and involves only one jump. We see that the peg we'll pick up and use to jump (with the arrow coming out of it) should hop over the peg directly to its right and take up a new home in the previously vacant center square to kick off the game. The peg that was jumped is removed from the board, leaving an empty peg-hole where it once was. It's useful to note that whenever a single peg is jumped, it's known as a Single Jump. This first move would of course qualify as a single jump, since it only clears one peg. Move #2 of the solution, shown in the next graphic to the right, is also a single jump having the newly selected jumping peg hop upwards into the vacated peg-hole created after the first move. To aid in memorizing these first two moves we've selected the title 'The First T'. This is because, much like identifying constellations, when viewed as a whole the two consecutive movements vaguely appear to draw a T with their movements. And since it's labeled as the first T, perhaps we'll perform another maneuver similar to this in the not so distant future.
Moves 3 and 4 : The First Back and Forth
Now we've cleared a total of two pegs from the board, and are ready to move on to the next two moves. Move #3 is yet another single jump, with the target peg leaping to the right and claiming another unwitting victim. Move #4 is a single jump as well, this time to the left, where we actually have the target peg jumping over the peg that we just used on the previous turn. Perhaps the little guy had landed with a smug look on his face or something similar, but whatever the case he is re-jumped in the very next move. Having successfully cleared two more pegs, we've now moved a total of 4 pegs into the captured column to date. We've labeled these two moves as 'The First Back and Forth', since when viewed as a whole they seem to be spitefully jumping each other back and forth. Our investigative powers might further deduce that another back and forth maneuver may be looming on the horizon.
Moves 5 and 6 : The Second T (Reverse)
As suspected, the fifth and sixth moves of our solution once again attempt to form a T-like pattern with their captures, this time in a somewhat backwards effect as compared to the previous movements. Move #5 shows our target peg jumping to the left in a single-move capture, followed by Move #6 where the target peg jumps upward to pick off its prey, again with only one jump for the move. Up to this point in the solution, we've captured six pegs with a total of six moves. This is an excellent spot to pause and memorize the previous actions up to here since the moves have all been single jumps and you only need to remember where to start your jumps and in which direction you'll be capturing the pegs. In the upcoming moves, we'll actually start capturing multiple pegs in the same 'move' so once you've mastered the first six moves it's onward to more satisfying conquests.
Moves 7 and 8: Set-up For A Double Jump
The first move in this group is actually a set-up move for the next, insidiously placing the first active peg into position for a double homicide following its action. In Move #7 we have the target peg performing a down-jump to capture its peg. However, in Move #8 we see that this ill-advised move has actually left this fellow in the line-of-fire for the first Double Jump of the game. Move #8 is a two-jump sequence with the same starting peg, so even though two jumps occur the sequence only counts as one move as previously discussed. The target peg first jumps to the right, and then in one fail swoop again jumps another peg with an upward jump immediately afterwards. In a one-two punch, two pegs are KO'd at once. The poor peg that did the jumping in the seventh move must not be that pleased with unknowingly setting himself up to be part of the surprising double jump in Move #8. With renewed blood-lust, we'll now move on to an even more tasty set-up where two more victims cheerfully put themselves in harms way.
Moves 9 and 10 : The Waterfall Setup
We've named these two moves 'The Waterfall Setup'. This is because when viewed as a whole the two moves cascade down the board together in a very pleasing and easy-to-remember sequence. Move #9 has the target peg performing a down-jump, and once the jumped peg is removed from the board Move #10 follows up in a similar manner, jumping downwards as well just above the previous move and chopping off another peg in these two separate Single Jumps. Taking a look at the board now, you might be able to get a feel for the possibility of a much larger jumping sequence than we've become accustomed to, even larger than the previous Double Jump maneuver. Since it's not called the Waterfall Setup by accident, we can assume that these two pegs are in for some rougher waters on the very next move. In fact, it's time for a couple of sweep-and-clears that will wipe the board of a large number of pegs and move us that much closer to a fully-solved board.
Moves 11 and 12 : The Backwards U and The Lazy L
Triangle Peg Board Game Online
Move #11 starts off the carnage with a devastating quintuple jump, capturing five pegs with five jumps in the same move. Following the arrows originating from our target peg, we see that it begins by down-jumping two pegs in a row before jumping to the left (taking the third peg) and then back up with two up-jumps to complete the five-capture sequence. Just like that, in one sequence we've captured almost half as many pegs than we had in the previous ten moves. And we're not finished. Move #12 keeps the killing spree alive by activating the target peg with a triple jump, first a single down-jump into a double-jump to the right. We've labeled the eleventh move 'The Backwards U' since the jumps have the effect of drawing the letter U backwards across the board, and we're calling the twelfth move 'The Lazy L' since it somewhat resembles an L that has laid down for a quick nap. We're aware that it would have to be a backwards L for this description to be appropriate but we'd like to see you come up with names for peg-jumping sequences. Pay no attention to the man behind the curtain!
Moves 13 and 14 : The Second Back and Forth (Reverse)
Settling down for a brief moment, we now come upon a set of rather boring single jumps that provide a calming down period following our previous gluttonous feeding frenzy. Move #13 shows a single-jump to the left by our target peg, followed up by Move #14 where another single-jump (this time in the opposite direction) occurs. Hey, this must be 'The Second Back and Forth' maneuver we discussed quite a few moves ago. It's good to see the prediction actually came true. And since we've come to an easy-to-remember breaking point in the action, this a great place to stop and memorize to. And yes, you have to memorize the solution since solving the board is not nearly as impressive of a feat when you have to use your laptop to demonstrate your mind mastery. After all, you can find anything on the interweb, especially at interesting sites such as ChessandPoker.com created, owned and operated by James Yates :)
Moves 15 and 16 : The Two Double Jump Setups
We are now approaching the completion of our solution, and it's time once again to require two pegs to walk the plank in preparation for a multi-jump mutiny. We'll be doing so with double jumps this time, with Move #15 and #16 both performing their indicated maneuvers as shown here. After completing the two double-jump sequences, the board takes on a very pleasing aesthetic. All of the remaining pegs are evenly spaced about the board, and we can visualize what will likely occur next. It is both impressive and quite amazing that Mr. Bergholt arrived at this beautiful, brilliant solution so many years ago by hand. Such efficiency is very admirable even by todays computer-driven standards. Now, it's time to solve Peg Solitaire and put this once mysterious, but still enduring, puzzle to rest.
Triangle Board With Pegs
Moves 17 and 18 : There's No Place Like Home
In the penultimate preparation move, we'll once again perform a well-calculated quintuple jump. In Move #17 our target peg starts its journey across the board by jumping twice to the right, followed up by one down-jump, a single left-jump and finally the last up-jump of the game. /james-bond-007-legends-pc-game-cheats.html. The final move of the puzzle, Move #18 has us completing our journey by making the final jump downwards into the center square, exactly as we had planned when we began our solution 32 pegs ago. Take your time to work through the solution until you understand not only the mechanics of how it worked but also the underlying concepts of set-up and follow-through. These factors make it possible to solve games and puzzles of even more lofty difficulty. Good luck with your solutions and thanks for visiting us!
ChessandPoker.com Browsing Options
Thank you for reading this featured game article! Please select one of the links below to continue navigating the Chess and Poker Dot Com website. Let us know if we can be of any further help. Good luck and happy gaming!
Game Strategy Guides More strategy guides and game solutions are waiting for you on our homepage!
Discuss this article Visit the game forums and chat with our knowledgeable community members.
Shop for games Browse our store and find some great savings on pretty cool merchandise.
Read our Blog for site updates and commentary on a variety of interesting subjects.
Contact us to make a suggestion, ask a question or comment on this article.
Make a Donation to the ChessandPoker.com website at your convenience.
Triangle Peg Board Game Solution
Copyright © 2003James Yates All Rights Reserved. Article written by James Yates, founder and owner of the ChessandPoker.com website. Please review our Terms of Use page for information concerning the use of this website.