def run_example(sudoku): """ Helper method that converts the specified sudoku to a boolean formula and runs the DPLL algorithm on it. The sudoku must be defined as an array with nine rows, where each for is represented by nine elements (elements can be None for no value or 1 .. 9). """ print "RUNNING EXAMPLE FOR SUDOKU: " printSudoku(sudoku) translation_start = time.time() translation = su.sudoku_translation(sudoku) translation_end = time.time() - translation_start print "TRANSLATION OF SUDOKU: " print translation print "TIME NEEDED FOR TRANSLATION: " + str(translation_end) dpll_start = time.time() solution = dpll.DPLL(translation) dpll_end = time.time() - dpll_start if solution == False: print "Problem is not solvable" else: print "SOLUTION: " + str(solution) print "TIME NEEDED FOR DPLL: " + str(dpll_end) print "TOTAL TIME NEEDED: " + str(translation_end + dpll_end) print "-----------------------------------------------------------------------------------------------------------------\n"
def test_sudoku_translation_1(self): """ Tests the translation of the sudoku problem to a SAT problem. """ sudoku = [[None, '8', None, '1', '6', None, None, None, '7'], ['1', None, '7', '4', None, '3', '6', None, None], ['3', None, None, '5', None, None, '4', '2', None], [None, '9', None, None, '3', '2', '7', None, '4'], [None, None, None, None, None, None, None, None, None], ['2', None, '4', '8', '1', None, None, '6', None], [None, '4', '1', None, None, '8', None, None, '6'], [None, None, '6', '7', None, '1', '9', None, '3'], ['7', None, None, None, '9', '6', None, '4', None]] self.assertIsNotNone(su.sudoku_translation(sudoku), "Invalid sudoku translation, expected not None.")