Programming, Udacity, Nanodegree, Csp, Sudoku.
“ Satisfiablility Problem(SAT),” “Constraint Programming(CP),” “Satisfiability Modulo Theories(SMT)”. In this blog, I will look at CSP using Sudoku. Let us start with the easiest of all — “Generate & Test” This is the brute force option. In this, you generate all the worlds and check every world if