Implement a recursive backtracking algorithm in Java, that finds a solution to this puzzle. The solution can be stored as a sequence of boards: one for each move. The board should be implemented as a Java class with an internal 7x7 matrix (two dimensional array). In the backtracking algorithm you must compute all possible jumps for a given situation.
Your program might include a class called Puzzle which includes the following methods:
1. findSolution (int move): Backtracking algorithm to solve the puzzle. move - current number of move, first move must be 1
2. main ():Starts the backtracking algorithm and prints out the solution as the sequence of all resulting intermediate board situation.
3. print (): print current situation of the board.
4. constructor : creates a new puzzle instance with empty solution and initial start position of all pegs.
12 freelancers estão ofertando em média $148 para este trabalho
Yes, can be done with simple recursion. And 2D is best for storage as its described. Relevant Skills and Experience Expert java programmer. Proposed Milestones $150 CAD - Milestone
Leave this project in good hands ;) Habilidades y experiencia relevante 4 years of experience in Java and I have friends with a brilliant mind to solve this puzzle Htos propuestos $155 CAD - Complete development