Solver App for Android and iPhone Sudoku Solver for Android and iPhone: "Released!
Check out the features and send us your comments on this page:
Sudoku Solver for Mobile Devices.
ooohh! Strategies for Number Puzzles of all kinds Solver 10 Years Old!
Latest Apps

Valid XHTML 4.01 Transitional
Sudoku Solver Please report any bugs. Tested in IE, Firefox, Safari and Chrome.
Feedback: Form and User Comments/Questions Here
Try the beta version?
Candidates can be Edited or Highlighted / Shown
Enter clues or solutions
1 2 3 4 5 6 7 8 9
Check for solved cells   
Show Possibles  
1: Hidden Singles  
2: Naked Pairs/Triples  
3: Hidden Pairs/Triples 
4: Naked Quads 
5: Pointing Pairs  
6: Box/Line Reduction  
Tough Strategies
7: X-Wing  
8: Simple Colouring  
9: Y-Wing  
10: Sword-Fish  
11: XYZ Wing  
Diabolical Strategies
12: X-Cycles  
13: BUG  
14: XY-Chain  
15: 3D Medusa  
16: Jelly-Fish  
17: Unique Rectangles  
18: Extended Unique Rect.  
19: Hidden Unique Rect's  
20: WXYZ Wing  
21: Aligned Pair Exclusion  
Extreme Strategies
22: Grouped X-Cycles  
23: Empty Rectangles  
24: Finned X-Wing  
25: Finned Sword-Fish  
26: Altern. Inference Chains 
27: Sue-de-Coq  
28: Digit Forcing Chains  
29: Nishio Forcing Chains 
30: Cell Forcing Chains  
31: Unit Forcing Chains  
32: Almost Locked Sets  
33: Death Blossom  
34: Pattern Overlay Method  
35: Quad Forcing Chains  
"Trial and Error"
36: Bowman's Bingo 

Show bi-value cells
Show Strong (bi-location) links in
Boxes Rows Columns
1 2 3 4 5 6 7 8 9

Please report any bugs - Thanks.

If you are getting errors please
clear your browser cache
to retrieve the latest script files
Auto Tab Auto Clear
Clues+Solved: 0/81
Pick an example here

Quick help: Using this Solver

Use the "Import" button or type in a Sudoku puzzle in the small board. You can also pick examples from the list above.
Click on Take Step to step through the solution. Unknown squares are filled with 'candidates' - possible solutions.
Any cells that are reduced to one possible candidate are solved.

You can now use the << button to step back one go. Toggling between Take Step and << helps you see the changes.

Pressing "Enter" on the keyboard after clicking on Take Step is a quick way to step through all strategies. Details of any solutions will be written out in the textbox below the big board. Strategies are ordered by complexity. Any that are successful returns the step-through to the start.

Click on the board to highlight sets of numbers. You can edit the sudoku at any time - entering solutions in the small board or editing candidates (Toggle between highlighting and editing using the radio buttons at the top.)

Version 2.04
See Strategy Overview documentation

Coordinate system: Letter/Number rYcX


Free Sudoku and Str8ts for Print

Welcome to my Sudoku page

Since I first studied Sudoku in May 2005 I think I've finally got a handle on this puzzle. My original intention was to prove to myself that a small number of simple strategies existed that could solve every sudoku. How wrong I was. Sudoku has enormous depth and while this solver has grown up enough to crack 99.9% of puzzles there are many weird and wonderful examples that defeat it. The main reason to keep this solver in development is to analyse these difficult ones. To that end I've added new graphical tools and features which I hope you'll enjoy.

Version 1.30 is a major update since I've found a way to include all the advanced strategies in my off-line C++ solver that were simply not possible to program in Javascript. Much still remains in javascript but its mostly user interface stuff now.

I am continuing to document the various strategies myself and many other people have invented. These are available here.

But in many cases progress has out stripped the documentation and I can only provide links to the best resources. I've tried to give credit where credit is due and please update me if I have missed anyone or need to make a correction.

I am now working independently on puzzle creation, especially at

All feedback, comments, arguments, bug reports and strategy ideas are welcome. There is a FEEDBACK form with a column displaying comments and questions. Many thanks to all the people who have done so and helped improve this solver.

Original version 1.01 28th May 2005 - Full version history here

New in version 2.02 (July 2nd 2015)
Re-instate Bi-value Universal Grave

New in version 2.01 (August 25th 2014)
Added a clue+solved cell count; added a show bi-value cells checkbox.

Many people have written to me to comment about multiple solutions for a given Sudoku. There are no logical tricks the solver can use to detect this other than not complete correctly. The only way to check this is to perform a brute force analysis which tests every possible legal placement of a number. Computers are good at this and we now have a new yellow button called "Solution Count". Try this on any Sudoku to check if it has a unique solution.

Detailed help

Use Clear to empty the board before entering your own puzzle. Save will remember the current state of the board so you can Re-load it again (even if you close your browser - you must allow cookies for this to work). Restart applies only to the example puzzles in the list. The current list contains an example puzzle that tests each strategy.

Take Step first displays the possibles or candidates for each unknown cell. These are the numbers that do not contradict any known or solved square. Once these are displayed Take Step will step through other tests and then loop until it can go no further. The first few tests are the most productive and the solver will often loop between them. If any are successful and the board is changed in any way it will go back to the start and "Check for Solved Squares". The reason for this step is to make it easier to spot what's changed. Many of the strategies have knock-on effects which mean that they can't be run back-to-back - it's essential that we return to the basic steps. We go back because we want the easiest solve route.

> The first six tests are the simplest and are required for any sudoku. After that you are allowed to choose which strategies the solver will use. Tick and un-tick the check boxes.

> The order of these advanced strategies - and my inclusion of them in categories 'tough', 'diabolical' and 'extreme' are my personal choice after close study and are roughly in order of complexity. While the logic is different for each you should be aware that there is considerable overlap in their power to solve in certain situations. For example, X-Cycles are a subset of Alternating Inference Chains. If you turn off X-Cycles the same elimination might turn up under AICs. Since March 2010 I have re-worked most chaining strategies to find the best and shortest chains - not necessarily the first one it happens to find. More about what 'best' will be posted as a document.

> All strategies in the list have links to documentation, but its worth describing what the first tests do:

  • Show Possibles (Naked Singles): For each unknown square we eliminate all possibles where those numbers are known in each row, column and box. This may reveal a single candidate in which case we have a solution for that cell.
  • Hidden Singles: If a candidate occurs once only in a row or column or box we can make it the solution to the cell.
  • Test 2: In this test we check for 'naked' Pairs and Triples. For example, if we have two pairs, eg 3-4 and 3-4 in the same row, column or box, then both 3 and 4 must occupy those squares (in what ever order). 3 and 4 can then be eliminated from the rest of the row, column or box.
  • Test 3: This test is for Hidden Pairs, Hidden Triples
  • Test 4: Naked and Hidden Quads - much rarer but simply extends Pairs and Triples.
  • Test 5: See pointing pairs and triples for a full explanation. This test help us eliminate numbers in rows and columns outside the box.
  • Test 6: Box/Line Reduction. We check the box against the rows and columns that intersect it for each number.
If this solver comes up with an error - or it can't be solved, first use the Solution Count button to prove it has only one solution. This uses a fast brute-force algorithm to check for all possible solutions. If it's valid, please use the Email button to send it to I'd be very interested to study examples that can't be solved on this page.

Solver created on 28-May-2005.
This page was last modified on 17-July-2014.
All code and design is copyright and for personal use only and may not be reproduced elsewhere.
Copyright Andrew Stuart @ Syndicated Puzzles Inc, 2005-2014