Java Programming: Recursive Backtracking for Peg Solitaire

Consider the Peg Solitaire game demonstrated in class and found online. A constrained grid is presented with locations where pegs may be present or absent. A move consists of a peg A jumping over a peg B which is directly above, below, to the left, or to the right of peg A. Peg A lands in the adjacent spot in the same direction. Peg A must land on a spot where there is no peg and within the specified constraints. Peg B is removed and play continues until no moves are possible. The player wins if a single peg remains in the center of the 7 x 7 grid We represent a peg with the symbol and an empty spot with the symbol O.The four kinds of moves that can be made are depicted below. The "before" and "after" pictures are separated with : Bottom peg jumps up, top peg jumps down, left peg jumps right, right peg jumps left. Here are three example starting conditions that you will be expected to solve Standard Rhombus Consider the Peg Solitaire game demonstrated in class and found online. A constrained grid is presented with locations where pegs may be present or absent. A move consists of a peg A jumping over a peg B which is directly above, below, to the left, or to the right of peg A. Peg A lands in the adjacent spot in the same direction. Peg A must land on a spot where there is no peg and within the specified constraints. Peg B is removed and play continues until no moves are possible. The player wins if a single peg remains in the center of the 7 x 7 grid We represent a peg with the symbol and an empty spot with the symbol O.The four kinds of moves that can be made are depicted below. The "before" and "after" pictures are separated with : Bottom peg jumps up, top peg jumps down, left peg jumps right, right peg jumps left. Here are three example starting conditions that you will be expected to solve Standard Rhombus