This project implements a Sudoku solver using a genetic algorithm. It supports different board sizes and allows experimenting with various genetic operators.
- Solves Sudoku puzzles of size 4x4, 9x9, and 16x16
- Implements three selection methods:
- π― Roulette Selection
- π Tournament Selection
- π Rank Selection
- Supports two crossover methods:
- π One-Point Crossover
- π Two-Point Crossover
- Includes two mutation methods:
- β»οΈ Inversion Mutation
- π² Random Reset Mutation
-
Compile the program:
gcc -o sudoku_solver main.c genetic.c utils.c -lm