- Code: Select all
`. . 2 | . . 7 | . 6 5`

. 3 . | 2 . 9 | 1 . .

5 . . | . . . | . . .

-------+-------+------

. 7 . | 8 . . | . 1 .

. . . | . 1 . | 7 . .

2 6 . | . . . | . 8 3

-------+-------+------

. 1 . | . 2 . | 4 . .

4 . . | 5 . 8 | . . 1

7 . . | . . 1 | . 5 6

Load this puzzle into Simple Sudoku and press F11 -- at one point it will find these eight tactics one right after the other:

1) Naked Single

2) Locked Candidates (1)

3) Locked Candidates (2)

4) Swordfish

5) Naked Pairs

6) Naked Triples

7) X-Wing

8) XY-Wing

Sadman Sudoku and Sudoku Susser find the same string of tactics (though reporting a hidden pair rather than a naked triple, making identical eliminations).

The challenge is to post a puzzle here, which when evaluated by any of these three solvers, includes the longest possible string of consecutive tactics, all of which are different.

(Simple Sudoku will not find forcing chains longer than an xy-wing and many mixed forcing chains will not be found by any of these solvers -- but if your puzzle includes a forcing chain -- or any other tactic beyond the scope of these solvers -- that is at the end of the sequence of tactics, it counts.)