The goal was to create an algorithm capable of generating multiple valid sudoku grids and use choco-solver to create three constraint programming models that would help us assess each grid and rate them with a difficulty. For instance, if the best model can't solve the grid without backtracking, then it means the grid has a diabolic difficulty.

• Maven installed with version 3.9 or higher

• Java 17 installed

mvn clean compile exec:java