Jump to content


From Wikipedia, the free encyclopedia
Example of a Hitori puzzle

Hitori (Japanese: "Alone" or "one person"; ひとりにしてくれ Hitori ni shite kure; literally "leave me alone") is a type of logic puzzle published by Nikoli.

Hitori is NP complete.[1]


The same Hitori puzzle, now solved

Hitori is played with a grid of squares or cells, with each cell initially containing a number. The game is played by eliminating squares/numbers and this is done by blacking them out. The objective is to transform the grid to a state wherein all three following rules are true:

  • no row or column can have more than one occurrence of any given number
  • black cells cannot be horizontally or vertically adjacent, although they can be diagonal to one another.
  • the remaining numbered cells must be all connected to each other, horizontally or vertically.

Solving techniques[edit]

  • Once it is determined that a cell cannot be black, some players find it useful to circle the number, as it makes the puzzle easier to read as the solution progresses. Below we assume that this convention is followed.
  • When it is determined that a cell must be black, all orthogonally adjacent cells cannot be black and so can be circled.
  • If a cell has been circled to show that it cannot be black, any cells containing the same number in that row and column must be black.
  • If blacking out a cell would cause a connected non-black area to become separated into several unconnected components, the cell cannot be black and so can be circled.
  • In a sequence of three identical, adjacent numbers, the centre number cannot be black and the cells on either side must be black. The reason is that if one of the end numbers remains non-black this would result in either two adjacent black cells or two cells with the same number in the same row or column, neither of which are allowed. (This is a special case of the next item.)
  • In case of two identical, adjacent numbers, if another cell occurs in the same row or column containing the same number, the latter cell must be black. Otherwise, if it remains non-black, this would result in either two cells with the same number in the same row or column, or two adjacent black cells, neither of which are allowed.
  • Any number that has two identical numbers on opposite sides of itself cannot be black, because one of the two identical numbers must be black, and it cannot be adjacent to another black cell.
  • When two pairs of identical numbers are in a two by two square on the grid, two of them must be black along a diagonal. There are only two possible combinations, and it is sometimes possible to decide which is correct by determining if one variation will cut non-black squares off from the remainder of the grid.
  • When two pairs of identical numbers form a square in the corner of a grid, the corner square and the one diagonally opposite must be black. The alternative would leave the corner square isolated from the other non-black numbers.


Hitori is an original puzzle of Nikoli; it first appeared in Puzzle Communication Nikoli in issue #29 (March 1990).

In media[edit]

See also[edit]


  1. ^ Hearn, Robert A.; Demaine, Erik D. (2009), "Section 9.2: Hitori", Games, Puzzles, and Computation, A K Peters, pp. 112–115
  • Puzzle Cyclopedia, Nikoli, 2004. ISBN.

External links[edit]