In the well-known Sudoku game, the direct application of basic search methods is inefficient, so Constraint Satisfaction methods have been developed. These methods mainly aim to prune the search space before performing the search in order to make it easier to find the solution. One of these methods is AC3. Apart from the implementation of the previous method, other strategies have been implemented that allow finding the solution more quickly.
The file tableros.txt is the input file. Each sudoku is a line of text.