Scribd
Upload
209 views2 pages

Introduction Hitori

1) The puzzle Hitori involves shading squares in a grid containing numbers according to three rules: no number can appear more than once in a row or column, shaded squares cannot touch horizontally or vertically, and all unshaded squares must form a single contiguous area. 2) An example shows a five-by-five grid with numbers 1 through 5 and the step-by-step shading according to the rules to find the solution. 3) The rules and example demonstrate that shading is determined by eliminating logical inconsistencies based on the numbers in each row, column, and their proximity to existing shaded squares.

Uploaded by

Kien
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
209 views2 pages

Introduction Hitori

1) The puzzle Hitori involves shading squares in a grid containing numbers according to three rules: no number can appear more than once in a row or column, shaded squares cannot touch horizontally or vertically, and all unshaded squares must form a single contiguous area. 2) An example shows a five-by-five grid with numbers 1 through 5 and the step-by-step shading according to the rules to find the solution. 3) The rules and example demonstrate that shading is determined by eliminating logical inconsistencies based on the numbers in each row, column, and their proximity to existing shaded squares.

Uploaded by

Kien
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

數壹 Hitori

Hitori is a puzzle consists of a square grid with numbers appearing in


all squares. The objective is to shade some squares according to the
rules.

Rules:
1) No number in the white squres appears in a row or column more than
once.
2) Shaded (black) squares do not touch each other vertically or
horizontally (can be in diagonal).
3) All un-shaded (white) squares create a single continuous area.
Example:

2 2 1 5 3

2 3 1 4 5

1 1 1 3 5

1 3 5 4 2

5 4 3 2 1

2 2 1 5 3 2 2 1 5 3 2 2 1 5 3

2 3 1 4 5 2 3 1 4 5 2 3 1 4 5

1 1 1 3 5 1 1 1 3 5 1 1 1 3 5

1 3 5 4 2 1 3 5 4 2 1 3 5 4 2

5 4 3 2 1 5 4 3 2 1 5 4 3 2 1

Stage 1: Stage 2: Stage 3:


Only one ‘1’ is allowed in the Consider there are two ‘2’s There are two ‘4’s and two
third row, since adjacent adjacent to each other in the ‘5’s in the fourth column and
shaded (black) squares do not first row, the ‘2’ not adjacent fifth column respectively,
touch each other, the middle to shaded cells has to be considering white cells
‘1’ must not be shaded. shaded. cannot be separated, the
Similar method is also Consider the second column, lower ‘4’ and the upper ‘5’
applied in the third column. if the ‘3’ on the top is shaded, are shaded.
nonshaded cells will be
separated. Hence the bottom
‘3’ should be shaded.

You might also like