title: How to create a program that solves a Triangular Peg solitare - C++ / Java programming?
body: <p>Honestly, I only knew of such a game recently and I wonder how one can create a solving algorithm using the recursive search method?</p>
  
  <p>There are 15 holes in total in the triangular board. Making that 14 pegs with a total of 13 moves.
  I don't know where to start with this in C++ nor Java. I have studied C++ for an year before. So I'm familiar with the concepts of stacks, linked lists etc.</p>
  
  <p>I just don't know how to start the code. The program firstly asks the user where they want to start (How is this done?)
  Then once it solves it , a certain number of pegs more than just one will be left and the program will ask the user for a better solution (like this until the board is left to just one peg.)</p>
  
  <p>I certainly cannot think of how to make the moves possible ( How do I write a code that "SHOWS" that one peg moves over a hole ,into another?)</p>
  
  <p>I'd love some coding assistance here. It would really be appreciated.</p>