Minimal number of clues for Sudokus

In this article we will present a universal scheme for calculating the minimal number of clues needed for a generalized Sudoku to be uniquely solvable. By using equivalence partitioning and analyzing uniqueness properties of patterns, we will reduce the search space to a feasible size. As a result, we will present the minimal number for 2 × 4 Sudokus.