In computer science, the exact cover problem is a decision problem to determine if an exact cover exists. The exact cover problem is NP-complete[1] and is one of Karp's 21 NP-complete problems.[2] The exact cover problem is a kind of constraint satisfaction problem.
I have been reading examples of exact cover problems such as the n-queens, sudoku, etc but cant seem to understand how a problem can be exact.