puzzle stringclasses 30
values | row int64 3 10 | column int64 3 10 | level stringclasses 3
values | original_data unknown | id int64 0 189 | observation unknown | answer unknown | idx int64 0 189 | rules stringclasses 30
values | ref_observation unknown | image stringlengths 16 24 | answer_image stringlengths 23 31 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
mosaic | 7 | 7 | easy | {
"data": [
[
null,
4,
4,
null,
null,
1,
null
],
[
null,
null,
null,
null,
3,
null,
null
],
[
null,
9,
7,
4,
3,
5,
null
],
[
null,
6,
null,
... | 100 | {
"data": [
[
null,
4,
4,
null,
null,
1,
null
],
[
null,
null,
null,
null,
3,
null,
null
],
[
null,
9,
7,
4,
3,
5,
null
],
[
null,
6,
null,
... | [
[
"B",
null,
null,
"B",
null,
null,
null
],
[
"B",
"B",
"B",
"B",
null,
null,
"B"
],
[
"B",
"B",
"B",
null,
null,
"B",
"B"
],
[
"B",
"B",
"B",
null,
null,
"B",
"B"
],
[
null,
null,... | 100 | **Core Rules:**
Color cells black or white so that:
1. Each numbered cell equals the count of black cells in its 3x3 neighborhood (including itself).
2. Unnumbered cells have no direct numeric constraint.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases top-to-bot... | {
"data": [
[
null,
4,
5,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
0
],
[
2,
null,
null,
3,
null
],
[
null,
null,
4,
... | figs/mosaic_100.png | figs/mosaic_100_answer.png |
mosaic | 7 | 7 | hard | {
"data": [
[
null,
2,
null,
2,
null,
5,
null
],
[
4,
5,
4,
null,
6,
6,
3
],
[
3,
null,
5,
null,
6,
6,
null
],
[
3,
null,
null,
null,
... | 101 | {
"data": [
[
null,
2,
null,
2,
null,
5,
null
],
[
4,
5,
4,
null,
6,
6,
3
],
[
3,
null,
5,
null,
6,
6,
null
],
[
3,
null,
null,
null,
... | [
[
"B",
null,
null,
null,
"B",
"B",
null
],
[
null,
"B",
null,
null,
"B",
"B",
"B"
],
[
"B",
"B",
"B",
"B",
"B",
null,
null
],
[
null,
null,
null,
"B",
null,
"B",
"B"
],
[
null,
"B"... | 101 | **Core Rules:**
Color cells black or white so that:
1. Each numbered cell equals the count of black cells in its 3x3 neighborhood (including itself).
2. Unnumbered cells have no direct numeric constraint.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases top-to-bot... | {
"data": [
[
null,
4,
5,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
0
],
[
2,
null,
null,
3,
null
],
[
null,
null,
4,
... | figs/mosaic_101.png | figs/mosaic_101_answer.png |
mosaic | 10 | 10 | easy | {
"data": [
[
4,
5,
null,
null,
null,
null,
1,
null,
2,
null
],
[
null,
null,
7,
null,
null,
2,
null,
3,
null,
null
],
[
6,
8,
7,
6,
null,
nul... | 102 | {
"data": [
[
4,
5,
null,
null,
null,
null,
1,
null,
2,
null
],
[
null,
null,
7,
null,
null,
2,
null,
3,
null,
null
],
[
6,
8,
7,
6,
null,
nul... | [
[
"B",
"B",
"B",
null,
null,
null,
null,
null,
"B",
null
],
[
"B",
"B",
null,
"B",
"B",
null,
null,
"B",
null,
null
],
[
"B",
"B",
"B",
"B",
null,
"B",
null,
"B",
null,
null
],
[
"... | 102 | **Core Rules:**
Color cells black or white so that:
1. Each numbered cell equals the count of black cells in its 3x3 neighborhood (including itself).
2. Unnumbered cells have no direct numeric constraint.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases top-to-bot... | {
"data": [
[
null,
4,
5,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
0
],
[
2,
null,
null,
3,
null
],
[
null,
null,
4,
... | figs/mosaic_102.png | figs/mosaic_102_answer.png |
mosaic | 10 | 10 | hard | {
"data": [
[
null,
null,
2,
null,
3,
3,
3,
null,
2,
null
],
[
null,
5,
null,
4,
null,
3,
null,
2,
null,
null
],
[
3,
5,
2,
null,
null,
null,
... | 103 | {
"data": [
[
null,
null,
2,
null,
3,
3,
3,
null,
2,
null
],
[
null,
5,
null,
4,
null,
3,
null,
2,
null,
null
],
[
3,
5,
2,
null,
null,
null,
... | [
[
"B",
null,
"B",
null,
"B",
"B",
null,
"B",
null,
null
],
[
"B",
null,
"B",
null,
"B",
null,
null,
"B",
null,
null
],
[
"B",
null,
null,
null,
null,
null,
null,
null,
null,
"B"
],
[
... | 103 | **Core Rules:**
Color cells black or white so that:
1. Each numbered cell equals the count of black cells in its 3x3 neighborhood (including itself).
2. Unnumbered cells have no direct numeric constraint.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases top-to-bot... | {
"data": [
[
null,
4,
5,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
0
],
[
2,
null,
null,
3,
null
],
[
null,
null,
4,
... | figs/mosaic_103.png | figs/mosaic_103_answer.png |
nonograms | 5 | 5 | normal | {
"row_black_runs": [
[
1
],
[
3
],
[
3
],
[
4
],
[
2
]
],
"col_black_runs": [
[
2,
1
],
[
1,
2
],
[
4
],
[
2
],
[
1
]
]
} | 104 | {
"row_black_runs": [
[
1
],
[
3
],
[
3
],
[
4
],
[
2
]
],
"col_black_runs": [
[
2,
1
],
[
1,
2
],
[
4
],
[
2
],
[
1
]
]
} | [
[
"B",
null,
null,
null,
null
],
[
"B",
"B",
"B",
null,
null
],
[
null,
null,
"B",
"B",
"B"
],
[
"B",
"B",
"B",
"B",
null
],
[
null,
"B",
"B",
null,
null
]
] | 104 | **Core Rules:**
Fill some cells black so that:
1. Each row matches its row clues: clue numbers are lengths of consecutive black-cell runs in that row.
2. Each column matches its column clues: clue numbers are lengths of consecutive black-cell runs in that column.
3. Multiple runs in one row/column must be separated by ... | {
"row_black_runs": [
[
2
],
[
3
],
[
1
],
[
2,
2
],
[
1,
2
]
],
"col_black_runs": [
[
4
],
[
2,
2
],
[
1
],
[
2
],
[
2
]
]
} | figs/nonograms_104.png | figs/nonograms_104_answer.png |
nonograms | 10 | 10 | normal | {
"row_black_runs": [
[
4,
2,
1
],
[
1,
3
],
[
1,
4
],
[
4
],
[
5
],
[
1
],
[
3,
1
],
[
4,
2
],
[
7
],
[
7
]
],
"col_black_runs": [
[
... | 105 | {
"row_black_runs": [
[
4,
2,
1
],
[
1,
3
],
[
1,
4
],
[
4
],
[
5
],
[
1
],
[
3,
1
],
[
4,
2
],
[
7
],
[
7
]
],
"col_black_runs": [
[
... | [
[
"B",
"B",
"B",
"B",
null,
"B",
"B",
null,
null,
"B"
],
[
null,
"B",
null,
null,
null,
"B",
"B",
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
"B",
"B",
"B",
"B",
null
],
[
nu... | 105 | **Core Rules:**
Fill some cells black so that:
1. Each row matches its row clues: clue numbers are lengths of consecutive black-cell runs in that row.
2. Each column matches its column clues: clue numbers are lengths of consecutive black-cell runs in that column.
3. Multiple runs in one row/column must be separated by ... | {
"row_black_runs": [
[
2
],
[
3
],
[
1
],
[
2,
2
],
[
1,
2
]
],
"col_black_runs": [
[
4
],
[
2,
2
],
[
1
],
[
2
],
[
2
]
]
} | figs/nonograms_105.png | figs/nonograms_105_answer.png |
norinori | 6 | 6 | normal | {
"data": [
[
0,
1,
1,
1,
1,
2
],
[
0,
3,
4,
1,
2,
2
],
[
0,
3,
4,
5,
5,
2
],
[
0,
3,
6,
5,
5,
2
],
[
3,
3,
6,
6,
... | 106 | {
"data": [
[
0,
1,
1,
1,
1,
2
],
[
0,
3,
4,
1,
2,
2
],
[
0,
3,
4,
5,
5,
2
],
[
0,
3,
6,
5,
5,
2
],
[
3,
3,
6,
6,
... | [
[
"S",
"S",
null,
null,
"S",
"S"
],
[
null,
null,
"S",
null,
null,
null
],
[
null,
null,
"S",
null,
"S",
null
],
[
"S",
"S",
null,
null,
"S",
null
],
[
null,
null,
"S",
"S",
null,
... | 106 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_106.png | figs/norinori_106_answer.png |
norinori | 6 | 6 | hard | {
"data": [
[
0,
1,
2,
2,
2,
3
],
[
0,
1,
2,
2,
2,
3
],
[
0,
1,
0,
4,
5,
5
],
[
0,
0,
0,
4,
6,
5
],
[
0,
0,
4,
4,
... | 107 | {
"data": [
[
0,
1,
2,
2,
2,
3
],
[
0,
1,
2,
2,
2,
3
],
[
0,
1,
0,
4,
5,
5
],
[
0,
0,
0,
4,
6,
5
],
[
0,
0,
4,
4,
... | [
[
null,
null,
"S",
"S",
null,
"S"
],
[
null,
"S",
null,
null,
null,
"S"
],
[
null,
"S",
null,
"S",
"S",
null
],
[
null,
null,
"S",
null,
null,
"S"
],
[
"S",
null,
"S",
null,
null,
... | 107 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_107.png | figs/norinori_107_answer.png |
norinori | 8 | 8 | normal | {
"data": [
[
0,
1,
1,
1,
2,
2,
3,
3
],
[
0,
0,
4,
1,
5,
2,
2,
2
],
[
0,
0,
4,
4,
5,
5,
5,
2
],
[
0,
0,
4,
6,
6,
... | 108 | {
"data": [
[
0,
1,
1,
1,
2,
2,
3,
3
],
[
0,
0,
4,
1,
5,
2,
2,
2
],
[
0,
0,
4,
4,
5,
5,
5,
2
],
[
0,
0,
4,
6,
6,
... | [
[
"S",
"S",
null,
"S",
"S",
null,
"S",
"S"
],
[
null,
null,
"S",
null,
null,
"S",
null,
null
],
[
null,
null,
"S",
null,
null,
"S",
null,
null
],
[
null,
null,
null,
"S",
"S",
null,
... | 108 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_108.png | figs/norinori_108_answer.png |
norinori | 8 | 8 | hard | {
"data": [
[
0,
0,
0,
0,
1,
1,
1,
1
],
[
0,
2,
2,
0,
3,
3,
1,
1
],
[
0,
4,
4,
0,
3,
1,
1,
5
],
[
4,
4,
4,
6,
3,
... | 109 | {
"data": [
[
0,
0,
0,
0,
1,
1,
1,
1
],
[
0,
2,
2,
0,
3,
3,
1,
1
],
[
0,
4,
4,
0,
3,
1,
1,
5
],
[
4,
4,
4,
6,
3,
... | [
[
null,
null,
null,
"S",
"S",
null,
null,
null
],
[
null,
"S",
"S",
null,
null,
"S",
"S",
null
],
[
"S",
null,
null,
null,
null,
null,
null,
"S"
],
[
"S",
null,
null,
"S",
null,
"S",
... | 109 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_109.png | figs/norinori_109_answer.png |
norinori | 10 | 10 | normal | {
"data": [
[
0,
1,
1,
2,
2,
2,
3,
3,
4,
4
],
[
0,
5,
1,
5,
6,
6,
6,
6,
7,
4
],
[
0,
5,
5,
5,
5,
5,
6,
6,
7,
7
],
... | 110 | {
"data": [
[
0,
1,
1,
2,
2,
2,
3,
3,
4,
4
],
[
0,
5,
1,
5,
6,
6,
6,
6,
7,
4
],
[
0,
5,
5,
5,
5,
5,
6,
6,
7,
7
],
... | [
[
"S",
"S",
null,
"S",
"S",
null,
"S",
"S",
null,
"S"
],
[
null,
null,
"S",
null,
null,
null,
null,
null,
null,
"S"
],
[
"S",
null,
"S",
null,
null,
null,
null,
"S",
"S",
null
],
[
... | 110 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_110.png | figs/norinori_110_answer.png |
norinori | 10 | 10 | hard | {
"data": [
[
0,
0,
0,
0,
1,
1,
1,
2,
3,
3
],
[
4,
0,
0,
5,
6,
6,
1,
2,
2,
2
],
[
4,
4,
5,
5,
6,
7,
2,
2,
2,
2
],
... | 111 | {
"data": [
[
0,
0,
0,
0,
1,
1,
1,
2,
3,
3
],
[
4,
0,
0,
5,
6,
6,
1,
2,
2,
2
],
[
4,
4,
5,
5,
6,
7,
2,
2,
2,
2
],
... | [
[
"S",
null,
null,
"S",
null,
"S",
"S",
null,
"S",
"S"
],
[
"S",
null,
null,
"S",
null,
null,
null,
null,
null,
null
],
[
null,
"S",
"S",
null,
null,
"S",
"S",
null,
null,
null
],
[
... | 111 | **Core Rules:**
Shade some cells so that:
1. Each region contains exactly 2 shaded cells.
2. Every shaded cell belongs to a domino (two orthogonally adjacent shaded cells).
3. Different dominoes cannot touch orthogonally (diagonal touching is allowed).
4. Dominoes may cross region borders.
**Coordinates & Output:**
1.... | {
"data": [
[
0,
0,
1,
1,
1,
2
],
[
0,
0,
0,
3,
3,
2
],
[
0,
4,
0,
0,
3,
3
],
[
4,
4,
5,
5,
7,
3
],
[
4,
5,
5,
6,
... | figs/norinori_111.png | figs/norinori_111_answer.png |
nurikabe | 5 | 5 | easy | {
"data": [
[
3,
null,
null,
3,
null
],
[
null,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null
],
[
null,
null,
... | 112 | {
"data": [
[
3,
null,
null,
3,
null
],
[
null,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null
],
[
null,
null,
... | [
[
null,
"B",
"B",
null,
null
],
[
null,
"B",
null,
"B",
null
],
[
null,
"B",
"B",
"B",
"B"
],
[
"B",
null,
null,
null,
"B"
],
[
"B",
"B",
"B",
"B",
"B"
]
] | 112 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_112.png | figs/nurikabe_112_answer.png |
nurikabe | 7 | 7 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
2,
null,
null,
null,
2,
null
],
[
2,
null,
null,
null,
null,
null,
null
],
[
null,
nul... | 113 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
2,
null,
null,
null,
2,
null
],
[
2,
null,
null,
null,
null,
null,
null
],
[
null,
nul... | [
[
"B",
"B",
"B",
"B",
"B",
"B",
"B"
],
[
"B",
null,
null,
"B",
null,
null,
"B"
],
[
null,
"B",
"B",
"B",
"B",
"B",
"B"
],
[
null,
"B",
null,
null,
null,
null,
null
],
[
"B",
"B",
... | 113 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_113.png | figs/nurikabe_113_answer.png |
nurikabe | 10 | 10 | easy | {
"data": [
[
1,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
6,
null,
null,
null
],
[
null,
null,
null,
... | 114 | {
"data": [
[
1,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
6,
null,
null,
null
],
[
null,
null,
null,
... | [
[
null,
"B",
"B",
"B",
"B",
"B",
"B",
"B",
"B",
"B"
],
[
"B",
null,
null,
null,
null,
null,
null,
"B",
null,
"B"
],
[
"B",
"B",
"B",
"B",
"B",
"B",
"B",
"B",
null,
"B"
],
[
"B",
... | 114 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_114.png | figs/nurikabe_114_answer.png |
nurikabe | 5 | 5 | hard | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
5,
null
],
[
null,
null,
null,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
nul... | 115 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
5,
null
],
[
null,
null,
null,
null,
1
],
[
null,
null,
null,
null,
null
],
[
1,
nul... | [
[
"B",
"B",
"B",
"B",
"B"
],
[
"B",
null,
null,
null,
"B"
],
[
"B",
null,
null,
"B",
null
],
[
"B",
"B",
"B",
"B",
"B"
],
[
null,
"B",
null,
null,
null
]
] | 115 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_115.png | figs/nurikabe_115_answer.png |
nurikabe | 7 | 7 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
2,
null
],
[
null,
null,
4,
null,
null,
null,
null
],
[
null,
... | 116 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
2,
null
],
[
null,
null,
4,
null,
null,
null,
null
],
[
null,
... | [
[
"B",
"B",
"B",
"B",
"B",
"B",
"B"
],
[
"B",
null,
null,
"B",
null,
null,
"B"
],
[
"B",
"B",
null,
null,
"B",
"B",
"B"
],
[
"B",
null,
"B",
"B",
"B",
null,
null
],
[
"B",
"B",
... | 116 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_116.png | figs/nurikabe_116_answer.png |
nurikabe | 10 | 10 | hard | {
"data": [
[
null,
null,
1,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
5,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
... | 117 | {
"data": [
[
null,
null,
1,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
5,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
... | [
[
"B",
"B",
null,
"B",
"B",
"B",
"B",
"B",
"B",
null
],
[
null,
"B",
"B",
null,
"B",
null,
null,
null,
"B",
null
],
[
null,
"B",
null,
null,
"B",
"B",
null,
null,
"B",
null
],
[
nu... | 117 | **Core Rules:**
Color cells black or white so that:
1. Black cells form one orthogonally connected group.
2. No 2x2 block may be entirely black.
3. Each numbered cell belongs to a white island whose size equals that number.
4. Each white island contains exactly one numbered cell.
5. Numbered cells are white.
**Coordin... | {
"data": [
[
1,
null,
null,
null,
null
],
[
null,
1,
null,
null,
2
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
3,
null
],
[
null,
null,
... | figs/nurikabe_117.png | figs/nurikabe_117_answer.png |
renzoku | 4 | 4 | easy | {
"data": [
[
null,
null,
null,
null
],
[
2,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | 118 | {
"data": [
[
null,
null,
null,
null
],
[
2,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | [
[
1,
2,
4,
3
],
[
2,
4,
3,
1
],
[
4,
3,
1,
2
],
[
3,
1,
2,
4
]
] | 118 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_118.png | figs/renzoku_118_answer.png |
renzoku | 5 | 5 | easy | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
2,
4
],
[
null,
null,
null,
null,
null
],
[
null,
... | 119 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
2,
4
],
[
null,
null,
null,
null,
null
],
[
null,
... | [
[
5,
4,
2,
1,
3
],
[
1,
3,
4,
5,
2
],
[
3,
1,
5,
2,
4
],
[
2,
5,
3,
4,
1
],
[
4,
2,
1,
3,
5
]
] | 119 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_119.png | figs/renzoku_119_answer.png |
renzoku | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | 120 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | [
[
1,
4,
5,
3,
2
],
[
3,
5,
1,
2,
4
],
[
5,
2,
4,
1,
3
],
[
4,
3,
2,
5,
1
],
[
2,
1,
3,
4,
5
]
] | 120 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_120.png | figs/renzoku_120_answer.png |
renzoku | 5 | 5 | hard | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
5,
null,
null,
null
],
[
null,
... | 121 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
5,
null,
null,
null
],
[
null,
... | [
[
5,
4,
3,
1,
2
],
[
3,
2,
4,
5,
1
],
[
1,
3,
5,
2,
4
],
[
2,
5,
1,
4,
3
],
[
4,
1,
2,
3,
5
]
] | 121 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_121.png | figs/renzoku_121_answer.png |
renzoku | 7 | 7 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
6,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
4,
nul... | 122 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
6,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
4,
nul... | [
[
7,
1,
3,
5,
6,
2,
4
],
[
5,
2,
6,
4,
1,
7,
3
],
[
6,
4,
1,
2,
5,
3,
7
],
[
4,
6,
5,
3,
7,
1,
2
],
[
2,
5,
7,
6,
3,
4,
1
],
[
3,
7,
2,
1,
... | 122 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_122.png | figs/renzoku_122_answer.png |
renzoku | 7 | 7 | normal | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | 123 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | [
[
5,
2,
3,
1,
6,
4,
7
],
[
7,
4,
2,
6,
1,
3,
5
],
[
3,
1,
6,
5,
7,
2,
4
],
[
6,
7,
1,
3,
4,
5,
2
],
[
2,
6,
5,
4,
3,
7,
1
],
[
4,
3,
7,
2,
... | 123 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_123.png | figs/renzoku_123_answer.png |
renzoku | 7 | 7 | hard | {
"data": [
[
null,
null,
6,
null,
null,
null,
4
],
[
null,
null,
null,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
nul... | 124 | {
"data": [
[
null,
null,
6,
null,
null,
null,
4
],
[
null,
null,
null,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
nul... | [
[
5,
1,
6,
2,
3,
7,
4
],
[
2,
6,
4,
3,
1,
5,
7
],
[
6,
4,
7,
1,
5,
2,
3
],
[
1,
3,
2,
5,
7,
4,
6
],
[
4,
5,
3,
7,
6,
1,
2
],
[
7,
2,
1,
6,
... | 124 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_124.png | figs/renzoku_124_answer.png |
renzoku | 9 | 9 | easy | {
"data": [
[
2,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
null,
9,
null,
nul... | 125 | {
"data": [
[
2,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
null,
9,
null,
nul... | [
[
2,
7,
8,
3,
9,
1,
6,
5,
4
],
[
9,
6,
7,
1,
4,
3,
8,
2,
5
],
[
3,
1,
4,
9,
8,
2,
5,
7,
6
],
[
7,
4,
3,
5,
6,
8,
9,
1,
2
],
[
8,
2,
6,
4,
... | 125 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_125.png | figs/renzoku_125_answer.png |
renzoku | 9 | 9 | normal | {
"data": [
[
null,
null,
null,
null,
null,
9,
6,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
... | 126 | {
"data": [
[
null,
null,
null,
null,
null,
9,
6,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
... | [
[
5,
1,
4,
8,
7,
9,
6,
2,
3
],
[
8,
7,
3,
5,
6,
2,
4,
9,
1
],
[
9,
6,
8,
1,
2,
3,
7,
5,
4
],
[
6,
3,
5,
7,
8,
1,
2,
4,
9
],
[
3,
5,
9,
2,
... | 126 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_126.png | figs/renzoku_126_answer.png |
renzoku | 9 | 9 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
5,
null,
2
],
[
null,
null,
8,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
nul... | 127 | {
"data": [
[
null,
null,
null,
null,
null,
null,
5,
null,
2
],
[
null,
null,
8,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
nul... | [
[
6,
4,
1,
3,
7,
8,
5,
9,
2
],
[
1,
3,
8,
5,
2,
9,
7,
6,
4
],
[
9,
8,
5,
7,
1,
3,
4,
2,
6
],
[
2,
1,
3,
6,
4,
7,
8,
5,
9
],
[
8,
6,
4,
9,
... | 127 | **Core Rules:**
Fill the grid with numbers so that:
1. Numbers are from `1` to grid size `N`.
2. Each row and each column contains each number exactly once.
3. A dot between two orthogonally adjacent cells means their values are consecutive.
4. If no dot is between two orthogonally adjacent cells, their values are not ... | {
"data": [
[
null,
null,
1,
null
],
[
null,
null,
null,
1
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"adjacent": [
[
0,
0.5
],
[
0,
... | figs/renzoku_127.png | figs/renzoku_127_answer.png |
shingoki | 5 | 5 | easy | {
"data": [
[
"B3",
null,
null,
"B5",
"W2",
null
],
[
null,
null,
null,
null,
"B3",
null
],
[
"B2",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 128 | {
"data": [
[
"B3",
null,
null,
"B5",
"W2",
null
],
[
null,
null,
null,
null,
"B3",
null
],
[
"B2",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
1,
2
],
[
2,
2
],
[
3,
2
],
[
3,
3
],
[
2,
3
],
[
1,
3
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
1,
5
],
[
1,
4
],
[
2,... | 128 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_128.png | figs/shingoki_128_answer.png |
shingoki | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"B3",
"B3",
"B2"
],
[
null,
null,
"W2",
null,
null,
null
],
[
null,
"W2",
null,
null,
... | 129 | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"B3",
"B3",
"B2"
],
[
null,
null,
"W2",
null,
null,
null
],
[
null,
"W2",
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
1,
1
],
[
1,
2
],
[
1,
3
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
1,
5
],
[
1,
4
],
[
2,
4
],
[
3,
4
],
[
3,
5
],
[
4,
5
],
[
5,... | 129 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_129.png | figs/shingoki_129_answer.png |
shingoki | 7 | 7 | easy | {
"data": [
[
null,
null,
null,
"B2",
"B2",
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B2",
null,
null,
null,
null,
... | 130 | {
"data": [
[
null,
null,
null,
"B2",
"B2",
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B2",
null,
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
1,
1
],
[
2,
1
],
[
3,
1
],
[
4,
1
],
[
5,
1
],
[
5,
2
],
[
4,
2
],
[
3,
2
],
[
3,
3
],
[
2,
3
],
[
2,
2
],
[
1,
2
],
[
1,... | 130 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_130.png | figs/shingoki_130_answer.png |
shingoki | 7 | 7 | normal | {
"data": [
[
null,
null,
"W3",
null,
null,
null,
null,
null
],
[
null,
null,
"B3",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B2",
null,
"W3",
... | 131 | {
"data": [
[
null,
null,
"W3",
null,
null,
null,
null,
null
],
[
null,
null,
"B3",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B2",
null,
"W3",
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
2,
3
],
[
3,
3
],
[
3,
2
],
[
2,
2
],
[
1,
2
],
[
1,
1
],
[
2,
1
],
[
3,... | 131 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_131.png | figs/shingoki_131_answer.png |
shingoki | 7 | 7 | hard | {
"data": [
[
null,
"B6",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B5",
null,
null,
"B8"
],
[
null,
null,
null,
null,
null,
null,
null,
... | 132 | {
"data": [
[
null,
"B6",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B5",
null,
null,
"B8"
],
[
null,
null,
null,
null,
null,
null,
null,
... | [
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
1,
5
],
[
1,
6
],
[
1,
7
],
[
2,
7
],
[
3,
7
],
[
4,
7
],
[
5,
7
],
[
6,
7
],
[
7,
7
],
[
7,... | 132 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_132.png | figs/shingoki_132_answer.png |
shingoki | 10 | 10 | easy | {
"data": [
[
"B6",
null,
null,
"B7",
null,
null,
null,
null,
"B2",
"B2",
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
"W2"
],
[
null,
... | 133 | {
"data": [
[
"B6",
null,
null,
"B7",
null,
null,
null,
null,
"B2",
"B2",
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
"W2"
],
[
null,
... | [
[
0,
0
],
[
0,
1
],
[
1,
1
],
[
1,
2
],
[
2,
2
],
[
2,
1
],
[
3,
1
],
[
4,
1
],
[
4,
2
],
[
4,
3
],
[
3,
3
],
[
2,
3
],
[
1,
3
],
[
0,
3
],
[
0,... | 133 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_133.png | figs/shingoki_133_answer.png |
shingoki | 10 | 10 | normal | {
"data": [
[
null,
null,
"W4",
null,
null,
null,
null,
null,
null,
null,
"B12"
],
[
null,
null,
null,
"B5",
null,
"B2",
"B4",
"B2",
null,
null,
null
],
[
null,... | 134 | {
"data": [
[
null,
null,
"W4",
null,
null,
null,
null,
null,
null,
null,
"B12"
],
[
null,
null,
null,
"B5",
null,
"B2",
"B4",
"B2",
null,
null,
null
],
[
null,... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
1,
4
],
[
1,
5
],
[
0,
5
],
[
0,
6
],
[
0,
7
],
[
0,
8
],
[
0,
9
],
[
0,
10
],
[
1,
10
],
[
... | 134 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_134.png | figs/shingoki_134_answer.png |
shingoki | 10 | 10 | hard | {
"data": [
[
null,
null,
"W9",
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
"W6",
null,
null,
null,
null,
null
],
[
"B4",
... | 135 | {
"data": [
[
null,
null,
"W9",
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
"W6",
null,
null,
null,
null,
null
],
[
"B4",
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
0,
6
],
[
0,
7
],
[
0,
8
],
[
0,
9
],
[
1,
9
],
[
1,
10
],
[
2,
10
],
[
2,
9
],
[
... | 135 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
The loop must pass through all clue circles, where:
1. `Wk` (white circle): the loop goes straight through the circle.
2. `Bk` (black circle): the loop turns at the circle.
3. The number `k` is the sum of the lengths of ... | {
"data": [
[
"B5",
"W3",
null,
null,
null,
null
],
[
null,
"B2",
"B3",
null,
null,
null
],
[
null,
null,
null,
"W4",
null,
null
],
[
null,
null,
null,
null,
... | figs/shingoki_135.png | figs/shingoki_135_answer.png |
skyscrapers | 4 | 4 | easy | {
"U": [
2,
1,
2,
2
],
"D": [
3,
4,
1,
2
],
"L": [
2,
1,
2,
2
],
"R": [
3,
4,
1,
2
]
} | 136 | {
"U": [
2,
1,
2,
2
],
"D": [
3,
4,
1,
2
],
"L": [
2,
1,
2,
2
],
"R": [
3,
4,
1,
2
]
} | [
[
1,
4,
3,
2
],
[
4,
3,
2,
1
],
[
3,
2,
1,
4
],
[
2,
1,
4,
3
]
] | 136 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_136.png | figs/skyscrapers_136_answer.png |
skyscrapers | 4 | 4 | normal | {
"U": [
null,
null,
null,
null
],
"D": [
null,
null,
null,
null
],
"L": [
null,
null,
2,
null
],
"R": [
null,
1,
null,
3
]
} | 137 | {
"U": [
null,
null,
null,
null
],
"D": [
null,
null,
null,
null
],
"L": [
null,
null,
2,
null
],
"R": [
null,
1,
null,
3
]
} | [
[
2,
3,
4,
1
],
[
3,
2,
1,
4
],
[
1,
4,
2,
3
],
[
4,
1,
3,
2
]
] | 137 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_137.png | figs/skyscrapers_137_answer.png |
skyscrapers | 4 | 4 | hard | {
"U": [
null,
null,
null,
null
],
"D": [
3,
2,
null,
null
],
"L": [
null,
null,
null,
null
],
"R": [
3,
3,
null,
2
]
} | 138 | {
"U": [
null,
null,
null,
null
],
"D": [
3,
2,
null,
null
],
"L": [
null,
null,
null,
null
],
"R": [
3,
3,
null,
2
]
} | [
[
4,
3,
1,
2
],
[
2,
4,
3,
1
],
[
3,
1,
2,
4
],
[
1,
2,
4,
3
]
] | 138 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_138.png | figs/skyscrapers_138_answer.png |
skyscrapers | 5 | 5 | easy | {
"U": [
1,
2,
4,
2,
3
],
"D": [
2,
2,
1,
4,
3
],
"L": [
1,
3,
3,
2,
2
],
"R": [
4,
2,
1,
3,
2
]
} | 139 | {
"U": [
1,
2,
4,
2,
3
],
"D": [
2,
2,
1,
4,
3
],
"L": [
1,
3,
3,
2,
2
],
"R": [
4,
2,
1,
3,
2
]
} | [
[
5,
4,
2,
3,
1
],
[
2,
1,
3,
5,
4
],
[
3,
2,
1,
4,
5
],
[
1,
5,
4,
2,
3
],
[
4,
3,
5,
1,
2
]
] | 139 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_139.png | figs/skyscrapers_139_answer.png |
skyscrapers | 5 | 5 | normal | {
"U": [
null,
5,
null,
null,
3
],
"D": [
2,
null,
4,
null,
null
],
"L": [
null,
4,
null,
null,
null
],
"R": [
3,
null,
null,
null,
3
]
} | 140 | {
"U": [
null,
5,
null,
null,
3
],
"D": [
2,
null,
4,
null,
null
],
"L": [
null,
4,
null,
null,
null
],
"R": [
3,
null,
null,
null,
3
]
} | [
[
2,
1,
5,
4,
3
],
[
1,
2,
3,
5,
4
],
[
5,
3,
4,
2,
1
],
[
3,
4,
2,
1,
5
],
[
4,
5,
1,
3,
2
]
] | 140 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_140.png | figs/skyscrapers_140_answer.png |
skyscrapers | 5 | 5 | hard | {
"U": [
3,
3,
null,
null,
null
],
"D": [
null,
null,
null,
null,
null
],
"L": [
2,
null,
1,
null,
null
],
"R": [
null,
null,
2,
2,
null
]
} | 141 | {
"U": [
3,
3,
null,
null,
null
],
"D": [
null,
null,
null,
null,
null
],
"L": [
2,
null,
1,
null,
null
],
"R": [
null,
null,
2,
2,
null
]
} | [
[
2,
1,
5,
4,
3
],
[
3,
4,
1,
2,
5
],
[
5,
3,
2,
1,
4
],
[
4,
2,
3,
5,
1
],
[
1,
5,
4,
3,
2
]
] | 141 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_141.png | figs/skyscrapers_141_answer.png |
skyscrapers | 6 | 6 | easy | {
"U": [
1,
5,
4,
3,
2,
2
],
"D": [
3,
1,
2,
3,
2,
4
],
"L": [
1,
3,
4,
2,
3,
2
],
"R": [
3,
1,
2,
3,
2,
4
]
} | 142 | {
"U": [
1,
5,
4,
3,
2,
2
],
"D": [
3,
1,
2,
3,
2,
4
],
"L": [
1,
3,
4,
2,
3,
2
],
"R": [
3,
1,
2,
3,
2,
4
]
} | [
[
6,
2,
1,
3,
5,
4
],
[
4,
1,
3,
5,
2,
6
],
[
2,
3,
4,
6,
1,
5
],
[
5,
4,
6,
1,
3,
2
],
[
1,
5,
2,
4,
6,
3
],
[
3,
6,
5,
2,
4,
1
]
] | 142 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_142.png | figs/skyscrapers_142_answer.png |
skyscrapers | 6 | 6 | normal | {
"U": [
2,
null,
null,
1,
null,
6
],
"D": [
null,
null,
2,
2,
3,
null
],
"L": [
4,
null,
3,
null,
2,
null
],
"R": [
null,
null,
null,
null,
null,
null
]
} | 143 | {
"U": [
2,
null,
null,
1,
null,
6
],
"D": [
null,
null,
2,
2,
3,
null
],
"L": [
4,
null,
3,
null,
2,
null
],
"R": [
null,
null,
null,
null,
null,
null
]
} | [
[
2,
3,
4,
6,
5,
1
],
[
6,
1,
5,
3,
4,
2
],
[
1,
5,
2,
4,
6,
3
],
[
5,
6,
3,
2,
1,
4
],
[
4,
2,
6,
1,
3,
5
],
[
3,
4,
1,
5,
2,
6
]
] | 143 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_143.png | figs/skyscrapers_143_answer.png |
skyscrapers | 6 | 6 | hard | {
"U": [
2,
null,
4,
null,
null,
2
],
"D": [
null,
4,
3,
null,
1,
null
],
"L": [
null,
null,
4,
null,
2,
3
],
"R": [
3,
4,
null,
3,
null,
null
]
} | 144 | {
"U": [
2,
null,
4,
null,
null,
2
],
"D": [
null,
4,
3,
null,
1,
null
],
"L": [
null,
null,
4,
null,
2,
3
],
"R": [
3,
4,
null,
3,
null,
null
]
} | [
[
2,
6,
1,
3,
5,
4
],
[
6,
2,
3,
5,
4,
1
],
[
1,
4,
5,
6,
2,
3
],
[
4,
5,
6,
1,
3,
2
],
[
5,
3,
4,
2,
1,
6
],
[
3,
1,
2,
4,
6,
5
]
] | 144 | **Core Rules:**
Fill the `N x N` grid with building heights `1..N` so that:
1. Each row contains each height exactly once.
2. Each column contains each height exactly once.
3. Side clues indicate how many buildings are visible from that direction.
A taller building hides all shorter buildings behind it.
**Coordinat... | {
"U": [
1,
3,
2,
2
],
"D": [
3,
2,
3,
1
],
"L": [
1,
2,
2,
3
],
"R": [
2,
2,
3,
1
]
} | figs/skyscrapers_144.png | figs/skyscrapers_144_answer.png |
slant | 5 | 5 | easy | {
"data": [
[
null,
null,
0,
null,
0,
null
],
[
2,
null,
null,
null,
null,
null
],
[
null,
null,
2,
null,
null,
2
],
[
2,
2,
null,
2,
1,
null
... | 145 | {
"data": [
[
null,
null,
0,
null,
0,
null
],
[
2,
null,
null,
null,
null,
null
],
[
null,
null,
2,
null,
null,
2
],
[
2,
2,
null,
2,
1,
null
... | [
[
"/",
"\\",
"/",
"\\",
"/"
],
[
"\\",
"\\",
"\\",
"\\",
"\\"
],
[
"/",
"/",
"/",
"/",
"/"
],
[
"\\",
"\\",
"\\",
"\\",
"/"
],
[
"/",
"/",
"\\",
"\\",
"\\"
]
] | 145 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_145.png | figs/slant_145_answer.png |
slant | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
null,
3,
2,
2,
1,
null
],
[
null,
null,
3,
null,
3,
null
],
[
1,
2,
null,
2,
null,
1
],
... | 146 | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
null,
3,
2,
2,
1,
null
],
[
null,
null,
3,
null,
3,
null
],
[
1,
2,
null,
2,
null,
1
],
... | [
[
"\\",
"\\",
"/",
"\\",
"\\"
],
[
"/",
"\\",
"/",
"\\",
"/"
],
[
"/",
"\\",
"\\",
"\\",
"\\"
],
[
"/",
"\\",
"/",
"/",
"\\"
],
[
"/",
"\\",
"\\",
"\\",
"\\"
]
] | 146 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_146.png | figs/slant_146_answer.png |
slant | 7 | 7 | easy | {
"data": [
[
null,
0,
null,
1,
1,
1,
0,
null
],
[
null,
null,
null,
null,
1,
null,
3,
0
],
[
null,
1,
null,
3,
null,
null,
1,
null
],
[
1,
... | 147 | {
"data": [
[
null,
0,
null,
1,
1,
1,
0,
null
],
[
null,
null,
null,
null,
1,
null,
3,
0
],
[
null,
1,
null,
3,
null,
null,
1,
null
],
[
1,
... | [
[
"\\",
"/",
"\\",
"\\",
"\\",
"\\",
"/"
],
[
"/",
"\\",
"\\",
"\\",
"/",
"\\",
"\\"
],
[
"/",
"/",
"/",
"\\",
"\\",
"\\",
"/"
],
[
"/",
"/",
"/",
"\\",
"/",
"\\",
"\\"
],
[
"\\",
... | 147 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_147.png | figs/slant_147_answer.png |
slant | 7 | 7 | normal | {
"data": [
[
null,
null,
null,
1,
1,
null,
null,
null
],
[
null,
2,
1,
3,
2,
1,
3,
null
],
[
1,
null,
null,
2,
2,
2,
null,
null
],
[
null,
... | 148 | {
"data": [
[
null,
null,
null,
1,
1,
null,
null,
null
],
[
null,
2,
1,
3,
2,
1,
3,
null
],
[
1,
null,
null,
2,
2,
2,
null,
null
],
[
null,
... | [
[
"/",
"/",
"/",
"/",
"/",
"\\",
"/"
],
[
"\\",
"\\",
"/",
"\\",
"\\",
"\\",
"\\"
],
[
"\\",
"/",
"/",
"\\",
"\\",
"\\",
"\\"
],
[
"/",
"\\",
"/",
"\\",
"\\",
"\\",
"/"
],
[
"/",
"... | 148 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_148.png | figs/slant_148_answer.png |
slant | 10 | 10 | easy | {
"data": [
[
null,
null,
null,
2,
null,
null,
1,
null,
null,
null,
0
],
[
null,
4,
null,
null,
1,
2,
null,
null,
1,
null,
null
],
[
2,
null,
3,
... | 149 | {
"data": [
[
null,
null,
null,
2,
null,
null,
1,
null,
null,
null,
0
],
[
null,
4,
null,
null,
1,
2,
null,
null,
1,
null,
null
],
[
2,
null,
3,
... | [
[
"\\",
"/",
"/",
"\\",
"\\",
"\\",
"\\",
"/",
"\\",
"\\"
],
[
"/",
"\\",
"/",
"\\",
"/",
"/",
"\\",
"\\",
"\\",
"/"
],
[
"\\",
"\\",
"\\",
"\\",
"\\",
"\\",
"\\",
"/",
"/",
"/"
],
[
... | 149 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_149.png | figs/slant_149_answer.png |
slant | 10 | 10 | normal | {
"data": [
[
null,
1,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
3,
1,
null,
1,
2,
3,
null,
1,
null
],
[
1,
2,
3,
... | 150 | {
"data": [
[
null,
1,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
3,
1,
null,
1,
2,
3,
null,
1,
null
],
[
1,
2,
3,
... | [
[
"\\",
"\\",
"/",
"\\",
"/",
"/",
"\\",
"/",
"/",
"\\"
],
[
"/",
"/",
"/",
"/",
"\\",
"/",
"\\",
"\\",
"\\",
"\\"
],
[
"/",
"/",
"\\",
"/",
"/",
"\\",
"\\",
"/",
"/",
"\\"
],
[
"\... | 150 | **Core Rules:**
Place exactly one diagonal in every cell (`/` or `\\`) so that:
1. Each numbered dot has exactly that many incident diagonal segments.
2. The drawn segments must not form any closed loop.
**Coordinates & Output:**
1. Dot coordinates use `(row, col)` on an `(N+1) x (N+1)` point grid.
2. Cell coordinates... | {
"data": [
[
null,
1,
1,
null,
1,
1
],
[
null,
null,
null,
1,
null,
null
],
[
1,
3,
null,
null,
null,
null
],
[
2,
null,
null,
3,
null,
1
],
... | figs/slant_150.png | figs/slant_150_answer.png |
slitherlink | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
1,
null
],
[
2,
null,
1,
1,
null
],
[
2,
null,
2,
null,
null
],
[
1,
2,
0,
2,
null
],
[
null,
3,
3,
3,
... | 151 | {
"data": [
[
null,
null,
null,
1,
null
],
[
2,
null,
1,
1,
null
],
[
2,
null,
2,
null,
null
],
[
1,
2,
0,
2,
null
],
[
null,
3,
3,
3,
... | [
[
3,
2
],
[
3,
1
],
[
2,
1
],
[
1,
1
],
[
0,
1
],
[
0,
0
],
[
1,
0
],
[
2,
0
],
[
3,
0
],
[
4,
0
],
[
5,
0
],
[
5,
1
],
[
4,
1
],
[
4,
2
],
[
5,... | 151 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_151.png | figs/slitherlink_151_answer.png |
slitherlink | 10 | 10 | normal | {
"data": [
[
null,
3,
2,
null,
null,
null,
2,
2,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3,
null,
3,
null
],
[
null,
3,
2,
null,
3,
... | 152 | {
"data": [
[
null,
3,
2,
null,
null,
null,
2,
2,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3,
null,
3,
null
],
[
null,
3,
2,
null,
3,
... | [
[
3,
2
],
[
2,
2
],
[
2,
1
],
[
2,
0
],
[
1,
0
],
[
0,
0
],
[
0,
1
],
[
1,
1
],
[
1,
2
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
0,
6
],
[
0,... | 152 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_152.png | figs/slitherlink_152_answer.png |
slitherlink | 5 | 5 | hard | {
"data": [
[
3,
2,
null,
2,
null
],
[
null,
null,
2,
null,
null
],
[
1,
2,
1,
3,
2
],
[
2,
3,
null,
null,
null
],
[
null,
2,
3,
3,
... | 153 | {
"data": [
[
3,
2,
null,
2,
null
],
[
null,
null,
2,
null,
null
],
[
1,
2,
1,
3,
2
],
[
2,
3,
null,
null,
null
],
[
null,
2,
3,
3,
... | [
[
3,
1
],
[
3,
2
],
[
4,
2
],
[
5,
2
],
[
5,
3
],
[
4,
3
],
[
4,
4
],
[
5,
4
],
[
5,
5
],
[
4,
5
],
[
3,
5
],
[
2,
5
],
[
1,
5
],
[
0,
5
],
[
0,... | 153 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_153.png | figs/slitherlink_153_answer.png |
slitherlink | 10 | 10 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
3,
null
],
[
3,
null,
2,
2,
null,
null,
null,
null,
1,
null
],
[
null,
null,
2,
3,
2,
... | 154 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
3,
null
],
[
3,
null,
2,
2,
null,
null,
null,
null,
1,
null
],
[
null,
null,
2,
3,
2,
... | [
[
2,
5
],
[
2,
4
],
[
3,
4
],
[
3,
3
],
[
2,
3
],
[
1,
3
],
[
1,
4
],
[
0,
4
],
[
0,
5
],
[
0,
6
],
[
0,
7
],
[
1,
7
],
[
1,
8
],
[
0,
8
],
[
0,... | 154 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_154.png | figs/slitherlink_154_answer.png |
slitherlink | 7 | 7 | normal | {
"data": [
[
3,
null,
1,
null,
null,
null,
null
],
[
1,
null,
null,
null,
null,
null,
2
],
[
null,
3,
0,
2,
null,
null,
3
],
[
null,
null,
1,
... | 155 | {
"data": [
[
3,
null,
1,
null,
null,
null,
null
],
[
1,
null,
null,
null,
null,
null,
2
],
[
null,
3,
0,
2,
null,
null,
3
],
[
null,
null,
1,
... | [
[
2,
2
],
[
2,
1
],
[
3,
1
],
[
3,
2
],
[
4,
2
],
[
5,
2
],
[
5,
3
],
[
4,
3
],
[
4,
4
],
[
3,
4
],
[
2,
4
],
[
2,
3
],
[
1,
3
],
[
0,
3
],
[
0,... | 155 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_155.png | figs/slitherlink_155_answer.png |
slitherlink | 7 | 7 | hard | {
"data": [
[
3,
null,
null,
null,
null,
null,
3
],
[
1,
2,
1,
null,
1,
2,
null
],
[
2,
3,
null,
2,
null,
null,
2
],
[
3,
null,
null,
2,
... | 156 | {
"data": [
[
3,
null,
null,
null,
null,
null,
3
],
[
1,
2,
1,
null,
1,
2,
null
],
[
2,
3,
null,
2,
null,
null,
2
],
[
3,
null,
null,
2,
... | [
[
3,
0
],
[
4,
0
],
[
4,
1
],
[
5,
1
],
[
5,
2
],
[
6,
2
],
[
6,
1
],
[
6,
0
],
[
7,
0
],
[
7,
1
],
[
7,
2
],
[
7,
3
],
[
7,
4
],
[
6,
4
],
[
6,... | 156 | **Core Rules:**
Draw lines between dots to form a single closed loop without crossings or branches.
Each clue number indicates how many loop edges surround that cell.
**Coordinates & Output:**
1. Dot coordinates are integer `(row, col)`.
2. Clue coordinates are half-integer cell centers `(row+0.5, col+0.5)`.
3. Top-le... | {
"data": [
[
null,
null,
null,
null,
null
],
[
2,
null,
2,
null,
2
],
[
null,
null,
null,
3,
0
],
[
null,
null,
2,
null,
2
],
[
null,
1,
null,
... | figs/slitherlink_156.png | figs/slitherlink_156_answer.png |
starbattle1 | 5 | 5 | normal | {
"data": [
[
0,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1
],
[
2,
2,
3,
1,
1
],
[
2,
3,
3,
4,
4
],
[
3,
3,
3,
3,
4
]
]
} | 157 | {
"data": [
[
0,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1
],
[
2,
2,
3,
1,
1
],
[
2,
3,
3,
4,
4
],
[
3,
3,
3,
3,
4
]
]
} | [
[
"S",
null,
null,
null,
null
],
[
null,
null,
null,
"S",
null
],
[
null,
"S",
null,
null,
null
],
[
null,
null,
null,
null,
"S"
],
[
null,
null,
"S",
null,
null
]
] | 157 | **Core Rules (1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Each region contains exactly 1 star.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. ... | {
"data": [
[
0,
0,
0,
0,
0
],
[
0,
0,
0,
1,
1
],
[
2,
3,
3,
1,
4
],
[
2,
3,
3,
1,
4
],
[
2,
1,
1,
1,
4
]
]
} | figs/starbattle1_157.png | figs/starbattle1_157_answer.png |
starbattle1 | 6 | 6 | normal | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
0,
0,
1,
1
],
[
2,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
3,
1
],
[
2,
0,
3,
3,
... | 158 | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
0,
0,
1,
1
],
[
2,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
3,
1
],
[
2,
0,
3,
3,
... | [
[
null,
"S",
null,
null,
null,
null
],
[
null,
null,
null,
null,
"S",
null
],
[
"S",
null,
null,
null,
null,
null
],
[
null,
null,
"S",
null,
null,
null
],
[
null,
null,
null,
null,
nu... | 158 | **Core Rules (1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Each region contains exactly 1 star.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. ... | {
"data": [
[
0,
0,
0,
0,
0
],
[
0,
0,
0,
1,
1
],
[
2,
3,
3,
1,
4
],
[
2,
3,
3,
1,
4
],
[
2,
1,
1,
1,
4
]
]
} | figs/starbattle1_158.png | figs/starbattle1_158_answer.png |
starbattle1 | 6 | 6 | hard | {
"data": [
[
0,
0,
0,
0,
0,
1
],
[
2,
2,
2,
0,
3,
1
],
[
2,
4,
4,
3,
3,
1
],
[
2,
4,
5,
3,
1,
1
],
[
2,
5,
5,
3,
... | 159 | {
"data": [
[
0,
0,
0,
0,
0,
1
],
[
2,
2,
2,
0,
3,
1
],
[
2,
4,
4,
3,
3,
1
],
[
2,
4,
5,
3,
1,
1
],
[
2,
5,
5,
3,
... | [
[
null,
null,
null,
null,
"S",
null
],
[
"S",
null,
null,
null,
null,
null
],
[
null,
null,
"S",
null,
null,
null
],
[
null,
null,
null,
null,
null,
"S"
],
[
null,
"S",
null,
null,
nul... | 159 | **Core Rules (1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Each region contains exactly 1 star.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. ... | {
"data": [
[
0,
0,
0,
0,
0
],
[
0,
0,
0,
1,
1
],
[
2,
3,
3,
1,
4
],
[
2,
3,
3,
1,
4
],
[
2,
1,
1,
1,
4
]
]
} | figs/starbattle1_159.png | figs/starbattle1_159_answer.png |
starbattle1 | 8 | 8 | normal | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
1,
2
],
[
0,
0,
3,
3,
4,
4,
4,
2
],
[
0,
0,
3,
3,
4,
... | 160 | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
1
],
[
0,
0,
1,
1,
1,
1,
1,
2
],
[
0,
0,
3,
3,
4,
4,
4,
2
],
[
0,
0,
3,
3,
4,
... | [
[
null,
null,
"S",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
"S"
],
[
null,
null,
null,
null,
"S",
null,
null,
null
],
[
null,
"S",
null,
null,
null,
... | 160 | **Core Rules (1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Each region contains exactly 1 star.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. ... | {
"data": [
[
0,
0,
0,
0,
0
],
[
0,
0,
0,
1,
1
],
[
2,
3,
3,
1,
4
],
[
2,
3,
3,
1,
4
],
[
2,
1,
1,
1,
4
]
]
} | figs/starbattle1_160.png | figs/starbattle1_160_answer.png |
starbattle1 | 8 | 8 | hard | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
2
],
[
0,
0,
3,
3,
3,
1,
1,
2
],
[
0,
3,
3,
4,
3,
3,
2,
2
],
[
0,
3,
0,
4,
3,
... | 161 | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
2
],
[
0,
0,
3,
3,
3,
1,
1,
2
],
[
0,
3,
3,
4,
3,
3,
2,
2
],
[
0,
3,
0,
4,
3,
... | [
[
null,
null,
null,
"S",
null,
null,
null,
null
],
[
"S",
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"S",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
... | 161 | **Core Rules (1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Each region contains exactly 1 star.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. ... | {
"data": [
[
0,
0,
0,
0,
0
],
[
0,
0,
0,
1,
1
],
[
2,
3,
3,
1,
4
],
[
2,
3,
3,
1,
4
],
[
2,
1,
1,
1,
4
]
]
} | figs/starbattle1_161.png | figs/starbattle1_161_answer.png |
starbattle2 | 10 | 10 | normal | {
"data": [
[
0,
0,
0,
0,
1,
1,
2,
2,
2,
3
],
[
4,
4,
4,
0,
1,
1,
2,
2,
3,
3
],
[
4,
4,
4,
4,
4,
1,
2,
2,
3,
3
],
... | 162 | {
"data": [
[
0,
0,
0,
0,
1,
1,
2,
2,
2,
3
],
[
4,
4,
4,
0,
1,
1,
2,
2,
3,
3
],
[
4,
4,
4,
4,
4,
1,
2,
2,
3,
3
],
... | [
[
null,
"S",
null,
null,
null,
null,
null,
null,
"S",
null
],
[
null,
null,
null,
"S",
null,
"S",
null,
null,
null,
null
],
[
"S",
null,
null,
null,
null,
null,
null,
"S",
null,
null
],
... | 162 | **Core Rules (2-Star):**
Place stars on the grid so that:
1. Each row contains exactly 2 stars.
2. Each column contains exactly 2 stars.
3. Each region contains exactly 2 stars.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
... | {
"data": [
[
0,
0,
0,
1,
2,
2,
2,
2,
3,
3
],
[
0,
0,
0,
1,
1,
1,
2,
2,
3,
3
],
[
0,
0,
0,
4,
1,
1,
2,
2,
3,
3
],
... | figs/starbattle2_162.png | figs/starbattle2_162_answer.png |
starbattle2 | 10 | 10 | hard | {
"data": [
[
0,
0,
0,
0,
0,
0,
0,
0,
1,
1
],
[
2,
0,
0,
3,
3,
1,
1,
1,
1,
4
],
[
2,
2,
2,
3,
3,
5,
5,
1,
4,
4
],
... | 163 | {
"data": [
[
0,
0,
0,
0,
0,
0,
0,
0,
1,
1
],
[
2,
0,
0,
3,
3,
1,
1,
1,
1,
4
],
[
2,
2,
2,
3,
3,
5,
5,
1,
4,
4
],
... | [
[
null,
null,
null,
null,
"S",
null,
"S",
null,
null,
null
],
[
"S",
null,
null,
null,
null,
null,
null,
null,
"S",
null
],
[
null,
null,
"S",
null,
null,
null,
"S",
null,
null,
null
],
... | 163 | **Core Rules (2-Star):**
Place stars on the grid so that:
1. Each row contains exactly 2 stars.
2. Each column contains exactly 2 stars.
3. Each region contains exactly 2 stars.
4. Stars cannot touch each other, including diagonally.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
... | {
"data": [
[
0,
0,
0,
1,
2,
2,
2,
2,
3,
3
],
[
0,
0,
0,
1,
1,
1,
2,
2,
3,
3
],
[
0,
0,
0,
4,
1,
1,
2,
2,
3,
3
],
... | figs/starbattle2_163.png | figs/starbattle2_163_answer.png |
starbattlex | 6 | 6 | normal | {
"data": [
[
null,
"B",
null,
null,
"B",
"B"
],
[
null,
null,
null,
null,
"B",
"B"
],
[
null,
"B",
null,
null,
null,
"B"
],
[
"B",
null,
"B",
null,
nul... | 164 | {
"data": [
[
null,
"B",
null,
null,
"B",
"B"
],
[
null,
null,
null,
null,
"B",
"B"
],
[
null,
"B",
null,
null,
null,
"B"
],
[
"B",
null,
"B",
null,
nul... | [
[
null,
null,
null,
"S",
null,
null
],
[
"S",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"S",
null
],
[
null,
"S",
null,
null,
null,
null
],
[
null,
null,
null,
null,
nu... | 164 | **Core Rules (Shapeless, 1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Stars cannot touch each other, including diagonally.
4. Black obstacle cells cannot contain stars.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left... | {
"data": [
[
"B",
"B",
null,
null,
"B",
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B",
null
],
[
null,
null,
null,
null,
... | figs/starbattlex_164.png | figs/starbattlex_164_answer.png |
starbattlex | 8 | 8 | normal | {
"data": [
[
"B",
null,
null,
null,
"B",
null,
null,
"B"
],
[
"B",
"B",
null,
null,
null,
null,
null,
"B"
],
[
"B",
null,
"B",
"B",
"B",
null,
"B",
"B"
... | 165 | {
"data": [
[
"B",
null,
null,
null,
"B",
null,
null,
"B"
],
[
"B",
"B",
null,
null,
null,
null,
null,
"B"
],
[
"B",
null,
"B",
"B",
"B",
null,
"B",
"B"
... | [
[
null,
"S",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"S",
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
"S",
null,
null
],
[
"S",
null,
null,
null,
null,
... | 165 | **Core Rules (Shapeless, 1-Star):**
Place stars on the grid so that:
1. Each row contains exactly 1 star.
2. Each column contains exactly 1 star.
3. Stars cannot touch each other, including diagonally.
4. Black obstacle cells cannot contain stars.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left... | {
"data": [
[
"B",
"B",
null,
null,
"B",
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"B",
null
],
[
null,
null,
null,
null,
... | figs/starbattlex_165.png | figs/starbattlex_165_answer.png |
stitches | 5 | 5 | normal | {
"region": [
[
0,
0,
1,
1,
0
],
[
0,
0,
0,
0,
0
],
[
0,
0,
2,
0,
0
],
[
3,
2,
2,
3,
4
],
[
3,
3,
3,
3,
4
]
],
"row_stitch_c... | 166 | {
"region": [
[
0,
0,
1,
1,
0
],
[
0,
0,
0,
0,
0
],
[
0,
0,
2,
0,
0
],
[
3,
2,
2,
3,
4
],
[
3,
3,
3,
3,
4
]
],
"row_stitch_c... | [
[
[
0,
3
],
[
0,
4
]
],
[
[
2,
0
],
[
3,
0
]
],
[
[
2,
1
],
[
2,
2
]
],
[
[
2,
4
],
[
3,
4
]
],
[
[
3,
2
],
[
... | 166 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_166.png | figs/stitches_166_answer.png |
stitches | 5 | 5 | hard | {
"region": [
[
0,
0,
1,
1,
1
],
[
0,
0,
0,
2,
1
],
[
3,
0,
2,
2,
1
],
[
3,
0,
2,
2,
2
],
[
4,
4,
4,
4,
4
]
],
"row_stitch_c... | 167 | {
"region": [
[
0,
0,
1,
1,
1
],
[
0,
0,
0,
2,
1
],
[
3,
0,
2,
2,
1
],
[
3,
0,
2,
2,
2
],
[
4,
4,
4,
4,
4
]
],
"row_stitch_c... | [
[
[
0,
1
],
[
0,
2
]
],
[
[
1,
0
],
[
2,
0
]
],
[
[
1,
2
],
[
1,
3
]
],
[
[
2,
3
],
[
2,
4
]
],
[
[
3,
0
],
[
... | 167 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_167.png | figs/stitches_167_answer.png |
stitches | 7 | 7 | normal | {
"region": [
[
0,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
0,
1,
1,
2
],
[
0,
0,
0,
0,
0,
0,
2
],
[
3,
3,
0,
0,
2,
2,
2
],
... | 168 | {
"region": [
[
0,
1,
1,
1,
1,
1,
1
],
[
0,
1,
1,
0,
1,
1,
2
],
[
0,
0,
0,
0,
0,
0,
2
],
[
3,
3,
0,
0,
2,
2,
2
],
... | [
[
[
0,
6
],
[
1,
6
]
],
[
[
1,
3
],
[
1,
4
]
],
[
[
2,
5
],
[
2,
6
]
],
[
[
3,
0
],
[
4,
0
]
],
[
[
3,
1
],
[
... | 168 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_168.png | figs/stitches_168_answer.png |
stitches | 7 | 7 | hard | {
"region": [
[
0,
0,
1,
1,
0,
2,
2
],
[
0,
0,
0,
0,
0,
2,
2
],
[
0,
0,
0,
0,
0,
2,
3
],
[
0,
0,
0,
0,
2,
2,
3
],
... | 169 | {
"region": [
[
0,
0,
1,
1,
0,
2,
2
],
[
0,
0,
0,
0,
0,
2,
2
],
[
0,
0,
0,
0,
0,
2,
3
],
[
0,
0,
0,
0,
2,
2,
3
],
... | [
[
[
0,
1
],
[
0,
2
]
],
[
[
1,
4
],
[
1,
5
]
],
[
[
3,
1
],
[
4,
1
]
],
[
[
4,
3
],
[
5,
3
]
],
[
[
4,
4
],
[
... | 169 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_169.png | figs/stitches_169_answer.png |
stitches | 10 | 10 | normal | {
"region": [
[
0,
0,
0,
0,
0,
0,
0,
0,
1,
2
],
[
3,
3,
0,
1,
1,
1,
1,
1,
1,
2
],
[
3,
3,
3,
4,
4,
2,
2,
2,
2,
2
]... | 170 | {
"region": [
[
0,
0,
0,
0,
0,
0,
0,
0,
1,
2
],
[
3,
3,
0,
1,
1,
1,
1,
1,
1,
2
],
[
3,
3,
3,
4,
4,
2,
2,
2,
2,
2
]... | [
[
[
0,
5
],
[
1,
5
]
],
[
[
1,
1
],
[
1,
2
]
],
[
[
1,
3
],
[
2,
3
]
],
[
[
1,
8
],
[
2,
8
]
],
[
[
2,
4
],
[
... | 170 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_170.png | figs/stitches_170_answer.png |
stitches | 10 | 10 | hard | {
"region": [
[
0,
0,
0,
0,
0,
1,
1,
1,
1,
1
],
[
0,
0,
2,
2,
2,
1,
1,
3,
1,
1
],
[
0,
2,
2,
1,
1,
1,
3,
3,
1,
3
]... | 171 | {
"region": [
[
0,
0,
0,
0,
0,
1,
1,
1,
1,
1
],
[
0,
0,
2,
2,
2,
1,
1,
3,
1,
1
],
[
0,
2,
2,
1,
1,
1,
3,
3,
1,
3
]... | [
[
[
0,
4
],
[
0,
5
]
],
[
[
1,
1
],
[
1,
2
]
],
[
[
1,
4
],
[
1,
5
]
],
[
[
1,
6
],
[
1,
7
]
],
[
[
2,
2
],
[
... | 171 | **Core Rules:**
Place stitches so that:
1. Every pair of orthogonally adjacent cells from different regions is connected by exactly one stitch.
2. A stitch connects two orthogonally adjacent holes.
3. Two stitches cannot share a hole.
4. Row and column clues give the exact number of used holes in each hole-row and hole... | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
1,
2,
2,
2
],
[
1,
1,
1,
2,
3
],
[
1,
1,
1,
4,
3
],
[
1,
1,
1,
4,
4
]
],
"row_stitch_c... | figs/stitches_171.png | figs/stitches_171_answer.png |
sudoku | 3 | 3 | easy | {
"data": [
[
3,
null,
null,
null,
null,
null,
4,
null,
null
],
[
null,
4,
5,
null,
2,
1,
null,
null,
null
],
[
1,
null,
null,
null,
7,
null,
null,
... | 172 | {
"data": [
[
3,
null,
null,
null,
null,
null,
4,
null,
null
],
[
null,
4,
5,
null,
2,
1,
null,
null,
null
],
[
1,
null,
null,
null,
7,
null,
null,
... | [
[
3,
2,
7,
5,
9,
8,
4,
6,
1
],
[
9,
4,
5,
6,
2,
1,
7,
8,
3
],
[
1,
6,
8,
4,
7,
3,
9,
2,
5
],
[
5,
7,
9,
2,
8,
6,
3,
1,
4
],
[
4,
8,
3,
7,
... | 172 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_172.png | figs/sudoku_172_answer.png |
sudoku | 3 | 3 | easy | {
"data": [
[
4,
null,
3,
null,
null,
8,
9,
null,
7
],
[
2,
null,
null,
null,
null,
9,
3,
8,
null
],
[
null,
null,
null,
null,
3,
null,
1,
nul... | 173 | {
"data": [
[
4,
null,
3,
null,
null,
8,
9,
null,
7
],
[
2,
null,
null,
null,
null,
9,
3,
8,
null
],
[
null,
null,
null,
null,
3,
null,
1,
nul... | [
[
4,
6,
3,
2,
1,
8,
9,
5,
7
],
[
2,
7,
1,
6,
5,
9,
3,
8,
4
],
[
8,
9,
5,
4,
3,
7,
1,
6,
2
],
[
7,
5,
2,
1,
8,
6,
4,
9,
3
],
[
6,
4,
8,
9,
... | 173 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_173.png | figs/sudoku_173_answer.png |
sudoku | 3 | 3 | normal | {
"data": [
[
null,
null,
null,
null,
null,
3,
6,
9,
null
],
[
null,
null,
null,
null,
null,
2,
4,
null,
5
],
[
null,
null,
4,
null,
null,
9,
null,
... | 174 | {
"data": [
[
null,
null,
null,
null,
null,
3,
6,
9,
null
],
[
null,
null,
null,
null,
null,
2,
4,
null,
5
],
[
null,
null,
4,
null,
null,
9,
null,
... | [
[
1,
2,
7,
4,
5,
3,
6,
9,
8
],
[
3,
6,
9,
1,
8,
2,
4,
7,
5
],
[
8,
5,
4,
7,
6,
9,
3,
2,
1
],
[
4,
1,
2,
8,
3,
7,
5,
6,
9
],
[
7,
3,
6,
9,
... | 174 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_174.png | figs/sudoku_174_answer.png |
sudoku | 3 | 3 | normal | {
"data": [
[
null,
null,
null,
4,
2,
null,
7,
null,
null
],
[
null,
4,
null,
null,
8,
3,
null,
1,
null
],
[
null,
null,
null,
6,
7,
null,
3,
... | 175 | {
"data": [
[
null,
null,
null,
4,
2,
null,
7,
null,
null
],
[
null,
4,
null,
null,
8,
3,
null,
1,
null
],
[
null,
null,
null,
6,
7,
null,
3,
... | [
[
3,
5,
9,
4,
2,
1,
7,
8,
6
],
[
7,
4,
6,
9,
8,
3,
2,
1,
5
],
[
2,
8,
1,
6,
7,
5,
3,
4,
9
],
[
8,
6,
7,
2,
3,
9,
4,
5,
1
],
[
5,
2,
4,
7,
... | 175 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_175.png | figs/sudoku_175_answer.png |
sudoku | 3 | 3 | hard | {
"data": [
[
8,
9,
null,
null,
null,
null,
2,
null,
null
],
[
null,
1,
null,
null,
5,
9,
null,
null,
null
],
[
null,
7,
2,
null,
null,
null,
null,
... | 176 | {
"data": [
[
8,
9,
null,
null,
null,
null,
2,
null,
null
],
[
null,
1,
null,
null,
5,
9,
null,
null,
null
],
[
null,
7,
2,
null,
null,
null,
null,
... | [
[
8,
9,
3,
4,
7,
6,
2,
1,
5
],
[
6,
1,
4,
2,
5,
9,
3,
8,
7
],
[
5,
7,
2,
1,
8,
3,
9,
4,
6
],
[
3,
2,
7,
8,
6,
4,
1,
5,
9
],
[
1,
4,
5,
9,
... | 176 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_176.png | figs/sudoku_176_answer.png |
sudoku | 3 | 3 | hard | {
"data": [
[
null,
null,
8,
null,
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null,
null,
1,
7,
null
],
[
9,
null,
null,
4,
7,
null,
5,
... | 177 | {
"data": [
[
null,
null,
8,
null,
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null,
null,
1,
7,
null
],
[
9,
null,
null,
4,
7,
null,
5,
... | [
[
7,
6,
8,
1,
3,
5,
2,
4,
9
],
[
5,
3,
4,
2,
8,
9,
1,
7,
6
],
[
9,
2,
1,
4,
7,
6,
5,
8,
3
],
[
3,
4,
9,
7,
1,
2,
8,
6,
5
],
[
2,
1,
7,
6,
... | 177 | **Core Rules:**
Fill the grid with numbers so that:
1. Every row contains each value `1..N` exactly once.
2. Every column contains each value `1..N` exactly once.
3. Every subgrid contains each value `1..N` exactly once.
4. Subgrid size is configurable by unit `(r x c)`:
- unit `3` means `3x3` subgrids (classic `9x9... | {
"data": [
[
null,
null,
1,
null,
3,
8,
null,
5,
null
],
[
null,
null,
null,
null,
null,
null,
7,
3,
8
],
[
null,
null,
null,
null,
null,
5,
null,
... | figs/sudoku_177.png | figs/sudoku_177_answer.png |
tents | 6 | 6 | easy | {
"tree": [
[
null,
"T",
null,
null,
null,
null
],
[
null,
null,
"T",
null,
null,
null
],
[
null,
null,
null,
null,
null,
"T"
],
[
null,
"T",
null,
null,
... | 178 | {
"tree": [
[
null,
"T",
null,
null,
null,
null
],
[
null,
null,
"T",
null,
null,
null
],
[
null,
null,
null,
null,
null,
"T"
],
[
null,
"T",
null,
null,
... | [
[
"t",
null,
null,
null,
null,
null
],
[
null,
null,
null,
"t",
null,
"t"
],
[
null,
"t",
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
"t",
null,
nul... | 178 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_178.png | figs/tents_178_answer.png |
tents | 6 | 6 | hard | {
"tree": [
[
"T",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"T",
null
],
[
"T",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 179 | {
"tree": [
[
"T",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"T",
null
],
[
"T",
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | [
[
null,
"t",
null,
null,
null,
null
],
[
null,
null,
null,
"t",
null,
null
],
[
null,
null,
null,
null,
null,
"t"
],
[
"t",
null,
"t",
null,
null,
null
],
[
null,
null,
null,
null,
"t"... | 179 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_179.png | figs/tents_179_answer.png |
tents | 8 | 8 | easy | {
"tree": [
[
null,
"T",
null,
null,
null,
null,
null,
"T"
],
[
null,
null,
null,
null,
"T",
null,
null,
null
],
[
"T",
null,
null,
null,
null,
null,
null,
... | 180 | {
"tree": [
[
null,
"T",
null,
null,
null,
null,
null,
"T"
],
[
null,
null,
null,
null,
"T",
null,
null,
null
],
[
"T",
null,
null,
null,
null,
null,
null,
... | [
[
null,
null,
"t",
null,
null,
null,
"t",
null
],
[
"t",
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
"t",
null,
null,
null
],
[
null,
null,
"t",
null,
null,
n... | 180 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_180.png | figs/tents_180_answer.png |
tents | 8 | 8 | hard | {
"tree": [
[
null,
null,
"T",
null,
null,
null,
null,
null
],
[
"T",
null,
"T",
null,
null,
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null,
null,
... | 181 | {
"tree": [
[
null,
null,
"T",
null,
null,
null,
null,
null
],
[
"T",
null,
"T",
null,
null,
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null,
null,
... | [
[
null,
"t",
null,
null,
null,
null,
null,
"t"
],
[
null,
null,
null,
"t",
null,
null,
null,
null
],
[
"t",
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"t",
null,
null,
"... | 181 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_181.png | figs/tents_181_answer.png |
tents | 10 | 10 | easy | {
"tree": [
[
"T",
null,
null,
"T",
null,
"T",
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
"T",
null
],
[
null,
"T",
null,
... | 182 | {
"tree": [
[
"T",
null,
null,
"T",
null,
"T",
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
"T",
null
],
[
null,
"T",
null,
... | [
[
null,
"t",
null,
null,
"t",
null,
"t",
null,
"t",
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"t",
null,
null,
null,
"t",
null,
null,
"t"
],
... | 182 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_182.png | figs/tents_182_answer.png |
tents | 10 | 10 | hard | {
"tree": [
[
null,
"T",
null,
null,
null,
"T",
null,
null,
null,
null
],
[
"T",
null,
null,
"T",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
... | 183 | {
"tree": [
[
null,
"T",
null,
null,
null,
"T",
null,
null,
null,
null
],
[
"T",
null,
null,
"T",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
... | [
[
null,
null,
"t",
null,
null,
null,
"t",
null,
null,
null
],
[
null,
null,
null,
null,
"t",
null,
null,
null,
null,
null
],
[
"t",
null,
null,
null,
null,
null,
null,
"t",
null,
null
],... | 183 | **Core Rules:**
Place tents on empty cells so that:
1. Each tent is orthogonally adjacent to exactly one tree.
2. Each tree is paired with exactly one tent (1-to-1 pairing).
3. Tents cannot touch each other, including diagonally.
4. Row and column clues indicate exactly how many tents must be placed in that row/column.... | {
"tree": [
[
null,
null,
"T",
null,
null,
"T"
],
[
null,
null,
null,
null,
null,
null
],
[
"T",
"T",
null,
null,
null,
null
],
[
null,
"T",
null,
null,
... | figs/tents_183.png | figs/tents_183_answer.png |
yinyang | 6 | 6 | easy | {
"data": [
[
null,
"W",
null,
null,
null,
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
null,
"B",
"B",
"B",
"B"
],
[
null,
"B",
null,
null,
"... | 184 | {
"data": [
[
null,
"W",
null,
null,
null,
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
null,
"B",
"B",
"B",
"B"
],
[
null,
"B",
null,
null,
"... | [
[
"W",
"W",
"W",
"B",
"B",
"B"
],
[
"W",
"B",
"W",
"W",
"W",
"B"
],
[
"W",
"B",
"B",
"B",
"B",
"B"
],
[
"W",
"B",
"W",
"W",
"B",
"W"
],
[
"W",
"B",
"W",
"B",
"B",
"W"
],
[
... | 184 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_184.png | figs/yinyang_184_answer.png |
yinyang | 6 | 6 | normal | {
"data": [
[
null,
"B",
null,
null,
null,
null
],
[
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
null
],
[
null,
null,
"B",
"B",
... | 185 | {
"data": [
[
null,
"B",
null,
null,
null,
null
],
[
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
null
],
[
null,
null,
"B",
"B",
... | [
[
"B",
"B",
"B",
"W",
"W",
"W"
],
[
"B",
"W",
"B",
"B",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"W",
"W"
],
[
"B",
"W",
"B",
"B",
"B",
"W"
],
[
"B",
"W",
"W",
"W",
"B",
"W"
],
[
... | 185 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_185.png | figs/yinyang_185_answer.png |
yinyang | 6 | 6 | hard | {
"data": [
[
null,
null,
null,
null,
null,
"W"
],
[
null,
null,
"B",
"W",
null,
null
],
[
null,
null,
null,
"W",
"B",
null
],
[
null,
null,
"W",
null,
... | 186 | {
"data": [
[
null,
null,
null,
null,
null,
"W"
],
[
null,
null,
"B",
"W",
null,
null
],
[
null,
null,
null,
"W",
"B",
null
],
[
null,
null,
"W",
null,
... | [
[
"B",
"B",
"B",
"B",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"W",
"W",
"W",
"W"
],
[
"B",
"W",
"B",
"B",
"B",
"W"
],
[
... | 186 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_186.png | figs/yinyang_186_answer.png |
yinyang | 10 | 10 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"W",
null,
null
],
[
null,
null,
"W",
null,
null,
null,
null,
"W",
null,
null
],
[
null,
"B",
"W",
... | 187 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"W",
null,
null
],
[
null,
null,
"W",
null,
null,
null,
null,
"W",
null,
null
],
[
null,
"B",
"W",
... | [
[
"W",
"W",
"W",
"W",
"W",
"W",
"W",
"W",
"W",
"W"
],
[
"W",
"B",
"W",
"B",
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"W",
"B",
"W",
"B",
"B",
"B",
"W",
"W",
"B",
"W"
],
[
"W",
"B",
... | 187 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_187.png | figs/yinyang_187_answer.png |
yinyang | 10 | 10 | normal | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"W",
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
"B",
... | 188 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"W",
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
"B",
... | [
[
"B",
"B",
"B",
"B",
"B",
"B",
"B",
"W",
"W",
"W"
],
[
"B",
"W",
"W",
"W",
"W",
"W",
"B",
"B",
"B",
"W"
],
[
"B",
"B",
"B",
"B",
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"W",
"B",
... | 188 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_188.png | figs/yinyang_188_answer.png |
yinyang | 10 | 10 | hard | {
"data": [
[
"W",
null,
"B",
null,
"W",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
"W",
null,
null,
null,
null
],
[
null,
null,
"B",
... | 189 | {
"data": [
[
"W",
null,
"B",
null,
"W",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
"W",
null,
null,
null,
null
],
[
null,
null,
"B",
... | [
[
"W",
"B",
"B",
"W",
"W",
"W",
"W",
"W",
"W",
"W"
],
[
"W",
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"B",
"W"
],
[
"W",
"B",
"B",
"B",
"B",
"B",
"B",
"W",
"W",
"W"
],
[
"W",
"B",
... | 189 | **Core Rules:**
Color every cell either black (`B`) or white (`W`) so that:
1. All black cells form one orthogonally connected region.
2. All white cells form one orthogonally connected region.
3. No 2x2 block can be all black or all white.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0... | {
"data": [
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"W",
null,
null
],
[
null,
"B",
"W",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B... | figs/yinyang_189.png | figs/yinyang_189_answer.png |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.