Non-consecutive Sudoku puzzle
I’m currently working on a new book of sudoku variants for a major publisher, so have been making lots of new puzzles of different types.  From time to time I’ll probably post again here with some examples of these.

I thought I’d start off with Non-Consecutive Sudoku.  This is a minor variant on Consecutive Sudoku, where all the rules of standard Sudoku apply but there is one additional constraint:

  • Neighbouring squares are not consecutive.  This means there is never a difference of ‘1′ between two edge-adjacent squares (i.e. touching, not including diagonally).

For example, if a square contains ‘3′ then any neighbouring square cannot contain either ‘2′ or ‘4′.

Good luck!