Artificial Intelligence CSC 74011 Assignment 2.2 Solving Sudoku using Backtracking Search with MRV and Forward Checking
In this assignment, we solve sudou puzzles by first reducing the domain with AC-3 then passing the remaining domains to a Backtracking search with minimum remaining value and forward checking heuristics.
The search is tested using 400 puzzles from sudokus_start.txt, and solves all 400 of them sucessfully.
| Time (seconds) | |
|---|---|
| Total time: | 61.125 |
| Average time: | 0.1528125 |
| Standard dev: |
|
| Min time: | 0.046875 |
| Max time: | 1.015625 |
Given a sudoku board, the input is a txt file with the board represented as a single line of text, starting from the top-left corner of the board, listed left-to-right, top-to-bottom.
The program is executed as follows
$ python driver_3.py <input_string>
The program prints the solution board as well as outputs a file callled output.txt which will contain the solution to your input.
queue timeit
Nancy Sea