Case Study Background - Sudoku

Many algorithms exist to solve all sorts of puzzle. A lot of these have been implemented in software. The reader is invited to seek out alternative solutions and are challenged to provide their own implementation(s). Russell and Norvig [320] provide the necessary background to the history and adaptation of many of these techniques within the AI domain. After introducing the problem, we will briefly discuss Heuristic search [16], Brute Force (exhaustive) and Backtracking [401]. The only mandatory condition for a Sudoku puzzle is that it must have a solution, although it should be solved logically and without guessing or search.