Apply Greater Sudoku Constraint

In Greater Sudoku, consider two cells cell1 and cell2 in which the cell1 is the lesser cell and cell2 is the greater cell. According to the constraint the lesser cell can only have possibilities that or lesser than the maximum possible value of the Greater cell. Also, the Greater cell can only have possibilities that are greater than the minimum possible value of the lesser cell.

An illustration for the above concept.

Here the values 7,8 are removed from the cell1, since the cell1 can only have the values which are lesser than the maximum possible value '7' of cell2.

Here the values 1,2,4 are removed from the cell2, since the cell2 can only have the values which are greater than the minimum possible value '4' of cell1.

Algorithm Links

• Reducing Block Possibilities
• Finding Unique Possibilities
• Block Overlap Reduction
• Repeated Possibility Reduction
• Combined Possibility Reduction
• Apply Possibility Reduction

Consecutive Sudoku Algorithms

• Apply Consecutive Constraint
• Consecutive Chain Min-Max Reduction
• Consecutive Chain Neighbor Reduction

Greater Sudoku Algorithms

• Apply Greater Sudoku Constraint
• Greater Sudoku Neighbor Reduction
• Greater Sudoku Graph Reduction