Here's one example, from my local newspaper yesterday:
- Code: Select all
..3|..7|4..
..1|5..|..7
...|21.|..9
---+---+---
34.|.6.|2..
.9.|...|.4.
..7|.2.|.63
---+---+---
5..|.32|...
2..|..4|1..
..4|1..|8..
Solved easily on paper without guessing, without pencilmarks, in about 8 minutes - far from unsolvable by any definition. It needs locked candidates and one naked pair. I would recommend that you study the general sources for solving techniques listed at the top of Mike Barker's post
here and you will learn that there are techniques that are completely logical and manageable by human solvers other than the hidden single. I can also recommend you to get hold of a sudoku program like
Simple Sudoku that can be of great help in the learning process.
If you don't wish to remove your solver,you must at least change the text from saying that the puzzle isn't valid to something like "the puzzle cannot be solved with the techniques used by this solver".
Have fun learning, there's a lot of nice stuff you will discover if you follow my advice!
If you like to solve on the bus, you might also want to read my article on solving without pencilmarks,
here.
RW