Genetic Algorithms and Their Effectiveness in NP-Complete Problems: Sudoku

Genetic Algorithms are heuristic algorithms generally used in non-deterministic problems and is popular as it is usable in a variety of situations, to which it may fare, either extremely well or the opposite. This paper aims to introduce genetic algorithms in the context of sudokus as well as provide an example to showcase how effective it is at reaching the optimal solution and to compare how well it does to other, more focused methods.