Issue #141 is completed

Author: Hamid Gasmi

4-np-complete-problems/1-np_complete_problems/sudokusolver.py

@@ -49,9 +49,9 @@ def exactly_one_of(literals):
         k = int(puzzle[i - 1][j - 1])
         assert(k in digits)
         #[i,j] already contains k:
-        clauses.append(varnum(i, j, k))
+        clauses.append([varnum(i, j, k)])
 
-with open('temp.cnf', 'w') as f:
+with open('tmp.cnf', 'w') as f:
     f.write("p cnf {} {}\n".format(999, len(clauses)))
     for c in clauses:
         c.append(0)
@@ -78,3 +78,6 @@ def exactly_one_of(literals):
                             break
 
                 print("")
+
+os.remove("tmp.sat")
+os.remove("tmp.cnf")