Duality for Sudoku

Abstract

We consider a mathematical model for the classical Sudoku puzzle, which we call the primal problem and introduce a corresponding dual problem. Both problems are constraint satisfaction models and a duality relation between them is proved. Based on these models, we introduce a primal and a dual optimization problem and show weak and strong duality properties.