peg solitaire solution algorithm

A game board with 33 holes in cross form is given. Matos uses a tree to represent the pegs instead of a graph and gives computation type for implementing this algorithm with different representations of Peg Solitaire. Since the objective is to have one peg remaining, 31 moves are required. QED. A constrained grid is presented with locations where pegs may be present or absent. '; //get rows and cols getline(input,dummyLine); numRows = dummyLine[0] - '0'; numCols = dummyLine[2] - '0'; pegBoard = new char* [numRows]; //generate starting board from txt file while(!input.eof()){ for(int r=0; r