I'm investigating Sudoku Inequality puzzles. In particular whether there is any relationship between G
, the minimum
number of givens required for fixing a solution (in the standard 9x9 Sudoku puzzle), and R
, the number of relationships required to fix a solution for Sudoku Inequality.
So it would be very useful to have a sample set of 100 or so sample grids with various G
The most useful format would be simply the givens, eg:
- Code: Select all
Can anyone help?