In this project, an heuristic and an exact algorithm using backtracking were implemented to solve the Sudoku problem.
For the heuristic algorithm, the Largest-First heuristic models the game on a graph and uses the Graph Coloring Problem to solve it, using the decreasing order of vertices by degree for graph coloring, iterating between them and coloring with the smallest available color.
cd exact-algorithm/src/
orcd heuristic/src/
orcd meta-heuristic/src/
g++ sudokuSolution.cpp
./a.out < ../../database/dataset.csv
- Camila Duarte
- Ranna Raabe