| Main Page - Back |
|
From sudokuwiki.org, the puzzle solver's site |
| The first diagram shows a possible pattern or template. It is in fact the first such pattern given an empty board and placement from top left to bottom right. On an empty board there are 46,656 different patterns which is why we use this when most cells are filled. Every placement of N reduces the number of patterns by a factor of 9. | ![]() The First Pattern Overlay |
| In this relatively simple example all the 3s are shown. We can start from the top block which contains just two threes, so the total number of overlays will be two. | ![]() Just the 3s shown |
| I have coloured the two patterns here. Try and find another pattern which picks a 3 for every row, columns and box. It should be impossible. | ![]() The two possible patterns |
| It helps to label the patterns "a", "b", "c" and so on against the candidate number. In this case we are only looking at number 3 so "a" and "b" are appropriate. Now here is the magic of POM. Those cells with "ab" must contain that number - we have found solutions. Those cells with no "a" or "b" (marked with a dash) cannot contain a 3. | ![]() The Overlay |