when you discard the blocks in a sudoku, then we have the well
known and much analyzed NP-complete "quasigroup completion problem (QCP)".
I turned out, that there is a phase-transition point(PTP)
when about 43% of the grid is filled with clues.
QCPs with randomly filled clues are hardest to solve near the PTP.
Below the PTP almost all QCPs are solvable while above almost
all are unsolvable, when n is large enough.
see e.g.:
http://www.sciencenews.org/articles/20000506/mathtrek.asp
http://www.cs.cornell.edu/gomes/gs-csgc.pdf
How is it with sudokus ? I assume we have similar behaviour here.
Where is the PTP for sudokus ?