Shadow Sudoku: Two pairs of sudoku with an additional condition imposed that the corresponding cells of both the sudoku's can't be the same number.
- Made a
nxnsudoku pair solver(solving 2 shadow sudoku's) using SAT(Boolean Satisfiability Problem). - An
nxnMaximal-Sudoku Pair Generator, which generates a pair of maximal shadow sudokus. Maximal Sudoku means that if any number is additional removed from the sudoku, there won't exist a unique solution(i.e., the pair will have multiple solutions).
- Created our own SAT solver using two methods, DPLL and Semantic Tableau. Implemented both the approaches in
C++.