Su.Doku.Es recently posted an article about the Nikoli puzzle called Hitori. So, I figured it was a good opportunity to write about it. A Hitori puzzle presents a grid filled with numbers. To solve the puzzle, you need to black out numbers such that there is only one of each in every row and column. Sound familiar? There are a couple other constraints. Squares that are blacked out can’t be orthogonally adjacent to each other. Also, every square that is not blacked out must be orthoganally adjacent to at least one other square that is not blacked out. Here is an example of a Hitori puzzle from wikipedia.
If you’re interested in a collection of Hitori puzzles that you can play online, I suggest checking the Perplex City site.
Tags: hitori,nikoli,puzzles
