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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
aquarium | 6 | 6 | easy | {
"region": [
[
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
4,
2,
2,
2
],
[
3,
4,
4,
4,
4,
5
],
[
3,
4,
3,
3... | 0 | {
"region": [
[
0,
1,
1,
1,
1,
1
],
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
4,
2,
2,
2
],
[
3,
4,
4,
4,
4,
5
],
[
3,
4,
3,
3... | [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
"W",
"W",
"W",
null,
null
],
[
null,
null,
"W",
"W",
"W",
"W"
],
[
"W",
"W",
"W",
"W",
"W",
null
],
[
"W",
"W",
"W",
"W",
"W",
null
... | 0 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_0.png | figs/aquarium_0_answer.png |
aquarium | 6 | 6 | normal | {
"region": [
[
0,
0,
1,
1,
2,
2
],
[
0,
3,
1,
1,
1,
1
],
[
3,
3,
1,
1,
4,
1
],
[
5,
5,
4,
4,
4,
1
],
[
5,
6,
7,
7... | 1 | {
"region": [
[
0,
0,
1,
1,
2,
2
],
[
0,
3,
1,
1,
1,
1
],
[
3,
3,
1,
1,
4,
1
],
[
5,
5,
4,
4,
4,
1
],
[
5,
6,
7,
7... | [
[
"W",
"W",
null,
null,
"W",
"W"
],
[
"W",
"W",
null,
null,
null,
null
],
[
"W",
"W",
null,
null,
null,
null
],
[
"W",
"W",
"W",
"W",
"W",
null
],
[
"W",
null,
"W",
"W",
"W",
"W"
... | 1 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_1.png | figs/aquarium_1_answer.png |
aquarium | 6 | 6 | hard | {
"region": [
[
0,
1,
2,
3,
3,
4
],
[
5,
6,
2,
7,
7,
4
],
[
5,
2,
2,
8,
7,
9
],
[
10,
10,
11,
12,
13,
9
],
[
14,
14,
11,... | 2 | {
"region": [
[
0,
1,
2,
3,
3,
4
],
[
5,
6,
2,
7,
7,
4
],
[
5,
2,
2,
8,
7,
9
],
[
10,
10,
11,
12,
13,
9
],
[
14,
14,
11,... | [
[
null,
"W",
null,
null,
null,
null
],
[
null,
"W",
null,
null,
null,
null
],
[
null,
"W",
"W",
"W",
"W",
null
],
[
"W",
"W",
null,
null,
null,
null
],
[
"W",
"W",
"W",
"W",
null,
... | 2 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_2.png | figs/aquarium_2_answer.png |
aquarium | 10 | 10 | easy | {
"region": [
[
0,
0,
0,
0,
0,
0,
1,
1,
2,
2
],
[
3,
3,
0,
0,
0,
0,
4,
1,
2,
2
],
[
5,
3,
3,
0,
0,
4,
4,
1,
2,
2
]... | 3 | {
"region": [
[
0,
0,
0,
0,
0,
0,
1,
1,
2,
2
],
[
3,
3,
0,
0,
0,
0,
4,
1,
2,
2
],
[
5,
3,
3,
0,
0,
4,
4,
1,
2,
2
]... | [
[
"W",
"W",
"W",
"W",
"W",
"W",
null,
null,
null,
null
],
[
"W",
"W",
"W",
"W",
"W",
"W",
"W",
null,
null,
null
],
[
"W",
"W",
"W",
"W",
"W",
"W",
"W",
null,
null,
null
],
[
"W",
... | 3 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_3.png | figs/aquarium_3_answer.png |
aquarium | 10 | 10 | normal | {
"region": [
[
0,
0,
0,
1,
1,
1,
1,
1,
2,
2
],
[
0,
3,
4,
1,
5,
5,
5,
6,
6,
2
],
[
0,
3,
4,
1,
1,
1,
5,
5,
2,
2
]... | 4 | {
"region": [
[
0,
0,
0,
1,
1,
1,
1,
1,
2,
2
],
[
0,
3,
4,
1,
5,
5,
5,
6,
6,
2
],
[
0,
3,
4,
1,
1,
1,
5,
5,
2,
2
]... | [
[
null,
null,
null,
"W",
"W",
"W",
"W",
"W",
null,
null
],
[
null,
null,
null,
"W",
null,
null,
null,
"W",
"W",
null
],
[
null,
null,
null,
"W",
"W",
"W",
null,
null,
null,
null
],
[
... | 4 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_4.png | figs/aquarium_4_answer.png |
aquarium | 10 | 10 | hard | {
"region": [
[
0,
1,
2,
2,
3,
4,
5,
5,
5,
6
],
[
0,
1,
7,
2,
3,
4,
8,
8,
8,
6
],
[
9,
9,
7,
2,
4,
4,
4,
10,
11,
11
... | 5 | {
"region": [
[
0,
1,
2,
2,
3,
4,
5,
5,
5,
6
],
[
0,
1,
7,
2,
3,
4,
8,
8,
8,
6
],
[
9,
9,
7,
2,
4,
4,
4,
10,
11,
11
... | [
[
null,
null,
null,
null,
null,
null,
"W",
"W",
"W",
null
],
[
null,
"W",
null,
null,
null,
null,
"W",
"W",
"W",
null
],
[
null,
null,
null,
null,
"W",
"W",
"W",
null,
"W",
"W"
],
[
... | 5 | **Core Rules:**
Fill some cells as water so that:
1. Each region is either empty or filled up to one consistent water level.
2. If a cell in a region is water, then all cells of that region below it are also water.
3. Row clues indicate exactly how many water cells are in each row.
4. Column clues indicate exactly how ... | {
"region": [
[
0,
0,
0,
1,
1,
1
],
[
0,
2,
2,
3,
3,
1
],
[
0,
0,
2,
2,
3,
1
],
[
4,
0,
0,
3,
3,
3
],
[
4,
5,
5,
5... | figs/aquarium_5.png | figs/aquarium_5_answer.png |
binairo | 6 | 6 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
"W",
null,
"B"
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 6 | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
"W",
null,
"B"
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | [
[
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"W",
"B"
],
[
"W",
"B",
"W",
"B",
"B",
"W"
],
[
"W",
"B",
"B",
"W",
"W",
"B"
],
[
"B",
"W",
"W",
"B",
"W",
"B"
],
[
... | 6 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_6.png | figs/binairo_6_answer.png |
binairo | 6 | 6 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
"W",
null
],
[
null,
null,
"B",
null,
null,
null
],
[
"W",
null,
null,
"W",
... | 7 | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
"W",
null
],
[
null,
null,
"B",
null,
null,
null
],
[
"W",
null,
null,
"W",
... | [
[
"W",
"B",
"W",
"B",
"B",
"W"
],
[
"W",
"B",
"W",
"B",
"W",
"B"
],
[
"B",
"W",
"B",
"W",
"B",
"W"
],
[
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"W",
"B",
"W",
"B"
],
[
... | 7 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_7.png | figs/binairo_7_answer.png |
binairo | 8 | 8 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"W",
"W",
null,
null,
"B"
],
[
"W",
null,
"B",
null,
null,
"W",
"W",
n... | 8 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"W",
"W",
null,
null,
"B"
],
[
"W",
null,
"B",
null,
null,
"W",
"W",
n... | [
[
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"W",
"B",
"W",
"B"
],
[
"W",
"B",
"B",
"W",
"B",
"W",
"W",
"B"
],
[
"W",
"B",
"W",
"B",
"B",
"W",
"B",
"W"
]... | 8 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_8.png | figs/binairo_8_answer.png |
binairo | 8 | 8 | hard | {
"data": [
[
null,
null,
null,
null,
null,
"W",
null,
null
],
[
"B",
null,
"B",
null,
null,
null,
null,
"B"
],
[
"W",
null,
null,
"W",
null,
null,
null,
... | 9 | {
"data": [
[
null,
null,
null,
null,
null,
"W",
null,
null
],
[
"B",
null,
"B",
null,
null,
null,
null,
"B"
],
[
"W",
null,
null,
"W",
null,
null,
null,
... | [
[
"W",
"B",
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"W",
"B",
"W",
"B"
],
[
"W",
"W",
"B",
"W",
"B",
"B",
"W",
"B"
],
[
"B",
"B",
"W",
"B",
"W",
"W",
"B",
"W"
]... | 9 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_9.png | figs/binairo_9_answer.png |
binairo | 10 | 10 | easy | {
"data": [
[
null,
null,
"W",
null,
"W",
"B",
null,
null,
"W",
null
],
[
"B",
null,
"W",
null,
null,
null,
null,
"B",
null,
null
],
[
null,
null,
null,
"... | 10 | {
"data": [
[
null,
null,
"W",
null,
"W",
"B",
null,
null,
"W",
null
],
[
"B",
null,
"W",
null,
null,
null,
null,
"B",
null,
null
],
[
null,
null,
null,
"... | [
[
"W",
"B",
"W",
"B",
"W",
"B",
"W",
"B",
"W",
"B"
],
[
"B",
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"W",
"W"
],
[
"W",
"W",
"B",
"B",
"W",
"B",
"W",
"W",
"B",
"B"
],
[
"B",
"B",
... | 10 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_10.png | figs/binairo_10_answer.png |
binairo | 10 | 10 | hard | {
"data": [
[
null,
null,
null,
null,
null,
"W",
null,
null,
null,
null
],
[
"W",
null,
"W",
null,
null,
"W",
null,
"W",
null,
null
],
[
null,
"B",
null,
... | 11 | {
"data": [
[
null,
null,
null,
null,
null,
"W",
null,
null,
null,
null
],
[
"W",
null,
"W",
null,
null,
"W",
null,
"W",
null,
null
],
[
null,
"B",
null,
... | [
[
"B",
"W",
"B",
"B",
"W",
"W",
"B",
"B",
"W",
"W"
],
[
"W",
"B",
"W",
"B",
"W",
"W",
"B",
"W",
"B",
"B"
],
[
"W",
"B",
"B",
"W",
"B",
"B",
"W",
"W",
"B",
"W"
],
[
"B",
"W",
... | 11 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. All rows are pairwise different, and all columns are pairwise different.
4. Given cells must stay fixed.
**Coordin... | {
"data": [
[
null,
null,
null,
null,
"W",
null
],
[
null,
null,
null,
null,
"W",
null
],
[
null,
"W",
"B",
null,
null,
"W"
],
[
"B",
null,
"B",
null,
n... | figs/binairo_11.png | figs/binairo_11_answer.png |
binairoplus | 6 | 6 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
"B"
],
[
null,
"B",
null,
null,
"W",
null
],
[
null,
"W",
null,
null,
... | 12 | {
"data": [
[
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
"B"
],
[
null,
"B",
null,
null,
"W",
null
],
[
null,
"W",
null,
null,
... | [
[
"B",
"W",
"B",
"B",
"W",
"W"
],
[
"W",
"W",
"B",
"W",
"B",
"B"
],
[
"B",
"B",
"W",
"B",
"W",
"W"
],
[
"B",
"W",
"B",
"W",
"W",
"B"
],
[
"W",
"B",
"W",
"W",
"B",
"B"
],
[
... | 12 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_12.png | figs/binairoplus_12_answer.png |
binairoplus | 6 | 6 | hard | {
"data": [
[
null,
"B",
"B",
"W",
"W",
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 13 | {
"data": [
[
null,
"B",
"B",
"W",
"W",
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | [
[
"W",
"B",
"B",
"W",
"W",
"B"
],
[
"B",
"B",
"W",
"W",
"B",
"W"
],
[
"W",
"W",
"B",
"B",
"W",
"B"
],
[
"B",
"W",
"W",
"B",
"W",
"B"
],
[
"W",
"B",
"B",
"W",
"B",
"W"
],
[
... | 13 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_13.png | figs/binairoplus_13_answer.png |
binairoplus | 8 | 8 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B",
null,
null,
"W",
null,
... | 14 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B",
null,
null,
"W",
null,
... | [
[
"W",
"B",
"B",
"W",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"W"
],
[
"B",
"W",
"B",
"W",
"B",
"W",
"W",
"B"
],
[
"W",
"B",
"B",
"W",
"B",
"B",
"W",
"W"
]... | 14 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_14.png | figs/binairoplus_14_answer.png |
binairoplus | 8 | 8 | hard | {
"data": [
[
null,
"B",
null,
null,
null,
null,
"W",
null
],
[
null,
"B",
null,
null,
null,
null,
"W",
null
],
[
null,
null,
"B",
null,
null,
"B",
null,
... | 15 | {
"data": [
[
null,
"B",
null,
null,
null,
null,
"W",
null
],
[
null,
"B",
null,
null,
null,
null,
"W",
null
],
[
null,
null,
"B",
null,
null,
"B",
null,
... | [
[
"W",
"B",
"B",
"W",
"B",
"W",
"W",
"B"
],
[
"B",
"B",
"W",
"W",
"B",
"W",
"W",
"B"
],
[
"W",
"W",
"B",
"B",
"W",
"B",
"B",
"W"
],
[
"B",
"W",
"W",
"B",
"W",
"B",
"W",
"B"
]... | 15 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_15.png | figs/binairoplus_15_answer.png |
binairoplus | 10 | 10 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"W",
null,
"B",
"W",
null,
"B",
null,
null
],
[
null,
"B",
null,
... | 16 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"W",
null,
"B",
"W",
null,
"B",
null,
null
],
[
null,
"B",
null,
... | [
[
"W",
"W",
"B",
"W",
"W",
"B",
"B",
"W",
"B",
"B"
],
[
"B",
"B",
"W",
"B",
"B",
"W",
"W",
"B",
"W",
"W"
],
[
"W",
"B",
"B",
"W",
"W",
"B",
"B",
"W",
"B",
"W"
],
[
"B",
"W",
... | 16 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_16.png | figs/binairoplus_16_answer.png |
binairoplus | 10 | 10 | hard | {
"data": [
[
null,
null,
"B",
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
null,
null,
null,
"B",
null,
null,
null
],
[
"W",
null,
null,
... | 17 | {
"data": [
[
null,
null,
"B",
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
null,
null,
null,
"B",
null,
null,
null
],
[
"W",
null,
null,
... | [
[
"W",
"W",
"B",
"B",
"W",
"B",
"B",
"W",
"W",
"B"
],
[
"B",
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"W",
"W"
],
[
"W",
"B",
"B",
"W",
"W",
"B",
"W",
"B",
"B",
"W"
],
[
"W",
"W",
... | 17 | **Core Rules:**
Fill every cell with `B` or `W` so that:
1. Each row and each column contain the same number of black and white cells.
2. No row or column has three consecutive cells of the same color.
3. A `=` constraint means the two adjacent cells are the same color.
4. A `x` constraint means the two adjacent cells ... | {
"data": [
[
"W",
null,
null,
null,
null,
null
],
[
"W",
null,
null,
null,
null,
null
],
[
null,
"W",
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
... | figs/binairoplus_17.png | figs/binairoplus_17_answer.png |
futoshiki | 4 | 4 | easy | {
"data": [
[
null,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"horizontal": {
"0.0,1.5": "<",
"0.0,2.5": ">"
},
... | 18 | {
"data": [
[
null,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
],
[
null,
null,
null,
null
]
],
"horizontal": {
"(0,1.5)": "<",
"(0,2.5)": ">"
},
... | [
[
4,
1,
3,
2
],
[
3,
4,
2,
1
],
[
2,
3,
1,
4
],
[
1,
2,
4,
3
]
] | 18 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_18.png | figs/futoshiki_18_answer.png |
futoshiki | 5 | 5 | easy | {
"data": [
[
null,
null,
null,
1,
5
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | 19 | {
"data": [
[
null,
null,
null,
1,
5
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | [
[
4,
3,
2,
1,
5
],
[
3,
4,
1,
5,
2
],
[
2,
1,
5,
3,
4
],
[
1,
5,
4,
2,
3
],
[
5,
2,
3,
4,
1
]
] | 19 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_19.png | figs/futoshiki_19_answer.png |
futoshiki | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | 20 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
3,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
... | [
[
5,
4,
2,
1,
3
],
[
2,
3,
1,
5,
4
],
[
1,
5,
4,
3,
2
],
[
4,
1,
3,
2,
5
],
[
3,
2,
5,
4,
1
]
] | 20 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_20.png | figs/futoshiki_20_answer.png |
futoshiki | 5 | 5 | hard | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
null
],
[
5,
... | 21 | {
"data": [
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
1,
null,
null,
null,
null
],
[
5,
... | [
[
2,
3,
5,
1,
4
],
[
3,
5,
1,
4,
2
],
[
4,
1,
2,
5,
3
],
[
1,
4,
3,
2,
5
],
[
5,
2,
4,
3,
1
]
] | 21 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_21.png | figs/futoshiki_21_answer.png |
futoshiki | 7 | 7 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | 22 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | [
[
7,
2,
3,
6,
5,
4,
1
],
[
5,
1,
6,
3,
2,
7,
4
],
[
3,
7,
1,
4,
6,
2,
5
],
[
4,
5,
2,
1,
7,
3,
6
],
[
6,
4,
7,
2,
1,
5,
3
],
[
1,
3,
5,
7,
... | 22 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_22.png | figs/futoshiki_22_answer.png |
futoshiki | 7 | 7 | normal | {
"data": [
[
null,
4,
null,
null,
null,
6,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
null,
null,
6
],
[
null,
null,
... | 23 | {
"data": [
[
null,
4,
null,
null,
null,
6,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
null,
null,
6
],
[
null,
null,
... | [
[
5,
4,
7,
2,
3,
6,
1
],
[
3,
6,
5,
1,
4,
2,
7
],
[
1,
2,
4,
5,
7,
3,
6
],
[
7,
5,
2,
3,
6,
1,
4
],
[
4,
7,
3,
6,
1,
5,
2
],
[
6,
3,
1,
7,
... | 23 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_23.png | figs/futoshiki_23_answer.png |
futoshiki | 7 | 7 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | 24 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
... | [
[
7,
4,
1,
5,
3,
6,
2
],
[
6,
5,
4,
3,
2,
1,
7
],
[
1,
7,
3,
6,
5,
2,
4
],
[
5,
6,
2,
4,
1,
7,
3
],
[
3,
2,
5,
7,
6,
4,
1
],
[
4,
1,
6,
2,
... | 24 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_24.png | figs/futoshiki_24_answer.png |
futoshiki | 9 | 9 | easy | {
"data": [
[
null,
null,
8,
null,
null,
null,
4,
null,
null
],
[
1,
null,
null,
null,
null,
null,
null,
null,
2
],
[
null,
null,
null,
null,
null,
null,
... | 25 | {
"data": [
[
null,
null,
8,
null,
null,
null,
4,
null,
null
],
[
1,
null,
null,
null,
null,
null,
null,
null,
2
],
[
null,
null,
null,
null,
null,
null,
... | [
[
7,
1,
8,
2,
3,
5,
4,
9,
6
],
[
1,
7,
9,
3,
4,
6,
8,
5,
2
],
[
2,
6,
5,
1,
9,
4,
3,
7,
8
],
[
6,
9,
3,
5,
7,
8,
1,
2,
4
],
[
5,
2,
4,
7,
... | 25 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_25.png | figs/futoshiki_25_answer.png |
futoshiki | 9 | 9 | normal | {
"data": [
[
8,
3,
null,
null,
null,
6,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
nul... | 26 | {
"data": [
[
8,
3,
null,
null,
null,
6,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
nul... | [
[
8,
3,
7,
5,
2,
6,
1,
9,
4
],
[
2,
6,
9,
8,
3,
4,
7,
1,
5
],
[
7,
1,
4,
9,
5,
3,
8,
2,
6
],
[
9,
2,
3,
4,
8,
1,
6,
5,
7
],
[
5,
4,
2,
6,
... | 26 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_26.png | figs/futoshiki_26_answer.png |
futoshiki | 9 | 9 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
8,
null,
null
],
[
null,
null,
6,
null,
3,
nul... | 27 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
8,
null,
null
],
[
null,
null,
6,
null,
3,
nul... | [
[
8,
7,
3,
6,
5,
9,
4,
1,
2
],
[
6,
1,
4,
9,
7,
3,
8,
2,
5
],
[
4,
9,
6,
2,
3,
7,
1,
5,
8
],
[
7,
8,
9,
4,
2,
1,
5,
6,
3
],
[
1,
2,
5,
3,
... | 27 | **Core Rules:**
The numbers are from 1 to the size of the grid (e.g. 1..5 for a 5x5 puzzle).
Each row and column must contain each number exactly once.
The numbers must satisfy all inequality signs.
**Coordinates & Output:**
1. Cell centers are at integer coordinates `(row, col)`.
2. Horizontal inequalities are stored... | {
"data": [
[
null,
null,
null,
4
],
[
null,
null,
null,
null
],
[
null,
null,
2,
null
],
[
3,
null,
null,
1
]
],
"horizontal": {},
"vertical": {
"(0.5,2)": "^",
"(1.5,1)": "^"... | figs/futoshiki_27.png | figs/futoshiki_27_answer.png |
hashi | 7 | 7 | easy | {
"data": [
[
null,
2,
null,
3,
null,
1,
null
],
[
2,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
4,
null,
4
],
[
null,
null,
... | 28 | {
"data": [
[
null,
2,
null,
3,
null,
1,
null
],
[
2,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
4,
null,
4
],
[
null,
null,
... | {
"((0, 1),(0, 3))": 1,
"((0, 1),(4, 1))": 1,
"((0, 3),(0, 5))": 1,
"((0, 3),(6, 3))": 1,
"((1, 0),(6, 0))": 2,
"((2, 4),(2, 6))": 2,
"((2, 4),(5, 4))": 2,
"((2, 6),(6, 6))": 2,
"((6, 0),(6, 3))": 1,
"((6, 3),(6, 6))": 1
} | 28 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_28.png | figs/hashi_28_answer.png |
hashi | 7 | 7 | normal | {
"data": [
[
null,
1,
null,
null,
null,
null,
3
],
[
2,
null,
null,
1,
null,
2,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
5,
null,
nul... | 29 | {
"data": [
[
null,
1,
null,
null,
null,
null,
3
],
[
2,
null,
null,
1,
null,
2,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
5,
null,
nul... | {
"((0, 1),(0, 6))": 1,
"((0, 6),(2, 6))": 2,
"((1, 0),(3, 0))": 2,
"((1, 3),(1, 5))": 1,
"((1, 5),(3, 5))": 1,
"((2, 6),(4, 6))": 1,
"((3, 0),(3, 5))": 1,
"((3, 0),(6, 0))": 2,
"((3, 5),(5, 5))": 1,
"((4, 6),(6, 6))": 1,
"((5, 2),(5, 5))": 1,
"((6, 0),(6, 3))": 2,
"((6, 3),(6, 6))": 1
} | 29 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_29.png | figs/hashi_29_answer.png |
hashi | 7 | 7 | hard | {
"data": [
[
2,
null,
null,
null,
null,
null,
2
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
null,
null,
null,
null,
2
],
[
null,
null,
... | 30 | {
"data": [
[
2,
null,
null,
null,
null,
null,
2
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
null,
null,
null,
null,
2
],
[
null,
null,
... | {
"((0, 0),(0, 6))": 1,
"((0, 0),(4, 0))": 1,
"((0, 6),(2, 6))": 1,
"((2, 1),(2, 6))": 1,
"((4, 0),(4, 6))": 2,
"((4, 0),(6, 0))": 2,
"((4, 6),(6, 6))": 1,
"((6, 0),(6, 4))": 2,
"((6, 4),(6, 6))": 1
} | 30 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_30.png | figs/hashi_30_answer.png |
hashi | 10 | 10 | easy | {
"data": [
[
null,
null,
2,
null,
null,
null,
null,
null,
null,
3
],
[
1,
null,
null,
1,
null,
null,
null,
3,
null,
null
],
[
null,
null,
null,
null,
... | 31 | {
"data": [
[
null,
null,
2,
null,
null,
null,
null,
null,
null,
3
],
[
1,
null,
null,
1,
null,
null,
null,
3,
null,
null
],
[
null,
null,
null,
null,
... | {
"((0, 2),(0, 9))": 1,
"((0, 2),(3, 2))": 1,
"((0, 9),(8, 9))": 2,
"((1, 0),(3, 0))": 1,
"((1, 3),(1, 7))": 1,
"((1, 7),(3, 7))": 2,
"((3, 0),(3, 2))": 1,
"((3, 0),(6, 0))": 1,
"((3, 2),(3, 7))": 1,
"((3, 2),(5, 2))": 1,
"((5, 2),(5, 6))": 1,
"((6, 0),(6, 8))": 2,
"((6, 0),(8, 0))": 2,
"((6... | 31 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_31.png | figs/hashi_31_answer.png |
hashi | 10 | 10 | normal | {
"data": [
[
null,
3,
null,
6,
null,
null,
null,
null,
null,
4
],
[
null,
null,
null,
null,
null,
2,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 32 | {
"data": [
[
null,
3,
null,
6,
null,
null,
null,
null,
null,
4
],
[
null,
null,
null,
null,
null,
2,
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | {
"((0, 1),(0, 3))": 2,
"((0, 1),(3, 1))": 1,
"((0, 3),(0, 9))": 2,
"((0, 3),(3, 3))": 2,
"((0, 9),(2, 9))": 2,
"((1, 5),(3, 5))": 2,
"((2, 7),(2, 9))": 2,
"((2, 7),(5, 7))": 1,
"((2, 9),(4, 9))": 1,
"((3, 1),(3, 3))": 1,
"((3, 1),(6, 1))": 2,
"((3, 3),(3, 5))": 1,
"((3, 3),(5, 3))": 2,
"((3... | 32 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_32.png | figs/hashi_32_answer.png |
hashi | 10 | 10 | hard | {
"data": [
[
null,
null,
3,
null,
null,
null,
null,
null,
null,
2
],
[
2,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
... | 33 | {
"data": [
[
null,
null,
3,
null,
null,
null,
null,
null,
null,
2
],
[
2,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
4,
null,
... | {
"((0, 2),(0, 9))": 1,
"((0, 2),(2, 2))": 2,
"((0, 9),(3, 9))": 1,
"((1, 0),(3, 0))": 2,
"((2, 2),(2, 5))": 2,
"((2, 5),(2, 7))": 2,
"((3, 0),(3, 9))": 1,
"((3, 9),(9, 9))": 2,
"((4, 1),(4, 3))": 1,
"((4, 3),(6, 3))": 1,
"((4, 6),(4, 8))": 2,
"((4, 8),(6, 8))": 1,
"((6, 0),(6, 3))": 2,
"((6... | 33 | **Core Rules:**
Connect numbered islands with bridges so that:
1. Bridges are straight and orthogonal, connecting two distinct islands.
2. Bridges cannot cross other bridges or pass through islands.
3. At most two bridges may connect the same pair of islands.
4. The number on each island equals the total number of inci... | {
"data": [
[
4,
null,
null,
null,
3,
null,
2
],
[
null,
null,
1,
null,
null,
3,
null
],
[
null,
null,
null,
null,
null,
null,
3
],
[
6,
null,
nul... | figs/hashi_33.png | figs/hashi_33_answer.png |
heyawake | 6 | 6 | easy | {
"region": [
[
0,
0,
0,
1,
2,
2
],
[
3,
3,
4,
1,
5,
6
],
[
3,
3,
4,
7,
5,
6
],
[
3,
3,
8,
8,
5,
6
],
[
3,
3,
8,
8... | 34 | {
"region": [
[
0,
0,
0,
1,
2,
2
],
[
3,
3,
4,
1,
5,
6
],
[
3,
3,
4,
7,
5,
6
],
[
3,
3,
8,
8,
5,
6
],
[
3,
3,
8,
8... | [
[
null,
null,
"B",
null,
null,
"B"
],
[
null,
"B",
null,
null,
"B",
null
],
[
null,
null,
null,
"B",
null,
null
],
[
"B",
null,
"B",
null,
null,
"B"
],
[
null,
null,
null,
null,
"B",
... | 34 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_34.png | figs/heyawake_34_answer.png |
heyawake | 6 | 6 | normal | {
"region": [
[
0,
0,
0,
0,
1,
1
],
[
2,
3,
3,
3,
1,
1
],
[
2,
4,
5,
5,
1,
1
],
[
2,
4,
5,
5,
6,
6
],
[
7,
7,
8,
8... | 35 | {
"region": [
[
0,
0,
0,
0,
1,
1
],
[
2,
3,
3,
3,
1,
1
],
[
2,
4,
5,
5,
1,
1
],
[
2,
4,
5,
5,
6,
6
],
[
7,
7,
8,
8... | [
[
null,
null,
null,
"B",
null,
"B"
],
[
null,
"B",
null,
null,
null,
null
],
[
null,
null,
"B",
null,
null,
"B"
],
[
"B",
null,
null,
"B",
null,
null
],
[
null,
null,
null,
null,
"B",
... | 35 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_35.png | figs/heyawake_35_answer.png |
heyawake | 6 | 6 | hard | {
"region": [
[
0,
0,
0,
0,
0,
0
],
[
1,
1,
2,
3,
3,
4
],
[
1,
1,
5,
5,
6,
4
],
[
1,
1,
7,
7,
7,
7
],
[
8,
9,
9,
9... | 36 | {
"region": [
[
0,
0,
0,
0,
0,
0
],
[
1,
1,
2,
3,
3,
4
],
[
1,
1,
5,
5,
6,
4
],
[
1,
1,
7,
7,
7,
7
],
[
8,
9,
9,
9... | [
[
null,
null,
"B",
null,
null,
"B"
],
[
null,
"B",
null,
null,
"B",
null
],
[
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
"B"
],
[
"B",
null,
null,
null,
"B",
... | 36 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_36.png | figs/heyawake_36_answer.png |
heyawake | 8 | 8 | easy | {
"region": [
[
0,
1,
1,
2,
2,
2,
3,
4
],
[
0,
5,
5,
2,
2,
2,
3,
4
],
[
0,
5,
5,
6,
6,
7,
3,
4
],
[
0,
8,
8,
6,
6,
... | 37 | {
"region": [
[
0,
1,
1,
2,
2,
2,
3,
4
],
[
0,
5,
5,
2,
2,
2,
3,
4
],
[
0,
5,
5,
6,
6,
7,
3,
4
],
[
0,
8,
8,
6,
6,
... | [
[
null,
null,
null,
"B",
null,
null,
null,
"B"
],
[
null,
"B",
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
null,
"B",
null
],
[
"B",
null,
null,
null,
"B",
null... | 37 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_37.png | figs/heyawake_37_answer.png |
heyawake | 8 | 8 | normal | {
"region": [
[
0,
0,
1,
1,
2,
2,
2,
2
],
[
0,
0,
3,
3,
3,
4,
5,
6
],
[
7,
8,
3,
3,
3,
9,
9,
6
],
[
7,
8,
3,
3,
3,
... | 38 | {
"region": [
[
0,
0,
1,
1,
2,
2,
2,
2
],
[
0,
0,
3,
3,
3,
4,
5,
6
],
[
7,
8,
3,
3,
3,
9,
9,
6
],
[
7,
8,
3,
3,
3,
... | [
[
"B",
null,
null,
"B",
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
null,
"B",
null
],
[
null,
null,
"B",
null,
null,
"B",
null,
null
],
[
"B",
null,
null,
null,
"B",
null... | 38 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_38.png | figs/heyawake_38_answer.png |
heyawake | 8 | 8 | hard | {
"region": [
[
0,
1,
2,
2,
2,
3,
3,
3
],
[
0,
1,
4,
5,
5,
3,
3,
3
],
[
0,
6,
6,
5,
5,
7,
7,
8
],
[
0,
6,
6,
9,
9,
... | 39 | {
"region": [
[
0,
1,
2,
2,
2,
3,
3,
3
],
[
0,
1,
4,
5,
5,
3,
3,
3
],
[
0,
6,
6,
5,
5,
7,
7,
8
],
[
0,
6,
6,
9,
9,
... | [
[
null,
"B",
null,
null,
"B",
null,
null,
null
],
[
null,
null,
"B",
null,
null,
null,
"B",
null
],
[
null,
"B",
null,
null,
null,
"B",
null,
null
],
[
null,
null,
null,
"B",
null,
nul... | 39 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_39.png | figs/heyawake_39_answer.png |
heyawake | 10 | 10 | easy | {
"region": [
[
0,
0,
0,
1,
2,
3,
3,
3,
4,
4
],
[
0,
0,
0,
5,
2,
6,
6,
6,
4,
4
],
[
7,
8,
8,
8,
2,
9,
10,
10,
11,
12
... | 40 | {
"region": [
[
0,
0,
0,
1,
2,
3,
3,
3,
4,
4
],
[
0,
0,
0,
5,
2,
6,
6,
6,
4,
4
],
[
7,
8,
8,
8,
2,
9,
10,
10,
11,
12
... | [
[
null,
null,
null,
"B",
null,
null,
"B",
null,
null,
null
],
[
"B",
null,
null,
null,
"B",
null,
null,
null,
null,
"B"
],
[
null,
null,
"B",
null,
null,
"B",
null,
"B",
null,
null
],
... | 40 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_40.png | figs/heyawake_40_answer.png |
heyawake | 10 | 10 | normal | {
"region": [
[
0,
1,
2,
2,
2,
2,
3,
3,
4,
4
],
[
0,
5,
5,
5,
6,
6,
3,
3,
4,
4
],
[
0,
7,
7,
7,
8,
8,
3,
3,
9,
10
... | 41 | {
"region": [
[
0,
1,
2,
2,
2,
2,
3,
3,
4,
4
],
[
0,
5,
5,
5,
6,
6,
3,
3,
4,
4
],
[
0,
7,
7,
7,
8,
8,
3,
3,
9,
10
... | [
[
null,
"B",
null,
null,
null,
"B",
null,
null,
null,
null
],
[
null,
null,
null,
"B",
null,
null,
null,
null,
"B",
null
],
[
null,
null,
"B",
null,
"B",
null,
null,
"B",
null,
null
],
... | 41 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_41.png | figs/heyawake_41_answer.png |
heyawake | 10 | 10 | hard | {
"region": [
[
0,
0,
1,
1,
2,
2,
3,
4,
4,
5
],
[
0,
0,
1,
1,
2,
2,
3,
4,
4,
5
],
[
0,
0,
6,
6,
7,
7,
7,
4,
4,
5
]... | 42 | {
"region": [
[
0,
0,
1,
1,
2,
2,
3,
4,
4,
5
],
[
0,
0,
1,
1,
2,
2,
3,
4,
4,
5
],
[
0,
0,
6,
6,
7,
7,
7,
4,
4,
5
]... | [
[
null,
null,
null,
null,
"B",
null,
null,
"B",
null,
null
],
[
null,
"B",
null,
null,
null,
"B",
null,
null,
null,
"B"
],
[
null,
null,
"B",
null,
null,
null,
null,
"B",
null,
null
],
... | 42 | **Core Rules:**
Color cells black or white so that:
1. A numbered region contains exactly that many black cells.
2. Black cells cannot touch orthogonally.
3. Any uninterrupted straight white segment (row/column) cannot pass through more than 2 regions.
4. All white cells are orthogonally connected.
**Coordinates & Out... | {
"region": [
[
0,
1,
1,
1,
2,
2
],
[
3,
3,
3,
3,
2,
2
],
[
4,
4,
5,
6,
6,
7
],
[
8,
8,
8,
6,
6,
7
],
[
8,
8,
8,
9... | figs/heyawake_42.png | figs/heyawake_42_answer.png |
hitori | 5 | 5 | easy | {
"data": [
[
1,
5,
3,
4,
1
],
[
5,
3,
5,
3,
1
],
[
3,
5,
4,
1,
5
],
[
5,
1,
2,
3,
4
],
[
2,
1,
1,
1,
3
]
]
} | 43 | {
"data": [
[
1,
5,
3,
4,
1
],
[
5,
3,
5,
3,
1
],
[
3,
5,
4,
1,
5
],
[
5,
1,
2,
3,
4
],
[
2,
1,
1,
1,
3
]
]
} | [
[
null,
null,
null,
null,
"B"
],
[
"B",
null,
null,
"B",
null
],
[
null,
"B",
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"B",
null
]
] | 43 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_43.png | figs/hitori_43_answer.png |
hitori | 5 | 5 | normal | {
"data": [
[
3,
4,
3,
1,
5
],
[
4,
3,
5,
3,
1
],
[
5,
2,
5,
4,
3
],
[
3,
3,
4,
1,
2
],
[
4,
5,
2,
3,
4
]
]
} | 44 | {
"data": [
[
3,
4,
3,
1,
5
],
[
4,
3,
5,
3,
1
],
[
5,
2,
5,
4,
3
],
[
3,
3,
4,
1,
2
],
[
4,
5,
2,
3,
4
]
]
} | [
[
"B",
null,
null,
null,
null
],
[
null,
null,
null,
"B",
null
],
[
null,
null,
"B",
null,
null
],
[
null,
"B",
null,
"B",
null
],
[
"B",
null,
null,
null,
null
]
] | 44 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_44.png | figs/hitori_44_answer.png |
hitori | 5 | 5 | hard | {
"data": [
[
3,
4,
3,
2,
3
],
[
4,
3,
2,
3,
5
],
[
1,
2,
3,
1,
4
],
[
5,
3,
1,
4,
2
],
[
2,
4,
4,
3,
3
]
]
} | 45 | {
"data": [
[
3,
4,
3,
2,
3
],
[
4,
3,
2,
3,
5
],
[
1,
2,
3,
1,
4
],
[
5,
3,
1,
4,
2
],
[
2,
4,
4,
3,
3
]
]
} | [
[
null,
null,
"B",
null,
"B"
],
[
null,
"B",
null,
null,
null
],
[
null,
null,
null,
"B",
null
],
[
null,
null,
null,
null,
null
],
[
null,
"B",
null,
"B",
null
]
] | 45 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_45.png | figs/hitori_45_answer.png |
hitori | 10 | 10 | easy | {
"data": [
[
5,
1,
2,
8,
7,
1,
4,
9,
8,
9
],
[
8,
2,
10,
4,
9,
3,
6,
9,
1,
8
],
[
1,
7,
7,
8,
4,
4,
9,
2,
9,
5
],... | 46 | {
"data": [
[
5,
1,
2,
8,
7,
1,
4,
9,
8,
9
],
[
8,
2,
10,
4,
9,
3,
6,
9,
1,
8
],
[
1,
7,
7,
8,
4,
4,
9,
2,
9,
5
],... | [
[
null,
null,
null,
"B",
null,
"B",
null,
null,
null,
"B"
],
[
"B",
null,
null,
null,
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
"B",
null,
null,
null,
"B",
null
],
... | 46 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_46.png | figs/hitori_46_answer.png |
hitori | 10 | 10 | normal | {
"data": [
[
1,
2,
5,
7,
3,
2,
1,
9,
4,
7
],
[
2,
1,
7,
3,
5,
9,
8,
10,
6,
4
],
[
4,
3,
4,
2,
4,
7,
1,
5,
9,
1
],... | 47 | {
"data": [
[
1,
2,
5,
7,
3,
2,
1,
9,
4,
7
],
[
2,
1,
7,
3,
5,
9,
8,
10,
6,
4
],
[
4,
3,
4,
2,
4,
7,
1,
5,
9,
1
],... | [
[
null,
"B",
null,
"B",
null,
null,
"B",
null,
"B",
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
null,
"B",
null,
null,
null,
null,
"B"
],
... | 47 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_47.png | figs/hitori_47_answer.png |
hitori | 10 | 10 | hard | {
"data": [
[
2,
8,
5,
7,
3,
2,
10,
5,
4,
1
],
[
9,
2,
8,
2,
10,
1,
2,
7,
3,
2
],
[
4,
9,
4,
1,
10,
3,
8,
4,
10,
2
... | 48 | {
"data": [
[
2,
8,
5,
7,
3,
2,
10,
5,
4,
1
],
[
9,
2,
8,
2,
10,
1,
2,
7,
3,
2
],
[
4,
9,
4,
1,
10,
3,
8,
4,
10,
2
... | [
[
null,
null,
null,
null,
null,
"B",
null,
"B",
null,
null
],
[
null,
"B",
null,
"B",
null,
null,
null,
null,
null,
"B"
],
[
"B",
null,
null,
null,
"B",
null,
null,
"B",
null,
null
],
... | 48 | **Core Rules:**
Shade some cells black so that:
1. In every row, each unshaded number appears at most once.
2. In every column, each unshaded number appears at most once.
3. Black cells cannot touch orthogonally (up/down/left/right).
4. All unshaded (white) cells must form one orthogonally connected group.
**Coordinat... | {
"data": [
[
1,
2,
3,
5,
5
],
[
1,
3,
3,
2,
1
],
[
2,
5,
1,
1,
3
],
[
3,
2,
2,
1,
5
],
[
2,
1,
5,
5,
2
]
]
} | figs/hitori_48.png | figs/hitori_48_answer.png |
jigsawsudoku | 5 | 5 | easy | {
"region": [
[
0,
0,
0,
1,
1
],
[
0,
0,
1,
1,
2
],
[
3,
3,
3,
1,
2
],
[
3,
3,
2,
2,
2
],
[
4,
4,
4,
4,
4
]
],
"data": [
... | 49 | {
"region": [
[
0,
0,
0,
1,
1
],
[
0,
0,
1,
1,
2
],
[
3,
3,
3,
1,
2
],
[
3,
3,
2,
2,
2
],
[
4,
4,
4,
4,
4
]
],
"data": [
... | [
[
2,
5,
4,
3,
1
],
[
3,
1,
2,
4,
5
],
[
4,
3,
1,
5,
2
],
[
5,
2,
3,
1,
4
],
[
1,
4,
5,
2,
3
]
] | 49 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_49.png | figs/jigsawsudoku_49_answer.png |
jigsawsudoku | 5 | 5 | normal | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
0,
0,
1,
2
],
[
3,
3,
0,
1,
2
],
[
3,
4,
4,
4,
2
],
[
3,
3,
4,
4,
2
]
],
"data": [
... | 50 | {
"region": [
[
0,
1,
1,
1,
2
],
[
0,
0,
0,
1,
2
],
[
3,
3,
0,
1,
2
],
[
3,
4,
4,
4,
2
],
[
3,
3,
4,
4,
2
]
],
"data": [
... | [
[
4,
5,
1,
3,
2
],
[
2,
1,
5,
4,
3
],
[
1,
4,
3,
2,
5
],
[
5,
3,
2,
1,
4
],
[
3,
2,
4,
5,
1
]
] | 50 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_50.png | figs/jigsawsudoku_50_answer.png |
jigsawsudoku | 5 | 5 | hard | {
"region": [
[
0,
0,
1,
1,
1
],
[
0,
1,
1,
2,
2
],
[
0,
2,
2,
2,
3
],
[
0,
3,
3,
3,
3
],
[
4,
4,
4,
4,
4
]
],
"data": [
... | 51 | {
"region": [
[
0,
0,
1,
1,
1
],
[
0,
1,
1,
2,
2
],
[
0,
2,
2,
2,
3
],
[
0,
3,
3,
3,
3
],
[
4,
4,
4,
4,
4
]
],
"data": [
... | [
[
3,
1,
4,
2,
5
],
[
5,
3,
1,
4,
2
],
[
2,
5,
3,
1,
4
],
[
4,
2,
5,
3,
1
],
[
1,
4,
2,
5,
3
]
] | 51 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_51.png | figs/jigsawsudoku_51_answer.png |
jigsawsudoku | 7 | 7 | easy | {
"region": [
[
0,
0,
1,
1,
2,
2,
3
],
[
0,
0,
1,
1,
2,
2,
3
],
[
0,
1,
1,
2,
2,
4,
3
],
[
0,
0,
1,
2,
4,
4,
3
],
... | 52 | {
"region": [
[
0,
0,
1,
1,
2,
2,
3
],
[
0,
0,
1,
1,
2,
2,
3
],
[
0,
1,
1,
2,
2,
4,
3
],
[
0,
0,
1,
2,
4,
4,
3
],
... | [
[
3,
5,
7,
6,
4,
2,
1
],
[
1,
7,
4,
2,
3,
5,
6
],
[
2,
3,
1,
7,
6,
4,
5
],
[
4,
6,
5,
1,
2,
7,
3
],
[
7,
1,
2,
3,
5,
6,
4
],
[
5,
2,
6,
4,
... | 52 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_52.png | figs/jigsawsudoku_52_answer.png |
jigsawsudoku | 7 | 7 | normal | {
"region": [
[
0,
0,
0,
0,
1,
1,
1
],
[
0,
1,
1,
1,
1,
2,
2
],
[
0,
3,
3,
2,
2,
2,
2
],
[
0,
3,
3,
3,
2,
4,
4
],
... | 53 | {
"region": [
[
0,
0,
0,
0,
1,
1,
1
],
[
0,
1,
1,
1,
1,
2,
2
],
[
0,
3,
3,
2,
2,
2,
2
],
[
0,
3,
3,
3,
2,
4,
4
],
... | [
[
3,
2,
7,
6,
4,
5,
1
],
[
5,
6,
3,
2,
7,
1,
4
],
[
4,
1,
2,
7,
5,
6,
3
],
[
1,
3,
6,
5,
2,
4,
7
],
[
6,
7,
5,
4,
1,
3,
2
],
[
2,
4,
1,
3,
... | 53 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_53.png | figs/jigsawsudoku_53_answer.png |
jigsawsudoku | 7 | 7 | hard | {
"region": [
[
0,
1,
1,
1,
2,
2,
2
],
[
0,
0,
1,
1,
2,
2,
2
],
[
0,
0,
0,
1,
1,
3,
2
],
[
4,
4,
0,
5,
3,
3,
6
],
... | 54 | {
"region": [
[
0,
1,
1,
1,
2,
2,
2
],
[
0,
0,
1,
1,
2,
2,
2
],
[
0,
0,
0,
1,
1,
3,
2
],
[
4,
4,
0,
5,
3,
3,
6
],
... | [
[
4,
5,
7,
6,
1,
2,
3
],
[
2,
1,
4,
3,
6,
5,
7
],
[
6,
7,
5,
1,
2,
3,
4
],
[
7,
2,
3,
4,
5,
6,
1
],
[
1,
3,
2,
5,
4,
7,
6
],
[
3,
4,
6,
2,
... | 54 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_54.png | figs/jigsawsudoku_54_answer.png |
jigsawsudoku | 9 | 9 | easy | {
"region": [
[
0,
0,
0,
0,
1,
1,
1,
2,
2
],
[
0,
1,
0,
1,
1,
3,
2,
2,
2
],
[
0,
1,
1,
1,
3,
3,
3,
2,
2
],
[
0,
0,
... | 55 | {
"region": [
[
0,
0,
0,
0,
1,
1,
1,
2,
2
],
[
0,
1,
0,
1,
1,
3,
2,
2,
2
],
[
0,
1,
1,
1,
3,
3,
3,
2,
2
],
[
0,
0,
... | [
[
9,
2,
1,
7,
3,
6,
8,
5,
4
],
[
6,
9,
8,
2,
4,
5,
1,
3,
7
],
[
3,
5,
7,
1,
8,
9,
4,
6,
2
],
[
5,
4,
3,
9,
6,
7,
2,
8,
1
],
[
7,
8,
5,
4,
... | 55 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_55.png | figs/jigsawsudoku_55_answer.png |
jigsawsudoku | 9 | 9 | normal | {
"region": [
[
0,
0,
0,
0,
1,
1,
1,
2,
2
],
[
0,
0,
0,
0,
1,
1,
1,
1,
2
],
[
3,
3,
3,
0,
1,
1,
4,
2,
2
],
[
3,
3,
... | 56 | {
"region": [
[
0,
0,
0,
0,
1,
1,
1,
2,
2
],
[
0,
0,
0,
0,
1,
1,
1,
1,
2
],
[
3,
3,
3,
0,
1,
1,
4,
2,
2
],
[
3,
3,
... | [
[
7,
1,
5,
2,
6,
9,
8,
3,
4
],
[
9,
8,
6,
4,
5,
1,
3,
7,
2
],
[
8,
7,
9,
3,
2,
4,
5,
1,
6
],
[
1,
5,
3,
7,
9,
2,
4,
6,
8
],
[
2,
4,
7,
6,
... | 56 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_56.png | figs/jigsawsudoku_56_answer.png |
jigsawsudoku | 9 | 9 | hard | {
"region": [
[
0,
0,
0,
1,
2,
2,
2,
3,
3
],
[
0,
0,
0,
1,
1,
2,
2,
3,
3
],
[
4,
0,
0,
1,
1,
2,
2,
2,
3
],
[
4,
0,
... | 57 | {
"region": [
[
0,
0,
0,
1,
2,
2,
2,
3,
3
],
[
0,
0,
0,
1,
1,
2,
2,
3,
3
],
[
4,
0,
0,
1,
1,
2,
2,
2,
3
],
[
4,
0,
... | [
[
2,
4,
7,
8,
3,
1,
5,
6,
9
],
[
8,
3,
6,
5,
2,
7,
9,
1,
4
],
[
3,
1,
5,
7,
9,
6,
8,
4,
2
],
[
7,
9,
1,
4,
6,
5,
2,
8,
3
],
[
1,
6,
3,
9,
... | 57 | **Core Rules:**
Fill the grid with numbers `1..N` so that:
1. Each row contains each number exactly once.
2. Each column contains each number exactly once.
3. Each irregular region contains each number exactly once.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left as `(0, 0)`.
2. `row` increases... | {
"region": [
[
0,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2
],
[
0,
3,
1,
4,
2
],
[
0,
3,
4,
4,
4
],
[
0,
3,
3,
3,
4
]
],
"data": [
... | figs/jigsawsudoku_57.png | figs/jigsawsudoku_57_answer.png |
kakurasu | 4 | 4 | easy | {
"row_sum": [
7,
7,
6,
7
],
"col_sum": [
7,
7,
6,
7
]
} | 58 | {
"row_sum": [
7,
7,
6,
7
],
"col_sum": [
7,
7,
6,
7
]
} | [
[
null,
null,
"B",
"B"
],
[
null,
null,
"B",
"B"
],
[
"B",
"B",
"B",
null
],
[
"B",
"B",
null,
"B"
]
] | 58 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_58.png | figs/kakurasu_58_answer.png |
kakurasu | 4 | 4 | hard | {
"row_sum": [
1,
7,
2,
9
],
"col_sum": [
3,
9,
4,
6
]
} | 59 | {
"row_sum": [
1,
7,
2,
9
],
"col_sum": [
3,
9,
4,
6
]
} | [
[
"B",
null,
null,
null
],
[
"B",
"B",
null,
"B"
],
[
null,
"B",
null,
null
],
[
null,
"B",
"B",
"B"
]
] | 59 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_59.png | figs/kakurasu_59_answer.png |
kakurasu | 5 | 5 | easy | {
"row_sum": [
6,
4,
9,
7,
11
],
"col_sum": [
4,
9,
3,
7,
13
]
} | 60 | {
"row_sum": [
6,
4,
9,
7,
11
],
"col_sum": [
4,
9,
3,
7,
13
]
} | [
[
"B",
null,
null,
null,
"B"
],
[
null,
null,
null,
"B",
null
],
[
"B",
null,
"B",
null,
"B"
],
[
null,
"B",
null,
null,
"B"
],
[
null,
"B",
null,
"B",
"B"
]
] | 60 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_60.png | figs/kakurasu_60_answer.png |
kakurasu | 5 | 5 | hard | {
"row_sum": [
8,
1,
8,
11,
9
],
"col_sum": [
14,
4,
13,
3,
10
]
} | 61 | {
"row_sum": [
8,
1,
8,
11,
9
],
"col_sum": [
14,
4,
13,
3,
10
]
} | [
[
null,
null,
"B",
null,
"B"
],
[
"B",
null,
null,
null,
null
],
[
"B",
null,
"B",
"B",
null
],
[
"B",
"B",
"B",
null,
"B"
],
[
"B",
null,
"B",
null,
"B"
]
] | 61 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_61.png | figs/kakurasu_61_answer.png |
kakurasu | 6 | 6 | easy | {
"row_sum": [
11,
1,
8,
4,
3,
1
],
"col_sum": [
8,
4,
5,
5,
1,
3
]
} | 62 | {
"row_sum": [
11,
1,
8,
4,
3,
1
],
"col_sum": [
8,
4,
5,
5,
1,
3
]
} | [
[
null,
"B",
null,
"B",
"B",
null
],
[
"B",
null,
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
"B"
],
[
null,
null,
null,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
... | 62 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_62.png | figs/kakurasu_62_answer.png |
kakurasu | 6 | 6 | hard | {
"row_sum": [
15,
15,
7,
12,
14,
12
],
"col_sum": [
2,
13,
7,
11,
11,
18
]
} | 63 | {
"row_sum": [
15,
15,
7,
12,
14,
12
],
"col_sum": [
2,
13,
7,
11,
11,
18
]
} | [
[
null,
null,
null,
"B",
"B",
"B"
],
[
"B",
null,
"B",
null,
"B",
"B"
],
[
null,
"B",
null,
null,
"B",
null
],
[
null,
"B",
null,
"B",
null,
"B"
],
[
null,
null,
"B",
null,
"B",
"B... | 63 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_63.png | figs/kakurasu_63_answer.png |
kakurasu | 7 | 7 | easy | {
"row_sum": [
17,
24,
21,
19,
23,
24,
8
],
"col_sum": [
20,
24,
21,
12,
16,
27,
14
]
} | 64 | {
"row_sum": [
17,
24,
21,
19,
23,
24,
8
],
"col_sum": [
20,
24,
21,
12,
16,
27,
14
]
} | [
[
null,
"B",
"B",
null,
"B",
null,
"B"
],
[
"B",
"B",
"B",
null,
"B",
"B",
"B"
],
[
"B",
"B",
"B",
"B",
"B",
"B",
null
],
[
"B",
null,
"B",
"B",
"B",
"B",
null
],
[
"B",
"B",
"... | 64 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_64.png | figs/kakurasu_64_answer.png |
kakurasu | 7 | 7 | hard | {
"row_sum": [
1,
17,
9,
20,
23,
10,
11
],
"col_sum": [
15,
13,
9,
22,
27,
9,
7
]
} | 65 | {
"row_sum": [
1,
17,
9,
20,
23,
10,
11
],
"col_sum": [
15,
13,
9,
22,
27,
9,
7
]
} | [
[
"B",
null,
null,
null,
null,
null,
null
],
[
null,
"B",
"B",
null,
"B",
null,
"B"
],
[
"B",
null,
"B",
null,
"B",
null,
null
],
[
null,
"B",
"B",
"B",
"B",
"B",
null
],
[
"B",
nu... | 65 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_65.png | figs/kakurasu_65_answer.png |
kakurasu | 8 | 8 | easy | {
"row_sum": [
19,
19,
8,
11,
10,
7,
22,
3
],
"col_sum": [
11,
19,
7,
10,
24,
14,
7,
4
]
} | 66 | {
"row_sum": [
19,
19,
8,
11,
10,
7,
22,
3
],
"col_sum": [
11,
19,
7,
10,
24,
14,
7,
4
]
} | [
[
"B",
null,
null,
"B",
null,
"B",
null,
"B"
],
[
"B",
null,
"B",
"B",
"B",
"B",
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
"B"
],
[
null,
null,
null,
null,
"B",
"B",
... | 66 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_66.png | figs/kakurasu_66_answer.png |
kakurasu | 8 | 8 | hard | {
"row_sum": [
9,
28,
11,
6,
16,
19,
13,
23
],
"col_sum": [
26,
2,
14,
9,
13,
9,
28,
21
]
} | 67 | {
"row_sum": [
9,
28,
11,
6,
16,
19,
13,
23
],
"col_sum": [
26,
2,
14,
9,
13,
9,
28,
21
]
} | [
[
null,
null,
null,
"B",
"B",
null,
null,
null
],
[
null,
"B",
null,
null,
"B",
"B",
"B",
"B"
],
[
null,
null,
null,
null,
"B",
"B",
null,
null
],
[
null,
null,
null,
null,
null,
"B",
... | 67 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_67.png | figs/kakurasu_67_answer.png |
kakurasu | 9 | 9 | easy | {
"row_sum": [
9,
8,
18,
5,
5,
10,
15,
5,
25
],
"col_sum": [
13,
18,
8,
19,
20,
16,
1,
14,
10
]
} | 68 | {
"row_sum": [
9,
8,
18,
5,
5,
10,
15,
5,
25
],
"col_sum": [
13,
18,
8,
19,
20,
16,
1,
14,
10
]
} | [
[
null,
"B",
null,
null,
null,
null,
"B",
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
"B",
null
],
[
"B",
null,
null,
null,
null,
null,
null,
"B",
"B"
],
[
"B",
null,
nul... | 68 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_68.png | figs/kakurasu_68_answer.png |
kakurasu | 9 | 9 | hard | {
"row_sum": [
1,
22,
12,
12,
27,
11,
34,
16,
27
],
"col_sum": [
43,
27,
35,
10,
10,
26,
14,
39,
9
]
} | 69 | {
"row_sum": [
1,
22,
12,
12,
27,
11,
34,
16,
27
],
"col_sum": [
43,
27,
35,
10,
10,
26,
14,
39,
9
]
} | [
[
"B",
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B",
"B",
null,
"B",
null,
null,
"B"
],
[
"B",
null,
null,
null,
"B",
"B",
null,
null,
null
],
[
"B",
null,
"B",
... | 69 | **Core Rules:**
Fill some cells black so that:
1. In each row, the sum of the column-weights of black cells equals the row target number.
2. In each column, the sum of the row-weights of black cells equals the column target number.
3. Column-weights are listed above the board (left-to-right), row-weights are listed lef... | {
"row_sum": [
9,
5,
7,
3
],
"col_sum": [
3,
6,
7,
4
]
} | figs/kakurasu_69.png | figs/kakurasu_69_answer.png |
kurodoko | 5 | 5 | normal | {
"data": [
[
null,
null,
null,
3,
null
],
[
4,
null,
null,
null,
null
],
[
null,
9,
null,
6,
null
],
[
null,
null,
null,
null,
5
],
[
null,
7,
... | 70 | {
"data": [
[
null,
null,
null,
3,
null
],
[
4,
null,
null,
null,
null
],
[
null,
9,
null,
6,
null
],
[
null,
null,
null,
null,
5
],
[
null,
7,
... | [
[
"B",
null,
null,
3,
"B"
],
[
4,
null,
null,
"B",
null
],
[
null,
9,
null,
6,
null
],
[
"B",
null,
"B",
null,
5
],
[
null,
7,
null,
"B",
null
]
] | 70 | **Core Rules:**
Shade some cells black guided by number clues.
1. Each clue number counts how many white cells are visible from that clue cell, including itself.
2. Visibility extends orthogonally until blocked by a black cell or the grid border.
3. Clue cells are always white and cannot be shaded black.
4. All white c... | {
"data": [
[
null,
null,
null,
3,
null
],
[
4,
null,
null,
null,
null
],
[
null,
9,
null,
7,
null
],
[
null,
null,
null,
null,
7
],
[
null,
6,
... | figs/kurodoko_70.png | figs/kurodoko_70_answer.png |
kurodoko | 7 | 7 | normal | {
"data": [
[
null,
null,
null,
9,
null,
null,
null
],
[
null,
5,
null,
null,
null,
null,
8
],
[
null,
null,
null,
8,
null,
null,
10
],
[
null,
null,
... | 71 | {
"data": [
[
null,
null,
null,
9,
null,
null,
null
],
[
null,
5,
null,
null,
null,
null,
8
],
[
null,
null,
null,
8,
null,
null,
10
],
[
null,
null,
... | [
[
null,
"B",
null,
9,
null,
null,
null
],
[
null,
5,
null,
null,
"B",
null,
8
],
[
"B",
null,
"B",
8,
null,
null,
10
],
[
null,
"B",
null,
9,
null,
null,
null
],
[
7,
null,
nul... | 71 | **Core Rules:**
Shade some cells black guided by number clues.
1. Each clue number counts how many white cells are visible from that clue cell, including itself.
2. Visibility extends orthogonally until blocked by a black cell or the grid border.
3. Clue cells are always white and cannot be shaded black.
4. All white c... | {
"data": [
[
null,
null,
null,
3,
null
],
[
4,
null,
null,
null,
null
],
[
null,
9,
null,
7,
null
],
[
null,
null,
null,
null,
7
],
[
null,
6,
... | figs/kurodoko_71.png | figs/kurodoko_71_answer.png |
kurodoko | 10 | 10 | normal | {
"data": [
[
null,
null,
5,
null,
null,
null,
13,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
4
],
[
null,
11,
null,
null... | 72 | {
"data": [
[
null,
null,
5,
null,
null,
null,
13,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
4
],
[
null,
11,
null,
null... | [
[
null,
"B",
5,
null,
null,
null,
13,
"B",
null,
null
],
[
null,
null,
"B",
null,
null,
"B",
null,
null,
"B",
4
],
[
null,
11,
null,
null,
null,
null,
null,
"B",
null,
null
],
[
"B... | 72 | **Core Rules:**
Shade some cells black guided by number clues.
1. Each clue number counts how many white cells are visible from that clue cell, including itself.
2. Visibility extends orthogonally until blocked by a black cell or the grid border.
3. Clue cells are always white and cannot be shaded black.
4. All white c... | {
"data": [
[
null,
null,
null,
3,
null
],
[
4,
null,
null,
null,
null
],
[
null,
9,
null,
7,
null
],
[
null,
null,
null,
null,
7
],
[
null,
6,
... | figs/kurodoko_72.png | figs/kurodoko_72_answer.png |
lightup | 7 | 7 | easy | {
"data": [
[
null,
null,
2,
null,
null,
null,
null
],
[
null,
1,
-1,
null,
null,
-1,
null
],
[
null,
null,
null,
null,
null,
0,
-1
],
[
null,
null,
... | 73 | {
"data": [
[
null,
null,
2,
null,
null,
null,
null
],
[
null,
1,
-1,
null,
null,
-1,
null
],
[
null,
null,
null,
null,
null,
0,
-1
],
[
null,
null,
... | [
[
null,
"B",
null,
"B",
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
"B"
],
[
"B",
null,
null,
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
null,
null
],
[
nul... | 73 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_73.png | figs/lightup_73_answer.png |
lightup | 7 | 7 | normal | {
"data": [
[
-1,
null,
-1,
null,
null,
null,
1
],
[
null,
null,
2,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
1,
1
],
[
null,
null,
... | 74 | {
"data": [
[
-1,
null,
-1,
null,
null,
null,
1
],
[
null,
null,
2,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
1,
1
],
[
null,
null,
... | [
[
null,
null,
null,
null,
null,
"B",
null
],
[
null,
"B",
null,
"B",
null,
null,
null
],
[
null,
null,
null,
null,
"B",
null,
null
],
[
"B",
null,
null,
null,
null,
null,
"B"
],
[
null... | 74 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_74.png | figs/lightup_74_answer.png |
lightup | 7 | 7 | hard | {
"data": [
[
null,
null,
0,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
2,
null,
null,
null,
null,
null,
1
],
[
null,
null,
... | 75 | {
"data": [
[
null,
null,
0,
null,
1,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
2,
null,
null,
null,
null,
null,
1
],
[
null,
null,
... | [
[
"B",
null,
null,
null,
null,
"B",
null
],
[
null,
null,
null,
null,
null,
null,
"B"
],
[
null,
"B",
null,
null,
null,
null,
null
],
[
"B",
null,
null,
null,
null,
null,
null
],
[
nul... | 75 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_75.png | figs/lightup_75_answer.png |
lightup | 10 | 10 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
3,
null,
-1,
null,
null,
-1,
-1,
null
],
[
null,
-1,
null,
-1,
... | 76 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
1,
3,
null,
-1,
null,
null,
-1,
-1,
null
],
[
null,
-1,
null,
-1,
... | [
[
null,
null,
"B",
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
"B",
null,
null,
null,
null,
null,
null
],
[
null,
null,
"B",
null,
null,
"B",
null,
null,
null,
null
],... | 76 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_76.png | figs/lightup_76_answer.png |
lightup | 10 | 10 | normal | {
"data": [
[
1,
-1,
null,
null,
null,
null,
null,
null,
null,
-1
],
[
null,
2,
null,
null,
null,
-1,
null,
null,
2,
-1
],
[
null,
null,
null,
null,
... | 77 | {
"data": [
[
1,
-1,
null,
null,
null,
null,
null,
null,
null,
-1
],
[
null,
2,
null,
null,
null,
-1,
null,
null,
2,
-1
],
[
null,
null,
null,
null,
... | [
[
null,
null,
null,
null,
null,
null,
null,
null,
"B",
null
],
[
"B",
null,
"B",
null,
null,
null,
null,
"B",
null,
null
],
[
null,
null,
null,
"B",
null,
null,
null,
null,
null,
null
],... | 77 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_77.png | figs/lightup_77_answer.png |
lightup | 10 | 10 | hard | {
"data": [
[
1,
null,
null,
null,
null,
1,
1,
null,
null,
-1
],
[
null,
2,
null,
null,
null,
null,
null,
null,
-1,
null
],
[
null,
null,
null,
null,
... | 78 | {
"data": [
[
1,
null,
null,
null,
null,
1,
1,
null,
null,
-1
],
[
null,
2,
null,
null,
null,
null,
null,
null,
-1,
null
],
[
null,
null,
null,
null,
... | [
[
null,
null,
"B",
null,
null,
null,
null,
"B",
null,
null
],
[
"B",
null,
null,
null,
null,
"B",
null,
null,
null,
null
],
[
null,
"B",
null,
null,
null,
null,
null,
null,
null,
null
],... | 78 | **Core Rules:**
Place light bulbs on white cells so that:
1. Every white cell is illuminated by at least one bulb.
2. A bulb illuminates along its row and column until blocked by a black cell.
3. No bulb may illuminate another bulb.
4. Numbered black cells indicate exactly how many orthogonally adjacent bulbs they must... | {
"data": [
[
null,
null,
-1,
1,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
null,
null,
null,
2
],
[
1,
null,... | figs/lightup_78.png | figs/lightup_78_answer.png |
lits | 6 | 6 | normal | {
"data": [
[
0,
0,
0,
0,
0,
1
],
[
2,
2,
0,
0,
3,
1
],
[
2,
4,
4,
3,
3,
1
],
[
2,
2,
4,
3,
3,
1
],
[
1,
2,
4,
4,
... | 79 | {
"data": [
[
0,
0,
0,
0,
0,
1
],
[
2,
2,
0,
0,
3,
1
],
[
2,
4,
4,
3,
3,
1
],
[
2,
2,
4,
3,
3,
1
],
[
1,
2,
4,
4,
... | [
[
null,
"I",
"I",
"I",
"I",
null
],
[
"L",
"L",
null,
null,
"T",
null
],
[
"L",
null,
"L",
"T",
"T",
null
],
[
"L",
null,
"L",
null,
"T",
"L"
],
[
null,
null,
"L",
"L",
null,
"L"
... | 79 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_79.png | figs/lits_79_answer.png |
lits | 6 | 6 | hard | {
"data": [
[
0,
0,
1,
1,
1,
1
],
[
0,
0,
2,
2,
3,
3
],
[
0,
2,
2,
2,
3,
3
],
[
4,
2,
5,
2,
2,
3
],
[
4,
2,
5,
5,
... | 80 | {
"data": [
[
0,
0,
1,
1,
1,
1
],
[
0,
0,
2,
2,
3,
3
],
[
0,
2,
2,
2,
3,
3
],
[
4,
2,
5,
2,
2,
3
],
[
4,
2,
5,
5,
... | [
[
"T",
null,
"I",
"I",
"I",
"I"
],
[
"T",
"T",
"S",
null,
null,
"T"
],
[
"T",
null,
"S",
"S",
"T",
"T"
],
[
"L",
null,
null,
"S",
null,
"T"
],
[
"L",
null,
null,
"T",
null,
null
... | 80 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_80.png | figs/lits_80_answer.png |
lits | 8 | 8 | normal | {
"data": [
[
0,
0,
0,
0,
0,
0,
1,
1
],
[
0,
2,
2,
2,
2,
1,
1,
2
],
[
3,
3,
4,
4,
2,
2,
2,
2
],
[
3,
3,
4,
4,
2,
... | 81 | {
"data": [
[
0,
0,
0,
0,
0,
0,
1,
1
],
[
0,
2,
2,
2,
2,
1,
1,
2
],
[
3,
3,
4,
4,
2,
2,
2,
2
],
[
3,
3,
4,
4,
2,
... | [
[
"I",
"I",
"I",
"I",
null,
null,
"S",
"S"
],
[
null,
null,
null,
"L",
"L",
"S",
"S",
null
],
[
"L",
"L",
null,
null,
"L",
null,
null,
null
],
[
null,
"L",
null,
null,
"L",
null,
"... | 81 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_81.png | figs/lits_81_answer.png |
lits | 8 | 8 | hard | {
"data": [
[
0,
1,
1,
1,
1,
2,
2,
2
],
[
0,
0,
1,
3,
1,
4,
4,
2
],
[
0,
1,
1,
3,
3,
3,
4,
2
],
[
0,
0,
0,
5,
3,
... | 82 | {
"data": [
[
0,
1,
1,
1,
1,
2,
2,
2
],
[
0,
0,
1,
3,
1,
4,
4,
2
],
[
0,
1,
1,
3,
3,
3,
4,
2
],
[
0,
0,
0,
5,
3,
... | [
[
null,
"I",
"I",
"I",
"I",
null,
null,
null
],
[
null,
null,
null,
"S",
null,
"L",
"L",
null
],
[
null,
null,
null,
"S",
"S",
null,
"L",
null
],
[
null,
"L",
"L",
null,
"S",
null,
... | 82 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_82.png | figs/lits_82_answer.png |
lits | 10 | 10 | normal | {
"data": [
[
0,
0,
0,
0,
0,
0,
1,
1,
1,
1
],
[
2,
2,
0,
2,
2,
3,
3,
3,
3,
1
],
[
2,
2,
2,
2,
4,
4,
4,
4,
3,
1
],
... | 83 | {
"data": [
[
0,
0,
0,
0,
0,
0,
1,
1,
1,
1
],
[
2,
2,
0,
2,
2,
3,
3,
3,
3,
1
],
[
2,
2,
2,
2,
4,
4,
4,
4,
3,
1
],
... | [
[
"I",
"I",
"I",
"I",
null,
null,
null,
null,
null,
null
],
[
null,
null,
null,
"S",
"S",
"I",
"I",
"I",
"I",
"L"
],
[
null,
null,
"S",
"S",
null,
null,
null,
null,
null,
"L"
],
[
... | 83 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_83.png | figs/lits_83_answer.png |
lits | 10 | 10 | hard | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2,
2,
2,
2,
2,
2
],
[
0,
0,
2,
2,
3,
3,
4,
4,
4,
4
],
... | 84 | {
"data": [
[
0,
0,
1,
1,
1,
1,
1,
1,
2,
2
],
[
0,
1,
1,
2,
2,
2,
2,
2,
2,
2
],
[
0,
0,
2,
2,
3,
3,
4,
4,
4,
4
],
... | [
[
"L",
"L",
null,
null,
"I",
"I",
"I",
"I",
null,
null
],
[
"L",
null,
null,
"S",
"S",
null,
null,
null,
null,
null
],
[
"L",
null,
"S",
"S",
null,
"S",
"I",
"I",
"I",
"I"
],
[
"T"... | 84 | **Core Rules:**
Shade cells so that:
1. In every region, shaded cells form exactly one tetromino of size 4.
2. Allowed tetromino types are `L`, `I`, `T`, `S` (`O` is forbidden because 2x2 shaded blocks are forbidden).
3. Two orthogonally adjacent regions cannot use the same tetromino type (rotation/reflection counts as... | {
"data": [
[
0,
0,
0,
0,
1,
1
],
[
2,
0,
3,
3,
1,
1
],
[
2,
3,
3,
3,
3,
1
],
[
2,
3,
4,
1,
1,
1
],
[
2,
3,
4,
4,
... | figs/lits_84.png | figs/lits_84_answer.png |
masyu | 6 | 6 | easy | {
"data": [
[
null,
null,
null,
"W",
null,
null
],
[
null,
"B",
null,
null,
"W",
null
],
[
null,
"W",
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | 85 | {
"data": [
[
null,
null,
null,
"W",
null,
null
],
[
null,
"B",
null,
null,
"W",
null
],
[
null,
"W",
null,
null,
null,
null
],
[
null,
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
1,
4
],
[
2,
4
],
[
2,
3
],
[
1,
3
],
[
1,
2
],
[
1,
1
],
[
2,
1
],
[
3,
1
],
[
4,
1
],
[
4,... | 85 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_85.png | figs/masyu_85_answer.png |
masyu | 8 | 8 | easy | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
"W",
null,
null,
"B",
"W"
],
[
"W",
null,
null,
"W",
null,
null,
"W",
"... | 86 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
"W",
null,
null,
"W",
null,
null,
"B",
"W"
],
[
"W",
null,
null,
"W",
null,
null,
"W",
"... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
0,
6
],
[
0,
7
],
[
1,
7
],
[
2,
7
],
[
3,
7
],
[
3,
6
],
[
2,
6
],
[
1,
6
],
[
1,... | 86 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_86.png | figs/masyu_86_answer.png |
masyu | 8 | 8 | normal | {
"data": [
[
null,
null,
"W",
null,
null,
null,
"W",
null
],
[
"W",
null,
null,
null,
"W",
null,
null,
"W"
],
[
"B",
null,
null,
null,
null,
null,
null,
... | 87 | {
"data": [
[
null,
null,
"W",
null,
null,
null,
"W",
null
],
[
"W",
null,
null,
null,
"W",
null,
null,
"W"
],
[
"B",
null,
null,
null,
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
1,
3
],
[
1,
4
],
[
1,
5
],
[
0,
5
],
[
0,
6
],
[
0,
7
],
[
1,
7
],
[
2,
7
],
[
2,
6
],
[
2,
5
],
[
2,... | 87 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_87.png | figs/masyu_87_answer.png |
masyu | 8 | 8 | hard | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
"W",
null,
null,
"W",
null,
"W",
null
],
[
"B",
null,
null,
null,
null,
"W",
"W",
... | 88 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
null
],
[
null,
"W",
null,
null,
"W",
null,
"W",
null
],
[
"B",
null,
null,
null,
null,
"W",
"W",
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
1,
3
],
[
1,
4
],
[
1,
5
],
[
1,
6
],
[
1,
7
],
[
2,
7
],
[
2,
6
],
[
2,
5
],
[
2,
4
],
[
3,
4
],
[
3,... | 88 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_88.png | figs/masyu_88_answer.png |
masyu | 10 | 10 | easy | {
"data": [
[
"B",
null,
null,
null,
null,
"B",
null,
null,
null,
null
],
[
null,
null,
"B",
"W",
null,
null,
null,
null,
"W",
"W"
],
[
null,
null,
null,
... | 89 | {
"data": [
[
"B",
null,
null,
null,
null,
"B",
null,
null,
null,
null
],
[
null,
null,
"B",
"W",
null,
null,
null,
null,
"W",
"W"
],
[
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
1,
4
],
[
1,
3
],
[
1,
2
],
[
2,
2
],
[
3,
2
],
[
4,
2
],
[
4,
1
],
[
5,
1
],
[
5,
2
],
[
5,... | 89 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_89.png | figs/masyu_89_answer.png |
masyu | 10 | 10 | normal | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"B",
null,
null
],
[
null,
"W",
null,
null,
null,
null,
"B",
null,
null,
"W"
],
[
null,
null,
null,
... | 90 | {
"data": [
[
null,
null,
null,
null,
null,
null,
null,
"B",
null,
null
],
[
null,
"W",
null,
null,
null,
null,
"B",
null,
null,
"W"
],
[
null,
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
0,
3
],
[
0,
4
],
[
1,
4
],
[
1,
5
],
[
1,
6
],
[
2,
6
],
[
3,
6
],
[
4,
6
],
[
4,
7
],
[
3,
7
],
[
2,
7
],
[
1,... | 90 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_90.png | figs/masyu_90_answer.png |
masyu | 10 | 10 | hard | {
"data": [
[
null,
"W",
null,
null,
"W",
"W",
null,
null,
null,
"B"
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
... | 91 | {
"data": [
[
null,
"W",
null,
null,
"W",
"W",
null,
null,
null,
"B"
],
[
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
],
[
"B",
null,
null,
... | [
[
0,
0
],
[
0,
1
],
[
0,
2
],
[
1,
2
],
[
1,
3
],
[
0,
3
],
[
0,
4
],
[
0,
5
],
[
0,
6
],
[
1,
6
],
[
1,
7
],
[
0,
7
],
[
0,
8
],
[
0,
9
],
[
1,... | 91 | **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. `W` (white circle): the loop goes straight through this circle, and it must turn at least once in the previous or next step.
2. `B` (black circle): the loop turns at... | {
"data": [
[
"B",
"W",
null,
null,
"W",
null
],
[
null,
null,
null,
"W",
null,
null
],
[
null,
"W",
null,
null,
"W",
null
],
[
null,
"W",
"W",
null,
"W... | figs/masyu_91.png | figs/masyu_91_answer.png |
minesweeper | 5 | 5 | easy | {
"data": [
[
2,
null,
2,
2,
null
],
[
null,
3,
null,
null,
null
],
[
3,
null,
null,
3,
null
],
[
null,
null,
null,
1,
null
],
[
3,
null,
null,
... | 92 | {
"data": [
[
2,
null,
2,
2,
null
],
[
null,
3,
null,
null,
null
],
[
3,
null,
null,
3,
null
],
[
null,
null,
null,
1,
null
],
[
3,
null,
null,
... | [
[
null,
"F",
null,
null,
null
],
[
"F",
null,
"F",
null,
"F"
],
[
null,
null,
null,
null,
null
],
[
"F",
"F",
null,
null,
"F"
],
[
null,
"F",
null,
null,
null
]
] | 92 | **Core Rules:**
Find which cells contain mines so that:
1. Each numbered cell equals the number of adjacent mines in its 8-neighborhood.
2. Cells without numbers have no direct numeric clue.
3. Mines are represented by flagged cells in the answer.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left... | {
"data": [
[
1,
2,
null,
null,
0
],
[
1,
null,
null,
null,
1
],
[
3,
null,
4,
3,
null
],
[
null,
null,
null,
3,
null
],
[
null,
3,
2,
nul... | figs/minesweeper_92.png | figs/minesweeper_92_answer.png |
minesweeper | 5 | 5 | hard | {
"data": [
[
null,
null,
null,
1,
null
],
[
null,
1,
2,
3,
3
],
[
null,
2,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
1,
null,
2,
... | 93 | {
"data": [
[
null,
null,
null,
1,
null
],
[
null,
1,
2,
3,
3
],
[
null,
2,
null,
null,
null
],
[
null,
null,
null,
null,
null
],
[
1,
null,
2,
... | [
[
null,
"F",
null,
null,
"F"
],
[
null,
null,
null,
null,
null
],
[
null,
null,
null,
"F",
"F"
],
[
null,
"F",
"F",
null,
null
],
[
null,
null,
null,
null,
null
]
] | 93 | **Core Rules:**
Find which cells contain mines so that:
1. Each numbered cell equals the number of adjacent mines in its 8-neighborhood.
2. Cells without numbers have no direct numeric clue.
3. Mines are represented by flagged cells in the answer.
**Coordinates & Output:**
1. Coordinates use `(row, col)` with top-left... | {
"data": [
[
1,
2,
null,
null,
0
],
[
1,
null,
null,
null,
1
],
[
3,
null,
4,
3,
null
],
[
null,
null,
null,
3,
null
],
[
null,
3,
2,
nul... | figs/minesweeper_93.png | figs/minesweeper_93_answer.png |
End of preview. Expand in Data Studio
Dataset Card
Overview
This dataset contains the anchor split for public browsing and experimentation.
Transfer Split
transfer.jsonl is the hidden evaluation split. It is used to run generated solver code on unseen instances for benchmark evaluation, and is intentionally not exposed in the public viewer split configuration.
license: cc-by-4.0
- Downloads last month
- 52