Solving Latin Squares as Constraint Satisfaction Problems using Backtracking Search with Heuristics
A Latin square is an n x n grid filled with n different symbols (commonly numbers 1 to n), each appearing exactly once in every row and every column.