task_id large_string | task_name large_string | rule large_string | rule_source large_string | train_demonstrations_json large_string | test_input_json large_string | test_output_json large_string | stable_instances_50_json large_string | human_corruptions_json large_string | generator_py large_string | verifier_py large_string |
|---|---|---|---|---|---|---|---|---|---|---|
t1 | corner_to_center | The grid is square with an even side n. Up to four coloured components sit in the corners, each inside a corner window of side n/2 − 2. Every component slides inward until the group packs against the middle. The top-left and top-right components move down together by the amount that brings their lowest occupied row ont... | human_reviewed | [{"input":[[0,0,3,0,0,0,0,2,0,0],[0,3,0,0,0,0,0,0,2,0],[3,0,0,0,0,0,0,0,0,2],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[6,0,0,0,0,0,0,0,0,1],[0,6,0,0,0,0,0,0,1,0],[0,0,6,0,0,0,0,1,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,3,2,0,0,0,0],[0,0,0,3,0,0... | [[1,0,0,0,0,0,0,0,0,0,0,2],[0,1,0,1,0,0,0,0,0,0,2,0],[0,0,1,0,0,0,0,0,0,2,0,0],[0,1,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,8,0,0,0,0,0,0,0,0,4,0],[0,0,8,0,0,0,0,0,0,4,0,0],[0,8,0,8,0,0,0,0,4,0,0,0],[8,0,0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,0,0,2,0,0],[0,0,0,1,0,1,0,0,2,0,0,0],[0,0,0,0,1,0,0,2,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,0,0],[0,0,0,8,0,0,0,0,4,0,0,0],[0,0,0,0,8,0,0,4,0,0,0,0],[0,0,0,8,0,8,4,0,0,0,0,0],[0,0,8,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,9,0,0,0,0,0,0,0,0,0,0,0,0],[9,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,9,0,0,0,0,0,0,0,5,0,0,5,0],[9,9,9,9,0,0,0,0,0,5,5,5,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,8,0],... | [{"input":[[0,0,6,6,6,6,6,0,0,0],[2,2,2,0,0,0,0,8,8,8],[2,0,0,9,3,3,3,0,0,6],[2,0,0,0,9,0,7,0,0,6],[0,0,0,0,0,9,0,7,0,6],[8,8,0,0,0,0,0,0,7,6],[6,6,6,0,9,7,3,0,0,7],[0,8,0,9,0,7,3,0,0,0],[0,8,9,0,0,7,3,2,2,2],[0,9,0,0,0,7,8,8,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,5,0,0],[0,0,5,0,0,0... | """Corner-components to center-components generator for Test2/t1.
The rule matches ``Test2/t1.json``:
- up to four components, one per corner window
- each corner component is translated to the corresponding center window
"""
from __future__ import annotations
import random
from typing import Dict, List, Sequence, T... | """Verifier for the Test2/t1 corner-to-center rule."""
from __future__ import annotations
from typing import Dict, List, Tuple
Grid = List[List[int]]
def _empty(size: int) -> Grid:
return [[0 for _ in range(size)] for _ in range(size)]
def _corner_span(size: int) -> int:
return size // 2 - 2
def _origi... |
t2 | color_shift | Find the 8-connected objects of non-black cells; their leftmost cells all sit in different columns. Order the objects by that leftmost cell (by column). Rotate the colours one step along that order with wrap-around: each object takes the colour of the object before it, and the first takes the colour of the last. Shapes... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,8,8,8],[0,1,0,0,0,0,0,0,0,8],[0,0,1,0,0,0,0,0,0,8],[0,1,0,0,0,0,0,0,0,8],[0,0,1,0,0,0,0,8,8,8],[0,0,0,0,5,5,0,0,0,0],[0,0,0,0,5,5,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,8,0,0,0,0,5,5,5],[0,8,0,0,0,0,0,0,0,5],[0,0,8,0,0,0... | [[0,0,9,0,0,0,0,0,0,0],[0,9,9,0,0,0,5,0,0,0],[9,9,9,0,8,0,0,5,0,0],[0,0,0,8,0,4,0,0,5,0],[0,0,8,0,0,4,0,0,0,5],[0,8,0,4,4,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]] | [[0,0,5,0,0,0,0,0,0,0],[0,5,5,0,0,0,4,0,0,0],[5,5,5,0,9,0,0,4,0,0],[0,0,0,9,0,8,0,0,4,0],[0,0,9,0,0,8,0,0,0,4],[0,9,0,8,8,8,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,6,6,6,6,0,0,0,0,0,0,0],[0,0,0,6,0,0,0,6,0,0,0,0,0,5],[0,0,0,0,0,0,0,0,0,0,0,0,5,0],[0,0,0,0,0,0,0,0,0,0,4,0,0,0],[0,0,0,0,0,0,0,0,0,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,8,0,0,0,9,0,0,0,0,0,0,0,0],[0,8,0,0,9,0,0,0,0,0,0,0,0,0],[0,0,8,0,9,0,0,0,0,0,0,0,0,0],... | [{"input":[[0,0,9,0,0,0,0,0,0,0],[0,9,9,0,0,0,5,0,0,0],[9,9,9,0,8,0,0,5,0,0],[0,0,0,8,0,4,0,0,5,0],[0,0,8,0,0,4,0,0,0,5],[0,8,0,4,4,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,5,0,0,0,0,0,0,0],[0,5,5,0,0,0,8,0,0,0],[5,5,5,0,9,0,0,8,0,0],[0,0,0,9,0,4... | """Generator for Test2/t2: cyclic color shift by leftmost-object order.
Rule:
- detect 8-connected non-zero objects
- sort objects by the position of their leftmost cell (col, then row)
- shift object colors to the right with wrap-around
"""
from __future__ import annotations
import random
from typing import Dict, L... | """Verifier for Test2/t2 color-shift-by-leftmost-object rule."""
from __future__ import annotations
from typing import List, Sequence, Tuple
Grid = List[List[int]]
Cell = Tuple[int, int]
def _neighbors8(r: int, c: int) -> list[Cell]:
out: list[Cell] = []
for dr in (-1, 0, 1):
for dc in (-1, 0, 1):
... |
t3 | wrapped_rectangle | A rectangular box is placed so that it runs off one edge of the grid and continues on the opposite edge, offset along that edge; the two halves may carry different outline colours. Reassemble the box across the wrap and output only its interior — the cells inside the outline, with the outline itself removed. | human_annotated | [{"input":[[2,0,5,5,7,7],[2,2,2,3,7,4],[1,2,2,7,7,4],[1,2,3,0,7,0],[2,2,4,4,7,7],[2,2,4,4,0,0]],"output":[[4,1],[4,1],[0,2]]},{"input":[[0,0,8,0,3,0,3,0,0],[8,8,8,0,5,0,0,4,4],[0,6,8,6,5,6,4,0,5],[1,0,8,0,5,4,4,2,0],[0,1,8,3,0,5,0,0,2],[8,8,8,3,0,0,0,9,9],[0,0,3,2,2,2,2,9,0],[0,3,0,2,2,2,2,9,0],[3,3,0,2,2,2,2,9,5],[0,0... | [[5,5,0,0,0,0,0,0,0,7,7],[0,5,5,5,2,2,0,0,0,7,7],[0,0,5,5,0,2,2,0,1,7,3],[0,0,5,5,2,0,2,1,0,7,0],[0,0,0,0,0,0,1,0,0,7,7],[4,4,4,0,0,1,2,5,0,0,0],[0,0,4,0,1,0,2,0,5,0,0],[3,0,4,1,0,0,2,0,0,5,0],[0,3,4,0,0,0,2,2,2,0,5],[4,4,4,0,0,0,0,0,0,0,0]] | [[7,0,0],[3,3,0],[0,0,3]] | {"train":[{"input":[[9,5,8,9,4,5,9,0,0,0,0,0,0,0],[9,9,9,9,9,9,9,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,1,1,0,0,0],[3,0,3,3,0,0,0,0,0,1,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0,0,0,0],[0,0,3,0,3,0,0,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0,0,0,0],[8,0,8,0,0,0,0,0,0,0,8,0,0,0],[8,8,8,0,0,0,3,3,3,0,8,8,8,8],[0,0,8,8,8,0,0,5,5,5,5,5,5,5],... | [{"input":[[2,5,8,2,4,5,2,0,0,0,0,0,0,0],[2,2,2,2,2,2,2,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,1,1,0,0,0],[3,0,3,3,0,0,0,0,0,1,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0,0,0,0],[0,0,3,0,3,0,0,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0,0,0,0],[8,0,8,0,0,0,0,0,0,0,8,0,0,0],[8,8,8,0,0,0,3,3,3,0,8,8,8,8],[0,0,8,8,8,0,0,5,5,5,5,5,5,5],[0,0,0,0,... | """Generator for Test2/t3: extract wrapped rectangle interior."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _random_content(rng: random.Random, h: int, w: int, frame_... | """Verifier for Test2/t3 wrapped-rectangle task."""
from __future__ import annotations
from typing import List
Grid = List[List[int]]
def verify_t3(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
h = len(inp)
w = len(inp[0])
if any(len(row) != ... |
t4 | scaled_rectangles | A small framed key sits in one corner of the grid holding a 3x3 pattern. Divide the whole grid into a 3x3 arrangement of equal blocks. Each coloured group in the key corresponds to a single rectangle of blocks in the output: draw it scaled up as a hollow outline one cell thick, in that colour (multiple adjacent rectang... | human_annotated | [{"input":[[0,0,0,0,0,0,0,2,2,2,2,2],[0,0,0,0,0,0,0,2,3,0,0,2],[0,0,0,0,0,0,0,2,0,1,0,2],[0,0,0,0,0,0,0,2,0,0,0,2],[0,0,0,0,0,0,0,2,2,2,2,2],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,2,2,2,2],[0,0,0,0,0,0,0,2,0,0,6,2],[0,0,0,0,0,0,0,2,0,1,0,2],[0,0,0,0,0,0,0,2,3,0,0,2],[0,0,0,0,0,0,0,2,2,2,2,2]] | [[0,0,0,0,0,0,0,0,6,6,6,6],[0,0,0,0,0,0,0,0,6,0,0,6],[0,0,0,0,0,0,0,0,6,0,2,6],[0,0,0,0,0,0,0,0,6,6,6,6],[0,0,0,0,1,1,1,1,0,0,0,0],[0,0,0,0,1,0,0,1,0,0,0,0],[0,0,0,0,1,0,2,1,0,0,0,0],[0,0,0,0,1,1,1,1,0,0,0,0],[3,3,3,3,0,0,0,0,0,0,0,0],[3,0,0,3,0,0,0,0,0,0,0,0],[3,0,2,3,0,0,0,0,0,0,0,0],[3,3,3,3,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[2,2,2,2,2,0,0,0,0,0,0,0],[2,6,0,0,2,0,0,0,0,0,0,0],[2,1,0,5,2,0,0,0,0,0,0,0],[2,0,9,5,2,0,0,0,0,0,0,0],[2,2,2,2,2,0,0,0,0,0,0,... | """Generator for Test2/t4 scaled-rectangle task."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
RED = 2
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _neighbors4(r: int, c: int) -> list[tuple[int, int]]:
retur... | """Verifier for Test2/t4 scaled-rectangle task."""
from __future__ import annotations
from typing import List
Grid = List[List[int]]
RED = 2
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _neighbors4(r: int, c: int) -> list[tuple[int, int]]:
return [(r - 1, c), (... |
t5 | cyan_flow | Orange cells are fixed walls. Cyan behaves like a liquid inside whatever region the walls leave open. In each region the same number of cyan cells settles at the bottom under gravity: rows fill from the bottom upward, each row is filling outward from the middle of the row (rows end at the border or an orange wall). Ora... | human_annotated | [{"input":[[8,8,8,0,0,0,0,0,0,0],[8,8,8,0,0,0,0,0,0,0],[8,8,8,8,0,0,0,0,0,0],[7,7,7,7,7,7,0,7,7,7],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[7,7,7,7,7,7... | [[8,8,0,0,8,8,0,0,0,0],[8,8,0,0,8,8,0,0,0,0],[8,8,0,0,0,0,0,0,0,0],[8,8,0,0,0,0,0,8,8,8],[8,8,0,0,0,0,0,8,8,8],[0,0,0,0,0,0,0,8,8,8],[7,7,7,7,0,7,7,7,7,7],[0,0,0,0,8,8,0,0,0,0],[8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8]] | [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,8,8,8,8,0,0,0],[8,8,8,8,8,8,8,8,8,8],[7,7,7,7,8,7,7,7,7,7],[8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8]] | {"train":[{"input":[[8,8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8,8],[0,0,0,0,0,8,0,0,0,0,0],[7,7,7,7,7,0,7,7,7,7,7],[8,8,8,8,0,8,0,8,8,8,8],[8,8,8,8,8,8,8,8,8,8,8],[8,0,0,0,0,0,0,0,8,8,8],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0,0],[... | [{"input":[[8,0,8,8,8,8,8,8,8,0,0],[8,8,0,0,8,8,8,8,8,8,8],[0,0,0,0,0,0,8,0,0,8,0],[8,8,0,0,8,0,8,8,0,8,8],[0,8,0,8,0,8,0,0,8,0,0],[7,7,7,7,7,0,7,7,7,7,7],[8,8,0,8,0,0,0,8,8,0,0],[0,0,0,0,0,8,8,8,7,8,0],[0,8,0,8,0,0,8,0,7,8,8],[0,8,8,8,0,8,8,0,7,0,8],[0,8,0,0,0,0,0,8,7,8,0]],"output":[[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0... | """Generator for Test2/t5 cyan-flow task."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
CYAN = 8
ORANGE = 7
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _neighbors4(r: int, c: int) -> list[tuple[int, int]]:
... | """Verifier for Test2/t5 cyan-flow task."""
from __future__ import annotations
from typing import List
from generator import transform_t5
Grid = List[List[int]]
def verify_t5(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
if any(l... |
t6 | partition_rank | A grey rectangle encloses an area split into separate compartments, where each compartment has a single set of colored cells. In the grid, there is exactly one cell that is green (it can be in one of the compartments, or outside). Rank the compartments by how close their content cells (the colored cell) lie to the gree... | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,0,0,0,6,0,0,0,0,5,0],[0,5,0,0,0,0,6,0,0,0,5,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,0,0,0,0,0,0,1,0,5,0],[0,5,0,0,0,0,1,1,0,0,5,0],[0,5,5,5,5,5,5,5,5,5,5,3],[0,5,0,0,0,0,0,0,0,7,5,0],[0,5,0,0,0,0,0,0,7,0,5,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,0,0,5,0,0,5,0,0,5,0],[0,5,0,0,0,5,0,0,5,0,5,0],[0,5,0,0,5,0,0,5,0,0,5,0],[0,5,0,7,0,5,0,0,5,0,5,0],[0,5,0,0,5,0,0,5,0,4,5,0],[0,5,0,0,0,5,0,0,5,0,5,0],[0,5,0,0,5,0,1,5,0,0,5,0],[0,5,0,0,0,5,0,0,5,0,5,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,3]] | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,2,2,5,4,4,5,3,3,5,0],[0,5,2,2,2,5,4,4,5,3,5,0],[0,5,2,2,5,4,4,5,3,3,5,0],[0,5,2,2,2,5,4,4,5,3,5,0],[0,5,2,2,5,4,4,5,3,3,5,0],[0,5,2,2,2,5,4,4,5,3,5,0],[0,5,2,2,5,4,4,5,3,3,5,0],[0,5,2,2,2,5,4,4,5,3,5,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,3,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,5,5,5,5,5,5,5,5,0],[0,0,5,0,0,0,0,0,0,0,0,5,0],[0,0,5,0,0,0,0,0,0,0,0,5,0],[0,0,5,0,0,0,0,0,0,0,0,5,0],[0,0,5,0,0,0,0,6,0,0,0,5,0],[0,0,5,0,0,0,0,6,0,0,0,5,0],[0,0,5,0,0,0,0,0,0,0,0,5,0],[0,0,5,0,0,0,0,0,0,0,0,5,0],[0,0,5,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,5,5,5,5,5,5,5,5,0],[0,0,0,5,0,0,0,0,4,0,5,3],[0,0,0,5,5,5,5,5,5,5,5,0],[0,0,0,5,0,0,0,0,0,9,5,0],[0,0,0,5,5,5,5,5,5,5,5,0],[0,0,0,5,0,0,0,6,0,0,5,0],[0,0,0,5,0,0,0,0,0,0,5,0],[0,0,0,5,5,5,5,5,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0... | """Generator for Test2/t6 partition-distance ranking task."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
GREY = 5
GREEN = 3
RANK_COLORS = [3, 4, 2] # closest, second, third
# Only green is forbidden for partition objects.
OBJECT_PALETTE = [1, 2, 4, 6, 7, 8, 9]
... | """Verifier for Test2/t6 partition-distance ranking task."""
from __future__ import annotations
from typing import List
from generator import transform_t6
Grid = List[List[int]]
def verify_t6(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp... |
t7 | diagonal_wrap | A single cyan cell and one or more solid single-coloured objects sit on a black background. Trace the four diagonals out from the cyan cell and take the object it reaches first. Fill the black cells along that diagonal with cyan, stopping at the object. Then outline that object in cyan: every black cell orthogonally ad... | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,2,2,2,0],[0,0,0,0,0,2,2,2,0],[0,0,0,0,0,0,2,2,0],[0,7,7,0,0,0,0,0,0],[0,7,0,0,0,8,0,0,0],[0,7,0,0,0,0,0,0,0],[0,7,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,8,8,8,0],[0,0,0,0,8,2,2,2,8],[0,0,0,0,8,2,2,2,8],[0,0,0,0,0,8,2,2,8],[0,7,7,0,0,0,8,8,0],[0,7,0,0,0,8,0,0,0... | [[0,0,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,0,9,0],[0,6,0,0,0,0,0,0,9,0],[0,6,0,0,0,0,0,9,9,0],[0,0,0,0,0,0,0,9,9,0],[0,0,0,0,8,0,0,9,9,0],[0,0,0,0,0,0,0,0,9,0],[0,3,3,3,0,0,0,9,9,0],[0,0,0,3,3,0,0,9,0,0],[0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,0,9,0],[0,6,0,0,0,0,0,0,9,0],[0,6,0,0,0,0,0,9,9,0],[0,0,0,0,0,0,0,9,9,0],[0,0,0,0,8,0,0,9,9,0],[0,8,8,8,0,0,0,0,9,0],[8,3,3,3,8,0,0,9,9,0],[0,8,8,3,3,8,0,9,0,0],[0,0,0,8,8,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,8,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,3,0],[0,0,0,0,0,0,0,0,0,3,3,0],[0,7,0,0,0,0,0,0,3,3,3,0],[0,7,7,7,0,0,0,0,0,0,0,0],[0,7,7,7,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0],[0,4,4,0,0,0,0,0,0,0,0],[0,4,0,0,0,0,0,0,0,0,0],[0,4,0,0,0,8,0,0,0,0,0],[0,4,0,0,0,5,5,5,0,0,0],[0,0,0,0,0,5,0,5,5,0,0],[0,0,0,0,0,0,5,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0,0],[0,4,4,0,0,0,0,0,0,0,0],[0,4,0,0,0,0,0,0,0,0,0],[0,4,0,0,8... | """Generator for Test2/t7 diagonal-connect-and-wrap task."""
from __future__ import annotations
import copy
import random
from typing import List, Optional
Grid = List[List[int]]
CYAN = 8
PALETTE = [1, 2, 3, 4, 5, 6, 7, 9]
DIAGONALS = [(-1, -1), (-1, 1), (1, -1), (1, 1)]
def _empty(h: int, w: int) -> Grid:
re... | """Verifier for Test2/t7 diagonal-connect-and-wrap task."""
from __future__ import annotations
from typing import List
from generator import transform_t7
Grid = List[List[int]]
def verify_t7(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[... |
t8 | enclosed_red_gravity | There is a large body of blue cells in the grid ("water"). In this body, there are red cells ("fish") and a connected grey line, 8-connected ("the net"). The grey closed boundary encloses a body made of blue and red cells. Imagine extracting the contents of that enclosed body. Inside it let the red cells fall: in each ... | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[2,1,1,1,5,1,5,1,1],[1,1,1,5,1,1,5,1,2],[1,1,5,1,1,2,5,1,1],[1,5,1,2,1,1,1,5,1],[1,5,1,1,1,1,2,5,1],[1,1,5,1,2,1,5,1,1],[1,1,1,5,5,5,1,1,2]],"output":[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,2,2,2,2]]},{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[1,5,2,1,1,1,1,2,5,1],[2,5,1,2,1,2,1,5,1,1],[1,5,1,1,1,1,5,2,2,1],[1,1,5,1,2,1,1,5,1,1],[2,1,5,1,1,1,2,5,1,2],[1,1,5,2,1,2,5,1,1,1],[1,2,1,5,5,5,1,1,1,1],[1,1,1,1,1,1,2,1,1,2]] | [[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,2,0,2,0,0],[2,2,2,2,2,2]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[1,1,1,1,5,2,2,1,1,1,5,1],[1,1,1,5,1,1,1,1,1,1,5,1],[1,1,5,1,1,1,1,1,1,1,5,1],[1,1,5,2,1,1,1,1,1,5,1,1],[1,1,5,1,1,2,1,1,1,5,1,1],[1,5,1,1,2,2,2,1,2,5,1,1],[1,5,5,5,5,5,5,5,5,5,1,1],[1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1... | [{"input":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[1,1,5,2,1,1,5,1,1],[1,5,2,2,1,5,1,1,1],[1,5,1,1,1,5,1,1,1],[1,5,1,2,2,5,1,1,1],[1,5,5,5,5,1,1,1,1],[1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1]],"output":[[0,0,0,0],[0,2,0,0],[2,2,0,0],[2,2,2,0]]},{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0... | """Generator for Test2/t8 enclosed-body red gravity task."""
from __future__ import annotations
import copy
import random
from typing import List
Grid = List[List[int]]
BLUE = 1
RED = 2
GREY = 5
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _neighbors4(r: int, c: i... | """Verifier for Test2/t8 enclosed-body red gravity task."""
from __future__ import annotations
from typing import List
from generator import transform_t8
Grid = List[List[int]]
def verify_t8(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[... |
t9 | rectangle_assembly | Several coloured pieces lie scattered on the grid. Exactly one subset of them fits together, by translation only, into a solid rectangle with no gaps and no overlaps. Output that assembled rectangle, each piece keeping its own colour. Where more than one subset could work it is the one covering the largest area; pieces... | human_annotated | [{"input":[[0,0,1,0,0,0,0,4,0],[0,0,1,0,0,0,0,0,4],[1,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,9,9,9,9,0,0],[0,8,0,9,0,0,0,0,0],[8,0,0,9,0,0,0,0,0],[0,0,0,9,0,0,0,0,0],[0,0,0,0,0,0,0,0,0]],"output":[[9,9,9,9],[9,4,8,1],[9,8,4,1],[9,1,1,1]]},{"input":[[0,0,4,0,0,0,3,3],[0,4,0,0,0,0,3,0],[4,0,0,0,0,0,0,0],[0,0,0,0,0,0... | [[0,0,0,0,0,8],[0,1,1,0,0,8],[0,1,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,0],[2,0,0,0,5,5]] | [[1,1,8],[1,2,8],[1,5,5]] | {"train":[{"input":[[6,6,6,6,6,6,0,0,0,0,0,0,0,0],[6,6,6,6,6,6,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,4,4,0,0,0,0,0],[0,9,9,0,0,0,0,4,4,0,0,0,0,0],[9,9,9,9,0,0,0,0,4,0,0,0,0,0],[0,9,9,9,0,0,0,0,4,0,0,3,0,0],[0,0,0,0,0,0,0,0,0,0,0,3,3,0],[0,0,0,0,0,0,0,0,0,0,0,3,0,0],[0,0,0,0,0,0,0,0,0,0,0,3,3,0]]... | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[2,2,2,2,0,0,0,0,0,0],[0,2,2,0,0,0,0,0,0,0],[0,0,0,2,0,0,0,0,0,0],[0,0,0,0,0,0,0,8,0,0],[0,0,0,0,1,0,0,8,8,0],[0,0,0,1,0,0,0,8,8,0],[0,0,0,1,1,0,0,0,0,0]],"output":[[8,8,8,2],[8,8,2,2],[1,1,2,2],[1,2,1,2]]},{"input":[[0,0,3,0,0,0,0,0,6,6,6],[0,3,0,0,1,0,0,0,0,6,0],... | """Generator for Test2/t9 unique rectangle assembly task."""
from __future__ import annotations
import copy
import random
from dataclasses import dataclass
from itertools import combinations
from typing import List, Optional
Grid = List[List[int]]
PALETTE = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def _empty(h: int, w: int) -... | """Verifier for Test2/t9 unique rectangle assembly task."""
from __future__ import annotations
from typing import List
from generator import transform_t9
Grid = List[List[int]]
def verify_t9(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[... |
t10 | rot180_partner | Every cell has a 180-degree partner: the cell at the opposite position through the grid's centre. For each cell, keep its own colour if it is non-black, otherwise take the colour of its partner. In these puzzles at most one of any partner pair is non-black to begin with, so each pair ends up filled with that single col... | human_reviewed | [{"input":[[0,1,8,6,1,0,0,0,0],[0,0,0,0,6,0,0,0,4],[0,0,0,0,0,0,0,0,4],[0,0,0,0,0,0,0,0,4],[0,0,0,0,0,0,0,0,0],[0,0,8,0,0,0,0,0,0],[0,0,0,0,0,0,2,0,0],[0,0,0,0,0,0,0,0,0],[0,0,2,0,0,0,0,0,0]],"output":[[0,1,8,6,1,0,2,0,0],[0,0,0,0,6,0,0,0,4],[0,0,2,0,0,0,0,0,4],[0,0,0,0,0,0,8,0,4],[0,0,0,0,0,0,0,0,0],[4,0,8,0,0,0,0,0,0... | [[0,0,0,0,0,4,0,0,0,9],[0,0,0,0,4,0,4,0,0,0],[0,0,0,0,0,0,0,0,5,5],[2,2,2,0,0,0,0,0,0,5],[0,0,2,0,0,1,0,0,0,5],[0,0,0,0,0,0,0,0,0,0],[0,8,8,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,3,0,0,0,0,0,0,0,6],[0,3,3,0,0,0,0,0,6,6]] | [[6,6,0,0,0,4,0,3,3,9],[6,0,0,0,4,0,4,0,3,0],[0,0,0,0,0,0,0,0,5,5],[2,2,2,0,0,0,0,8,8,5],[0,0,2,0,0,1,0,0,0,5],[5,0,0,0,1,0,0,2,0,0],[5,8,8,0,0,0,0,2,2,2],[5,5,0,0,0,0,0,0,0,0],[0,3,0,4,0,4,0,0,0,6],[9,3,3,0,4,0,0,0,6,6]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[3,3,0,0,0,0,0,0,0],[3,3,0,0,0,9,9,9,0],[3,3,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[6,6,6,0,0,0,4,4,4],[6,6,0,0,0,0,0,0,0],[6,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,0,1,0,0,0,0],[0,0,0,1,1,1,0,0,0]],"output":[[0,0,0,1,1,1,0,0,0],[0,0,0,0,1,0,0,0,0],[3,3,0,0,... | [{"input":[[0,0,4,4,4,4,1,1,1,1,0,0],[0,0,4,4,4,0,1,1,1,0,0,0],[0,0,0,4,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,4,4,4,4,1,1,1,1,0,0],[0,0,4,4,4,0... | """Generator for Test2/t10: 180° partner fill (center-symmetric sparse overlay).
Rule:
- For each cell (r, c): output[r, c] = input[r, c] if nonzero, else
input[H - 1 - r][W - 1 - c] (180° partner).
Training-aligned input constraint (not required by the map algebra, but matches t10.json):
- On every 180° orbit, at ... | """Verifier for Test2/t10: 180° partner fill."""
from __future__ import annotations
from typing import List
from generator import transform_t10
Grid = List[List[int]]
def verify_t10(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
i... |
t11 | diagonal_bounce | A single non-black cell is the source, and its colour is the ray colour. Four rays leave it, one along each diagonal. A ray travels outward colouring every cell it passes in the source colour, until it reaches an edge of the grid; call that distance d. It then bounces off the edge and travels d further, still colouring... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,9,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,3,0,3,0,0,0,9,0],[0,9,0,1,0,0,0,9,0,9],[9,0,3,0,3,0,9,0,9,0],[0,9,0,0,0,9... | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,8,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,8,0,0,0,0,0,8,0,0],[0,0,8,0,3,0,3,0,8,0,8,0],[0,8,0,0,0,1,0,8,0,0,0,8],[8,0,0,0,3,0,3,0,0,0,8,0],[0,8,0,0,0,1,0,0,0,8,0,0],[0,0,8,0,3,0,3,0,8,0,0,0],[0,0,0,8,0,0,0,8,0,0,0,0],[3,0,3,0,8,0,8,0,0,0,3,0],[0,1,0,0,0,8,0,0,0,0,0,1],[3,0,3,0,8,0,8,0,0,0,3,0],[0,8,0,8,0,0,0,8,0,8,0,0],[0,0,8,0,0,0,0,0,8,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,2,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,2,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],... | """Generator for Test2/t11: diagonal rays with wall bounces.
Rule implemented:
- Input has exactly one non-zero start cell (source color).
- From start, shoot along all 4 diagonal directions.
- For each direction:
1) March to the first wall (boundary cell), coloring visited cells with source color.
2) Bounce off t... | """Verifier for Test2/t11 diagonal-bounce task."""
from __future__ import annotations
from typing import List
from generator import transform_t11
Grid = List[List[int]]
def verify_t11(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t12 | container_push | The input contains a straight full-length line of 9s and, touching it, a hollow shape open on one side — a C, a V, a diagonal cup, or a ring with one gap. Other coloured cells lie scattered around. In the output, the shape has slid in the direction of its opening, one cell at a time, pushing along every coloured cell i... | draft | [{"input":[[0,0,0,0,0,0,0,0,0,0],[1,1,1,6,0,0,0,0,0,0],[1,0,0,0,0,0,2,0,0,0],[1,0,0,0,0,2,0,0,6,0],[1,1,1,0,0,0,0,0,0,0],[9,9,9,9,9,9,9,9,9,9],[0,0,0,0,2,0,3,0,2,0],[0,4,0,4,0,0,0,0,0,0],[0,0,4,4,0,0,8,0,0,8],[0,0,0,4,0,0,8,8,8,8]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,1,1,6],[0,0,0,0,0,0,1,2,0,0],[0,0,0,0,0,0... | [[0,5,8,0,0,0,8,0,0,0,9,0],[0,5,0,0,0,0,0,6,0,0,9,0],[0,5,0,0,0,0,6,0,6,0,9,0],[0,0,0,3,0,6,0,0,0,6,9,0],[0,3,0,0,0,0,0,0,0,6,9,0],[0,0,8,0,0,6,0,0,0,6,9,8],[0,0,0,0,0,0,6,0,6,0,9,0],[0,0,0,0,0,0,0,6,0,0,9,0],[0,0,5,0,0,3,0,0,0,0,9,0],[0,0,0,0,0,0,0,5,0,0,9,0],[0,0,0,0,8,0,0,0,8,0,9,8],[0,0,3,0,0,0,0,0,0,0,9,0]] | [[0,5,8,0,0,0,8,0,0,0,9,0],[0,5,0,6,0,0,0,0,0,0,9,0],[0,5,6,0,6,0,0,0,0,0,9,0],[3,6,0,0,0,6,0,0,0,0,9,0],[0,3,0,0,0,6,0,0,0,0,9,0],[8,6,0,0,0,6,0,0,0,0,9,8],[0,0,6,0,6,0,0,0,0,0,9,0],[0,0,0,6,0,0,0,0,0,0,9,0],[0,0,5,0,0,3,0,0,0,0,9,0],[0,0,0,0,0,0,0,5,0,0,9,0],[0,0,0,0,8,0,0,0,8,0,9,8],[0,0,3,0,0,0,0,0,0,0,9,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,2,0,3,0,0,2,0,4,0,0,0,0],[0,0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,1,0,0,0],[0,0,0,0,0,0,0,0,0,8,8,8,0],[0,1,0,0,0,0,0,0,0,0,0,8,0],[1,0,0,0,0,0,0,0,0,0,0,8,0],[0,0,0,0,0,0,0,0,0,8,8,8,0],[9,9,9,9,9,9,9,9,9,9,9,9,9],[0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[4,0,0,0,0,1,0,0,0,0,0,0],[5,0,0,0,1,0,0,0,0,0,0,9],[0,0,0,0,0,1,0,0,4,0,9,0],[0,0,0,0,0,0,1,6,1,9,0,0],[7,0,0,0,0,0,6,1,9,0,0,0],[0,0,0,0,0,6,0,9,4,0,0,0],[0,0,0,0,0,0,9,0,0,3,0,0],[0,0,0,0,0,9,0,0,4,0,0,2],[0,0,8,0,9,0,0,4,0,0,0,0],[0,0,0,9,2,0,0,0,0,0,0,0],[0,0,9,0,0,0,0,0,0,0,0,... | """Generator for Test2/t12: demonstration-grounded container push.
Design:
- Container templates are grounded in the provided t12 demonstrations/test.
- We expand those templates with rotations/mirrors for directional variety.
- Container opening direction is therefore unambiguous by template identity.
- Support bar (... | """Verifier for Test2/t12 container push task."""
from __future__ import annotations
from typing import List
from generator import transform_t12
Grid = List[List[int]]
def verify_t12(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t13 | concentric_layers | The pattern is a set of concentric rectangular rings around a red center, each ring a single colour, with one green cell somewhere among them. Peel inward from the outermost ring, counting a new layer each time the ring colour changes. Stop at the ring the green cell lies on: replace that green cell with the ring's own... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0],[0,4,4,4,4,4,4,4,0],[0,4,1,1,1,1,1,4,0],[0,4,1,3,5,5,1,4,0],[0,4,1,5,2,5,1,4,0],[0,4,1,5,5,5,1,4,0],[0,4,1,1,1,1,1,4,0],[0,4,4,4,4,4,4,4,0],[0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0],[0,4,4,4,4,4,4,4,0],[0,4,1,1,1,1,1,4,0],[0,4,1,5,5,5,1,4,0],[0,4,1,5,2,5,1,4,0],[0,4,1,5,5,5,1,4,0... | [[0,0,0,0,0,0,0,0,0,0,0],[0,8,8,8,8,8,8,8,8,8,0],[0,8,6,6,6,6,6,6,6,8,0],[0,8,6,5,5,5,5,5,6,8,0],[0,8,6,5,4,4,4,5,6,8,0],[0,8,6,5,4,3,4,5,6,8,0],[0,8,6,5,4,4,4,5,6,8,0],[0,8,6,5,5,5,5,5,6,8,0],[0,8,6,6,6,6,6,6,6,8,0],[0,8,8,8,8,8,8,8,8,8,0],[0,0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0,0],[0,8,8,8,8,8,8,8,8,8,0],[0,8,6,6,6,6,6,6,6,8,0],[0,8,6,5,5,5,5,5,6,8,0],[0,8,6,5,4,4,4,5,6,8,0],[0,8,6,5,4,2,4,5,6,8,0],[0,8,6,5,4,4,4,5,6,8,9],[0,8,6,5,5,5,5,5,6,8,9],[0,8,6,6,6,6,6,6,6,8,9],[0,8,8,8,8,8,8,8,8,8,9],[0,0,0,0,0,0,0,0,0,0,9]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,5,5,5,5,5,5,5,5,5,5,5,0],[0,0,5,5,5,5,5,5,5,5,5,5,5,5,5,0],[0,0,5,5,5,5,5,5,5,5,5,5,5,5,5,0],[0,0,5,5,5,8,8,8,8,8,8,8,5,5,5,0],[0,0,5,5,5,8,4,4,4,4,3,8,5,5,5,0],[0,0,5,5,5,8,4,4,4,4,4,8,5,5,5,0],[0,0,5,5,5,8,4,4,4,4,4,8,5,5... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,7,7,7,7,7,7,7,7,7,7,7,7,0,0],[0,7,1,1,1,1,1,1,1,1,1,1,7,0,0],[0,7,1,4,4,4,4,4,4,4,4,1,7,0,0],[0,7,1,4,8,8,8,8,8,8,4,1,7,0,0],[0,7,1,4,8,6,6,6,6,8,4,1,7,0,0],[0,7,1,4,8,3,5,5,6,8,4,1,7,0,0],[0,7,1,4,8,6,6,6,6,8,4,1,7,0,0],[0,7,1,4,8,8,8,8,8,8,4,1,7,0,0],[0,7,1,4,4,4,4,4,4,4,... | """Generator for Test2/t13: concentric rectangular layers + green marker + score stack.
Rule (matches Test2/t13.json demos):
- Input is a 0-padded grid with a solid axis-aligned rectangle of non-zero cells.
- Exactly one cell is green (3), marking a position inside the rectangle.
- Concentric layers are onion rings wi... | """Verifier / forward transform for Test2/t13 (concentric layers + green marker)."""
from __future__ import annotations
import copy
from collections import Counter, defaultdict
from typing import List, Tuple
Grid = List[List[int]]
GREEN = 3
MARK = 9
BG = 0
def _bbox_nonzero(g: Grid) -> Tuple[int, int, int, int]:
... |
t14 | dot_jump_star | A red cell sits on the bottom row and travels right along it. It steps forward as long as it can. The red block can cross empty cells always and when a green block stands directly ahead it jumps over (landing to the right of it) but only if that block's column is one or two cells tall and the landing cell is empty; any... | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,0,0,0,0,3,0,0,0],[2,0,0,3,0,3,0,0,0,0,3,0]],"output":[[0,0,0,0,0,0,0,0,0,0,4,0],[0,0,0,0,0,0,0,0,0,4,4,4],[0,0,0,0,0,0,0,0,0,0,4,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,0,0,0,0,3,0,0,0],[0,0,0,3,0,3... | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,0,0],[0,0,0,0,0,0,0,0,0,3,0,0],[0,0,3,3,0,3,0,3,0,3,0,0],[2,0,0,0,0,3,0,3,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0,4,0],[0,0,0,0,0,0,0,0,0,4,4,4],[0,0,0,0,0,0,0,0,0,3,4,0],[0,0,0,0,0,0,0,0,0,3,0,0],[0,0,3,3,0,3,0,3,0,3,0,0],[0,0,0,0,0,3,0,3,0,0,0,2]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,3,0,0,0,0,0,0,0,0,3,0,0],[2,3,0,0,3,0,0,0,0,0,0,0,0,3... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0,0,0,0],[2,0,0,0,3,0,3,0,3,0,3,0,0,0]],"output"... | """Generator for Test2/t14: bottom-runner jump/duck with conditional star."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
BG = 0
DOT = 2
BLOCK = 3
STAR = 4
def _copy_grid(g: Grid) -> Grid:
return [row[:] for row in g]
def _grounded_height(g: Grid, c: int) ... | """Verifier for Test2/t14 dot jump + duck + conditional star task."""
from __future__ import annotations
from typing import List
from generator import transform_t14
Grid = List[List[int]]
def verify_t14(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
... |
t15 | partition_clockwise | In the grid, there is a pattern. The pattern has four-fold rotational symmetry about a centre, except for a single cell that breaks it. Move that one cell a quarter turn clockwise about the centre, into the position its rotation would occupy, leaving black behind where it was. Every other cell is unchanged. | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,0,1,0],[0,0,0,1,0,0,0,6,0,0],[0,0,0,0,1,0,1,0,0,0],[0,0,2,0,0,1,0,0,0,0],[0,0,0,0,1,0,1,0,0,0],[0,0,0,8,0,0,0,1,0,0],[0,0,1,0,0,0,0,0,1,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,2,0,0,1,0],[0,0,0,1,0,0... | [[0,0,0,0,0,0,0,0,0],[0,0,0,8,8,2,0,0,0],[0,0,8,0,4,0,8,0,0],[0,7,0,8,8,8,0,8,0],[8,0,8,0,0,0,8,0,8],[3,0,8,0,0,0,8,0,8],[8,0,8,0,0,0,7,0,8],[0,8,0,8,8,8,0,8,0],[0,0,8,0,0,0,8,0,0],[0,0,0,2,2,8,0,0,0]] | [[0,0,0,0,0,0,0,0,0],[0,0,0,8,8,2,0,0,0],[0,0,8,0,0,0,8,0,0],[0,7,0,8,8,8,0,8,0],[8,0,8,0,0,0,8,0,8],[3,0,8,0,0,0,8,4,8],[8,0,8,0,0,0,7,0,8],[0,8,0,8,8,8,0,8,0],[0,0,8,0,0,0,8,0,0],[0,0,0,2,2,8,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,5,5,0,0,0,0],[0,0,0,0,5,0,5,0,0,0,0,0],[0,0,0,0,5,5,5,5,2,0,0,0],[0,0,0,0,0,0,5,0,5,0,0,0],[0,0,0,0,0,5,5,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,6,3,0,0,0,0,0,0],[0,0,0,6,6,6,0,0,0,0,0,0],[0,0,6,1,6,5,6,0,0,0,0,0],[0,0,0,6,1,6,0,0,0,0,0,0],[0,0,0,0,6,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,... | """Generator for Test2/t15: move independent cell one partition clockwise."""
from __future__ import annotations
import random
from collections import Counter
from typing import List, Sequence, Tuple
Grid = List[List[int]]
Pos = Tuple[int, int]
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] ... | """Verifier for Test2/t15 partition-clockwise move rule."""
from __future__ import annotations
from typing import List
from generator import transform_t15
Grid = List[List[int]]
def verify_t15(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(in... |
t16 | edge_assembly | Exactly one colour other than grey appears, in small fragments, alongside several grey shapes. Treat the coloured fragments as pieces, where fragments touching only at a diagonal count as one piece. Work out which shapes can be built by fitting those pieces together without overlaps. In the output the original colored ... | human_reviewed | [{"input":[[0,5,0,5,0,0,5,0,0,0],[0,0,5,0,0,0,5,0,0,2],[0,5,0,5,0,0,5,0,2,2],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,5,0,0,0,0],[0,0,0,0,5,5,5,0,0,0],[2,2,0,0,0,5,0,0,5,0],[0,2,5,5,0,0,0,5,5,0],[0,0,0,5,5,0,0,5,5,0],[0,0,0,5,5,0,0,0,5,0]],"output":[[0,5,0,5,0,0,5,0,0,0],[0,0,5,0,0,0,5,0,0,0],[0,5,0,5,0,0,5,0,0,0],[0,0,0,0,0,0... | [[0,1,1,1,0,0,0,0,0,5,5,0],[0,1,0,0,0,5,5,5,0,5,5,0],[0,0,0,0,0,0,5,5,0,5,5,0],[0,5,5,5,0,0,0,5,0,0,0,0],[0,5,5,5,5,0,0,0,0,0,0,0],[0,0,0,5,0,0,0,0,0,5,5,5],[0,0,0,5,0,0,0,0,5,5,5,0],[0,0,0,0,0,0,5,0,0,5,0,0],[0,0,0,0,0,0,5,0,0,5,0,0],[1,1,1,0,0,0,5,0,0,0,0,0],[0,1,0,0,0,0,5,0,5,5,5,0],[0,1,0,0,0,0,5,0,5,0,0,0]] | [[0,0,0,0,0,0,0,0,0,5,5,0],[0,0,0,0,0,5,5,5,0,5,5,0],[0,0,0,0,0,0,5,5,0,5,5,0],[0,1,1,1,0,0,0,5,0,0,0,0],[0,1,1,1,1,0,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0,5,5,5],[0,0,0,1,0,0,0,0,5,5,5,0],[0,0,0,0,0,0,5,0,0,5,0,0],[0,0,0,0,0,0,5,0,0,5,0,0],[0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,0,5,0,5,5,5,0],[0,0,0,0,0,0,5,0,5,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0],[0,5,0,0,0,0,0,0,1,0,0,0,0,5,0,0],[0,5,0,0,0,0,0,0,0,0,5,5,5,5,0,0],[0,5,0,0,0,0,0,0,5,0,5,5,5,0,0,0],[0,5,0,0,0,5,5,5,5,0,5,0,0,0,0,0],[0,0,0,0,0,5,5,5,0,0,0,0,0,0,0,1],[0,0,0,0,0,5,0,0,0,0,5,0,0,0,1,1],[0,0,0,0,0,0,0,5,5,5,5,0,0,0... | [{"input":[[0,0,0,0,0,0,6,6,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,5,5,0,0,5,0,0,0],[0,0,0,0,0,0,5,5,0,0,0,0,0,0],[0,0,0,0,0,5,0,0,5,0,5,0,0,0],[0,0,5,5,5,5,0,0,5,5,5,0,0,0],[0,5,5,5,0,5,0,0,0,5,0,0,0,0],[0,0,0,0,0,0,0,0,0,5,5,0,0,0],[0,0,0,0,0,5,5,0,0,0,0,0,0,0],[0,0,0,0,0,5,5,0,0,0,5,5,0,0],[6,6,0,0,... | """Generator for Test2/t16: edge fragments assemble to a target grey shape.
Orthogonally-connected task-color islands are fused transitively whenever they king-touch,
so diagonal contact defines a single prototype (no special-case ridge split).
Interior grey is matched on 4-connectivity only. Generator rejects layout... | """Verifier for Test2/t16 edge-assembly recoloring."""
from __future__ import annotations
from typing import List
from generator import transform_t16
Grid = List[List[int]]
def verify_t16(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])... |
t17 | pattern_fall | The foreground is a single colour and consists of repeated copies of one shape, some of them clipped by the grid edge. Every copy falls straight down by exactly the height of that shape. The output shows only the fallen copies, on an otherwise empty grid. Note that partially shown patterns fall into the grid in full (e... | human_reviewed | [{"input":[[0,0,0,6,6,6,0,0,6],[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,6,0,0],[0,0,0,0,0,0,6,0,6],[0,0,6,0,0,0,6,6,6],[0,0,6,0,6,0,0,0,0],[0,0,6,6,6,0,0,0,0],[0,0,0,0,0,0,6,0,0],[0,0,0,0,0,0,6,0,6]],"output":[[0,0,0,0,0,0,0,0,0],[0,0,0,6,0,0,0,0,6],[0,0,0,6,0,6,0,0,6],[0,0,0,6,6,6,0,0,6],[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,6,0,0... | [[4,4,4,0,4,4,0,0,0,0,4,4],[4,4,0,0,4,0,4,0,0,0,4,0],[4,0,4,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,4,4,4,0,0,0,0,0,0],[0,0,0,4,4,0,0,0,4,4,4,0],[4,4,0,4,0,4,0,0,4,4,0,0],[4,0,0,0,0,0,0,0,4,0,4,0],[0,4,0,0,0,4,4,4,0,0,0,0],[0,0,0,0,0,4,4,0,0,4,4,4],[0,4,4,4,0,4,0,4,0,4,4,0],[0,4,4,0,0,0,0,0,0,4,0,4]] | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,4,4,4,0,0,0,4,4],[4,4,4,0,4,4,0,0,0,0,4,4],[4,4,0,0,4,0,4,0,0,0,4,0],[4,0,4,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,4,4,4,0,0,0,0,0,0],[0,0,0,4,4,0,0,0,4,4,4,0],[4,4,0,4,0,4,0,0,4,4,0,0],[4,0,0,0,0,0,0,0,4,0,4,0],[0,4,0,0,0,4,4,4,0,0,0,0]] | {"train":[{"input":[[4,0,0,0,4,4,0,0,0,0,0,0,0,0,4,4],[4,0,0,0,0,0,0,4,0,0,0,0,0,0,4,4],[0,0,4,0,0,0,0,0,4,4,0,0,0,0,0,0],[0,0,0,4,4,0,0,0,4,4,0,0,0,0,0,0],[4,0,0,4,4,0,0,0,0,0,0,0,0,0,4,0],[4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,4,0,0,0,0,0... | [{"input":[[4,0,0,0,0,0,0,0,0,4],[0,0,0,4,4,0,0,0,0,0],[0,0,0,4,4,0,0,0,0,0],[0,0,0,0,4,0,0,0,0,0],[0,0,0,0,0,0,0,0,4,4],[0,0,0,0,0,0,0,0,4,4],[4,0,0,0,0,0,0,0,0,4],[4,0,0,4,4,0,0,0,0,0],[4,0,0,4,4,0,0,4,4,0],[0,0,0,0,4,0,0,4,4,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[4,0,0,0,0,0,0,0,4,4],[4,0,0,0,0,0... | """Generator for Test2/t17 (pattern fall).
The prototype is always **fully visible** somewhere on the grid (an unclipped copy),
with at least one placement **strictly inside** the outer border (not on row/column 0
or the last row/column).
**Inference.** Prefer strictly interior 4‑connected foreground blobs of size 2–... | """Verifier for Test2/t17 recurring-pattern downward shift."""
from __future__ import annotations
from typing import List
from generator import transform_t17
Grid = List[List[int]]
def verify_t17(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len... |
t18 | half_wrap | A horizontally periodic motif occupies one half of the grid, with its axis row reaching one side edge (left or right) and not touching the opposite edge. The motif wraps into the other half on the same side as that wrap edge, shifted vertically into the other half, and from there continues across that half all the way ... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,8,0,0,0,8,0],[0,0,0,8,0,8,0,8,0,8],[0,0,8,0,0,0,8,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,8,0,0,0,8,0],[0,0,0,8,0,8... | [[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,9,0,0,0,9,0],[0,0,9,0,0,0,9,0,0,0],[0,0,9,9,9,9,9,9,9,9],[0,0,9,0,0,0,9,0,0,0],[0,0,0,0,9,0,0,0,9,0]] | [[0,0,0,9,0,0,0,9,0,0],[0,9,0,0,0,9,0,0,0,9],[9,9,9,9,9,9,9,9,9,9],[0,9,0,0,0,9,0,0,0,9],[0,0,0,9,0,0,0,9,0,0],[0,0,0,0,9,0,0,0,9,0],[0,0,9,0,0,0,9,0,0,0],[0,0,9,9,9,9,9,9,9,9],[0,0,9,0,0,0,9,0,0,0],[0,0,0,0,9,0,0,0,9,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,0,1,0,0,0,0],[0,0,1,0,0,0,0,0,1,0,0,0,0],[0,1,1,1,1,1,1,1,1,1,1,1,1],[0,0,0,0,0,1,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,8,0,0,0,8,0,0,0,8,0,0],[0,0,0,0,0,8,0,0,0,8,0,0,0,8],[0,0,8,8,8,8,8,8,8,8,8,8,8,8],[0,0,0,0,0,8,0,0,0,8,0,0,0,8],[0,0,0,8,0,0,0,8,0,0,0,8,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,... | """Generator for Test2/t18: horizontal periodic pattern wrapping between halves.
Rule: a horizontally periodic motif occupies one half of the grid, with its
axis row reaching one of the side edges (left or right) and NOT touching the
opposite edge. The motif then "wraps" into the other half on the SAME side as
the wra... | """Verifier for Test2/t18 horizontal wrap-and-continue rule."""
from __future__ import annotations
from typing import List
from generator import transform_t18
Grid = List[List[int]]
def verify_t18(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = le... |
t19 | dot_line_split | Two grey cells sit on two different edges of the grid; imagine a straight line (can be diagonal) between them that divides the grid into two sides. No shape touches that line. Each side is handled on its own, using only the cells on it, and grey cells never count as part of a shape. If a side holds more than one shape... | human_reviewed | [{"input":[[5,0,0,0,0,8,0,0,0,0],[0,0,0,0,0,8,0,0,0,0],[0,0,0,0,0,8,0,0,0,0],[0,0,0,0,0,8,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,3,3,3,0,0,0,0,0,0],[0,3,0,0,0,0,0,0,0,0],[0,3,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,5]],"output":[[5,0,0,0,0,8,8,8,8,0],[0,0,0,0,0,8,8,8,8,0],[0,0,0,0,0,8,8,8,8,0],[0,0,0,0,0,8... | [[0,0,0,0,0,0,2,2,2,2,2],[0,0,0,0,0,0,0,0,0,0,2],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[5,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,3,3,3,0,0,0],[0,0,0,0,0,3,0,0,0,0,0],[4,0,0,0,0,3,0,0,0,0,0],[4,0,0,0,0,0,0,0,0,0,0],[4,4,4,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0]] | [[0,0,0,0,0,5,5,5,5,5,5],[0,0,0,0,0,5,5,5,5,5,5],[0,0,0,0,0,5,5,5,5,5,5],[0,0,0,0,0,5,5,5,5,5,5],[5,0,0,0,0,5,5,5,5,5,5],[0,0,0,0,0,5,5,5,5,5,5],[0,0,0,0,0,5,5,5,5,5,5],[4,4,4,0,0,5,5,5,5,5,5],[4,4,4,0,0,0,0,0,0,0,0],[4,4,4,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,8,0],[0,0,0,0,0,0,0,0,8,0,0],[0,0,0,0,0,0,3,0,0,8,0],[0,0,0,0,0,0,3,0,0,0,5],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,7,7,0],[0,0,0,5,0,0,0,0,7,0,0]],"output":[[... | [{"input":[[0,0,0,5,0,0,6,6,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,7,7,0,0],[0,0,0,0,0,0,0,0,0,7,7,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[2,2,2,0,0,0,0,0,0,0,0,0,0,0],[2,0,0,0,... | """Generator for Test2/t19: split-by-dots line and side-wise box growth/fill.
Rule:
- Exactly two gray dots (color 5) lie on two different grid edges.
- The (invisible) line through these dots splits the grid into two halves.
- Each half is processed independently:
* If the half contains multiple shapes (8-connected... | """Verifier for Test2/t19 split-by-dots line rule."""
from __future__ import annotations
from typing import List
from generator import transform_t19
Grid = List[List[int]]
def verify_t19(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t20 | space_invaders | The rule is an adaption of the game space invaders. Alien ships are the foreground components that are neither grey nor pink. Pink cells are shots, fired vertically upward. Shots are resolved by shooter row, from the top row down, and each shot destroys ("deletes/makes black") the whole connected component of the first... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,2,2,0,2,2,0,2,2,0,2,2],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,0,2,2,2,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[2,2,2,2,0,0,0,0,2,2,2,2],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,6,6,0,0,0,0],[0,0,0,6,0,0,0,0,0,0,6,0],[0,0,0,0,0,0,6,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,5,5,5,0,0,0,... | [[0,0,0,0,0,8,8,8,8,8,8],[8,8,0,8,8,8,8,0,0,8,8],[0,0,0,0,0,0,0,0,0,0,0],[0,8,8,8,0,8,8,8,8,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,8,8,8,0,8,8,0,8,8,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,6,0,0,6,6,0,0,6,0],[0,0,0,0,0,0,6,0,0,6,0],[0,0,0,0,0,0,5,0,0,0,0],[0,0,0,0,0,5,5,5,0,0,0]] | [[0,0,0,0,0,8,8,8,8,8,8],[8,8,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,8,8,8,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0],[0,0,0,0,0,5,5,5,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,7,7,7,0,0,0,0,0,0,7,7],[0,7,7,7,7,7,7,7,7,7,7,7],[0,0,7,7,7,7,7,7,7,0,7,7],[7,7,0,7,7,7,7,7,7,7,7,0],[0,0,0,0,0,0,0,0,0,0,6,0],[0,6,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,6,0,0,0,0,0,0],[0,0,0,0,0,0,0,6,0,0,0,0],[0,0,0,5,0,0,0,0,0,0,0,0],[0,0,5,5,5,0,0,0,0,0,0,0]],"output":[[0,... | [{"input":[[0,0,0,0,0,0,0,0,0,0],[8,8,8,0,8,8,8,8,8,8],[8,8,0,0,0,0,0,0,0,0],[0,0,8,8,8,8,8,8,8,0],[8,8,0,0,0,0,8,8,8,8],[0,0,0,0,0,0,0,8,8,8],[0,0,0,0,0,0,6,0,0,0],[0,0,0,0,0,0,0,6,0,0],[0,0,0,0,6,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,6,0,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,5,5,5,0,0]],"output":[[0,0,0,0,0,0... | """Generator for Test2/t20: space-invader style ship destruction.
Rule:
- Alien ships are foreground components (non-zero, non-gray, non-pink).
- Pink cells (6) are shots fired vertically upward.
- Shots are processed by shooter row from top to bottom.
- Within the same row, shot order is chosen to maximize total ship... | """Verifier for Test2/t20 space-invader shooting rule."""
from __future__ import annotations
from typing import List
from generator import transform_t20
Grid = List[List[int]]
def verify_t20(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[... |
t21 | corner_swap | Four square patches, one at each corner, are cut from the input. Their side length k is the side of the bounding box of the largest corner shape, where cells touching diagonally count as joined. The patches are then swapped diagonally: top-left with bottom-right, and top-right with bottom-left. The output is the 2k by ... | human_reviewed | [{"input":[[5,5,4,0,2,0,7,0,8,0],[0,0,4,0,0,0,0,8,0,0],[0,4,0,0,6,0,0,0,8,0],[0,0,0,0,6,6,0,0,0,0],[0,8,8,0,0,0,0,9,0,6],[8,0,0,0,9,5,0,0,0,0],[0,0,2,0,0,0,0,0,3,0],[0,2,0,0,0,0,0,9,0,9],[0,0,1,2,0,0,0,0,9,0],[0,1,0,0,0,0,0,0,0,0]],"output":[[0,0,3,0,0,0,2,0],[0,9,0,9,0,2,0,0],[0,0,9,0,0,0,1,2],[0,0,0,0,0,1,0,0],[7,0,8... | [[7,7,7,0,8,8,0,0,1,6,7,7],[0,7,0,0,0,8,8,0,1,6,0,0],[7,1,1,1,0,0,8,0,6,6,6,0],[0,3,3,0,0,0,8,0,0,0,0,0],[0,0,0,0,9,0,0,0,0,2,0,0],[0,0,0,9,9,9,9,0,2,0,2,0],[8,8,8,8,8,8,0,2,0,0,0,2],[0,0,0,0,0,6,0,0,0,0,0,0],[4,5,5,0,0,6,6,0,9,0,8,8],[4,0,0,9,0,0,6,0,0,8,8,0],[4,4,4,9,0,0,6,3,0,8,4,4],[0,0,0,9,0,3,3,3,0,8,0,4]] | [[9,0,8,8,4,5,5,0],[0,8,8,0,4,0,0,9],[0,8,4,4,4,4,4,9],[0,8,0,4,0,0,0,9],[1,6,7,7,7,7,7,0],[1,6,0,0,0,7,0,0],[6,6,6,0,7,1,1,1],[0,0,0,0,0,3,3,0]] | {"train":[{"input":[[8,0,0,0,0,6,0,0,0,0,4,0,0],[2,8,0,0,0,6,6,1,1,0,0,4,6],[2,2,0,0,0,6,0,1,1,0,4,4,6],[0,0,0,0,0,6,0,0,0,0,0,0,0],[0,7,7,0,0,0,0,0,0,0,0,0,0],[0,0,7,0,7,0,0,0,0,0,0,0,0],[0,0,7,7,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,2,0,0,0],[0,0,0,0,0,0,0,2,0,2,0,0,0],[0,0,0,0,0,0,0,2,2,0,0,0,0],[0,4,0,0,0,0,0,0,0,0... | [{"input":[[0,5,5,5,0,0,0,0,0,0,0,0],[0,0,5,5,0,0,0,0,0,0,3,0],[0,0,5,0,0,0,0,0,5,5,0,0],[0,0,0,0,0,0,5,0,5,5,3,0],[0,0,0,0,0,0,5,0,0,0,0,0],[1,1,0,0,0,5,5,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,5,0,0,0,0,0,0],[0,6,6,6,0,4,4,0,0,8,0,0],[0,0,6,6,0,4,4,0,8,3,8,0],[0,0,6,6,0,4,4,0,0,8,3,3]],"output":[[0,8,0,0,6,6... | """Generator for Test2/t21: extract corner blocks and swap diagonally.
Rule:
- Determine corner size k from input as the bbox side length of the largest
corner-assigned 8-connected non-background component.
- Extract the four kxk corner patches from input.
- Rearrange diagonally:
TL <- BR, TR <- BL, BL <- TR, BR... | """Verifier for Test2/t21 corner extraction and diagonal swap."""
from __future__ import annotations
from typing import List
from generator import transform_t21
Grid = List[List[int]]
def verify_t21(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = ... |
t22 | center_connect | Every colour has an anchor: its cell lying closest to the centre of the grid, measured by straight-line distance. No colour has two cells tied for closest, and no two colours have their anchors on the same row. Work through the colours in order of anchor row, top to bottom. For each colour, connect its anchor to each o... | human_reviewed | [{"input":[[0,0,6,0,0,0,0,0,5,0,0],[0,0,0,0,0,0,0,0,0,0,0],[5,0,0,1,0,0,0,0,0,0,0],[0,0,0,0,0,0,5,0,0,0,6],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,6,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,1],[6,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,6,0,0,0,0],[0,1,0,0,0,0,0,0,0,5,0]],"output":[[0,0,6,6,6,6,6,5,5,0,0],[0,0,0,0,0... | [[0,0,0,0,3,0,0,0,1,0,0],[0,6,0,0,0,0,0,0,0,0,6],[0,0,0,0,0,0,0,0,0,1,0],[1,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,1,0,0,0],[0,0,0,3,0,0,0,0,0,0,3],[6,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,6,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0],[0,0,0,0,0,0,0,0,0,0,0],[6,0,0,0,0,0,0,0,6,0,0]] | [[0,0,0,3,3,0,0,1,1,0,0],[0,6,6,6,6,6,6,6,6,6,6],[0,0,0,3,0,6,0,1,1,1,0],[1,1,1,3,1,6,1,1,0,0,0],[0,0,0,3,0,6,0,1,0,0,0],[0,0,0,3,3,6,3,3,3,3,3],[6,6,6,6,6,6,0,0,0,0,0],[0,0,0,3,0,6,0,0,0,0,0],[0,0,0,3,3,6,3,3,3,0,0],[0,0,0,0,0,6,0,0,0,0,0],[6,6,6,6,6,6,6,6,6,0,0]] | {"train":[{"input":[[0,0,0,5,0,0,4,0,0,0,0,0,0],[0,0,0,0,0,5,0,0,0,0,0,0,0],[8,0,0,0,0,0,0,0,0,0,0,0,4],[0,5,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,4,0,0,0,0,0,0,0,0],[0,0,0,0,0,5,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,1,0,2],[0,0,0,0,0,0,0,1,0,0,8,0,0,0],[8,0,0,0,0,0,0,0,0,0,0,2,2,8],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,2],[0,0,0,0,0,8,0,0,0,0,0,0,0,2],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0,0,0,1,0],[0,0,2,0,0,0,0,0,0,0,0,2,8,0],[0,0,0,8,0,0,0,0,0,0,0,0,8,1]],"output"... | """Generator for Test2/t22: center anchor connects to same-color cells.
Rule:
- For each non-background color, choose its most central cell (nearest to grid
center by squared Euclidean distance) as anchor.
- Process colors in order of anchor row, top to bottom.
- For each target cell of that color, draw an L path fr... | """Verifier for Test2/t22 center-connect rule."""
from __future__ import annotations
from typing import List
from generator import transform_t22
Grid = List[List[int]]
def verify_t22(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t23 | shape_connect | Cells of the same colour that touch, including diagonally, form one shape. Take every pair of shapes that share a colour. If the two shapes share a row, they can be joined straight across it; if they share a column, straight down it. Where both are possible, use the shorter join, and where those tie, the horizontal one... | human_reviewed | [{"input":[[1,1,1,0,0,3,3,3,3,0],[1,0,0,0,3,3,0,0,3,3],[1,2,0,3,0,0,0,0,0,3],[1,2,0,3,0,0,4,0,0,0],[0,2,0,3,0,4,4,0,0,0],[0,2,0,3,0,4,0,0,2,0],[4,0,0,0,0,4,0,2,0,0],[4,0,0,0,0,0,2,2,0,0],[4,4,4,0,0,2,2,0,0,0],[0,0,0,3,3,3,3,0,0,1]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0... | [[0,0,6,6,6,6,6,0,0,0],[2,2,2,0,0,0,0,8,8,8],[2,0,0,9,3,3,3,0,0,6],[2,0,0,0,9,0,7,0,0,6],[0,0,0,0,0,9,0,7,0,6],[8,8,0,0,0,0,0,0,7,6],[6,6,6,0,9,7,3,0,0,7],[0,8,0,9,0,7,3,0,0,0],[0,8,9,0,0,7,3,2,2,2],[0,9,0,0,0,7,8,8,0,0]] | [[0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,5,0,0],[0,0,5,0,0,0,5,5,0,0],[0,0,5,0,5,0,5,5,0,0],[0,0,5,0,5,0,5,5,0,0],[0,5,0,0,0,0,5,5,5,0],[0,0,0,0,0,0,0,5,0,0],[0,0,0,0,0,0,0,5,0,0],[0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,4,0,0,0,3,3],[9,9,9,0,0,4,0,0,0,0,0],[0,9,9,0,0,0,0,0,0,8,8],[0,0,9,0,0,0,0,1,0,0,8],[0,0,0,0,0,0,0,1,0,0,0],[0,0,0,1,0,0,0,1,0,3,0],[0,0,0,1,0,0,0,0,0,3,0],[0,0,0,9,0,0,0,0,0,3,8],[7,0,9,9,9,9,0,0,0,8,8],[7,0,9,0,0,0,0,0,0,0,8],[7,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0,0],[... | [{"input":[[3,3,3,0,0,0,0,0,0,0,0],[0,3,0,0,0,0,0,0,0,0,0],[2,2,0,0,8,8,0,0,4,0,0],[2,2,0,0,0,8,0,0,4,4,0],[0,2,0,0,0,0,0,0,4,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,7,0,0,0,0,0,0],[0,3,0,7,7,0,0,7,7,0,0],[0,3,3,0,0,0,0,7,0,0,0],[0,0,3,0,0,0,0,0,0,0,0],[2,2,2,2,0,0,0,0,0,0,0],[0,2,2,0,0,0,0,4,4,4,... | """Generator for Test2/t23: connect same-color shapes with gray straight lines.
Interpretation used here:
- Shapes are 8-connected components of equal color (diagonal touch connects).
- For each color, every pair of its shapes connects at most once.
- A connection is valid only when the endpoint neighborhood orientati... | """Verifier for Test2/t23 same-color shape connection rule."""
from __future__ import annotations
from typing import List
from generator import transform_t23
Grid = List[List[int]]
def verify_t23(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len... |
t24 | virus_jump | A single red cell is an infection's starting point. Every other coloured region — cells of one colour joined edge to edge — is a shape that can catch it. The infection reaches from any infected cell to any cell of a shape that is next to it, either orthogonally or diagonally, or two steps away in a straight line with a... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,9,9],[0,0,3,3,3,3,0,0,9,4],[0,0,3,0,0,3,3,0,0,4],[0,0,3,0,2,0,0,0,0,4],[0,0,3,0,0,7,7,0,0,0],[0,0,0,0,7,7,0,0,5,0],[0,0,7,7,7,0,0,5,5,0],[0,0,7,0,0,5,5,5,0,0],[8,0,0,0,0,0,0,0,0,0],[8,0,0,9,9,0,0,0,9,9]],"output":[[0,0,0,0,0,0,0,0,9,9],[0,0,2,2,2,2,0,0,9,4],[0,0,2,0,0,2,2,0,0,4],[0,0,2,0,0,0... | [[0,0,0,4,0,0,0,0,0,0],[8,8,8,4,0,0,0,0,8,0],[8,0,0,4,0,0,0,0,8,0],[8,1,0,0,0,0,0,8,8,0],[0,1,1,0,0,2,0,8,0,0],[0,0,1,4,0,0,0,0,0,0],[3,3,3,0,4,0,0,0,6,6],[0,0,0,0,0,4,0,6,6,0],[0,0,6,6,6,0,4,6,0,0],[0,0,6,0,0,0,0,6,0,0]] | [[0,0,0,4,0,0,0,0,0,0],[8,8,8,4,0,0,0,0,2,0],[8,0,0,4,0,0,0,0,2,0],[8,1,0,0,0,0,0,2,2,0],[0,1,1,0,0,0,0,2,0,0],[0,0,1,4,0,0,0,0,0,0],[3,3,3,0,4,0,0,0,6,6],[0,0,0,0,0,4,0,6,6,0],[0,0,6,6,6,0,4,6,0,0],[0,0,6,0,0,0,0,6,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,9,9],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,6,0,0],[0,0,0,0,0,0,0,0,0,6,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,9,0],[0,0,0,0,0,6,6,0,0,0,9,9,0],[0,0,0,0,0,6,6,6,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[3,0,0,0,0,0,0,0,0,0,0,0],[3,3,0,0,0,0,0,8,0,0,0,0],[9,9,2,0,0,0,8,8,0,0,0,0],[1,0,1,0,0,8,8,0,0,0,1,0],[1,1,1,0,0,0,0,0,0,0,1,1],[1,1,1,0,0,0,0,0,0,0,1,1],[7,1,1,0,0,0,0,0,0,5,5,0],[7,7,0,0,0,0,0,0,5,5,0,0],[0,0,0,8,8,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0... | """Generator for Test2/t24: virus jump-spread recoloring.
Rule:
- Exactly one red virus cell (color 2) is present; no other red cells exist.
- Other cells form colored shapes (4-connected components of same color).
- Virus spreads from infected cells to shapes by either:
* direct orthogonal adjacency,
* orthogonal... | """Verifier for Test2/t24 virus jump spread rule."""
from __future__ import annotations
from typing import List
from generator import transform_t24
Grid = List[List[int]]
def verify_t24(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t25 | prototype_compose | The grid holds one foreground colour split into several 4-connected shapes. One of them is the prototype: the shape that cannot be composed from copies of any other shape present, but can itself compose at least one other. Where more than one qualifies it is the largest, and it is unique. Any shape that can be built ex... | human_reviewed | [{"input":[[0,9,0,9,9,0,0,0,0,0],[9,9,0,0,9,0,9,9,0,0],[0,0,9,9,0,0,9,9,0,0],[0,9,9,0,9,9,0,9,9,9],[9,9,0,0,9,9,9,0,0,9],[0,0,9,9,0,9,0,0,0,0],[9,9,0,9,0,0,0,0,9,0],[9,0,0,0,9,0,0,9,9,0],[0,0,9,0,9,9,0,0,0,9],[0,9,9,0,0,0,9,0,9,9]],"output":[[0,9,0,9,9,0,0,0,0,0],[9,9,0,0,9,0,0,0,0,0],[0,0,9,9,0,0,0,0,0,0],[0,9,9,0,9,9... | [[0,3,0,3,3,3,0,0,0,0,0],[0,3,0,0,0,3,0,3,3,3,0],[3,3,3,3,0,0,0,3,3,0,0],[0,0,0,3,3,3,0,3,3,0,0],[3,3,3,3,0,0,3,3,3,0,0],[0,3,0,0,0,0,0,0,0,0,0],[0,3,0,0,3,3,3,0,3,0,0],[0,0,0,0,0,3,0,0,3,3,3],[0,3,3,3,0,0,3,3,3,0,0],[0,0,3,0,0,0,0,3,0,0,0],[0,0,3,0,0,0,0,3,0,0,0]] | [[0,3,0,0,0,0,0,0,0,0,0],[0,3,0,0,0,0,0,3,3,3,0],[3,3,3,3,0,0,0,3,3,0,0],[0,0,0,3,3,3,0,3,3,0,0],[3,3,3,3,0,0,3,3,3,0,0],[0,3,0,0,0,0,0,0,0,0,0],[0,3,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,3,3,0,0,0,0,0],[0,0,0,0,0,0,0,3,3,3,3,3,0,0],[0,0,0,0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,3,3,3,0,3,0,3,3,3,0],... | [{"input":[[7,7,7,0,0,0,0,7,0,0],[0,7,0,0,7,0,7,7,0,0],[0,0,0,7,7,7,0,7,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,7,7,0],[7,0,0,0,7,7,0,7,0,0],[7,7,7,0,7,7,0,0,0,0],[7,7,7,0,7,0,0,7,7,7],[0,7,7,0,0,0,0,0,7,7],[0,0,0,0,0,0,0,0,7,7],[0,0,7,0,0,0,0,0,0,7],[0,7,7,7,0,0,0,0,0,0],[0,7,7,0,0,0,0,0,0,0],[0,0,7,7,0,0,0,0,0,0]],... | """Generator for Test2/t25: keep prototype-composable shapes, delete others.
Interpretation:
- Grid contains one foreground color split into multiple 4-connected shapes.
- Prototype candidates are present shapes that:
(a) cannot be composed from multiple non-overlapping copies of any other
present shape (under... | """Verifier for Test2/t25 prototype composition filter rule."""
from __future__ import annotations
from typing import List
from generator import transform_t25
Grid = List[List[int]]
def verify_t25(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = le... |
t26 | symmetry_gap_fill | The input shows a hollow coloured outline together with one or two cyan lines. Each cyan line is an axis of symmetry, running vertically, horizontally, or along either diagonal. Reflecting a position across those axes gives a set of matching positions. Fill any empty position whose matching set already holds a coloured... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,4,9,0,4,4,9,9,4,0,0],[0,0,9,0,0,0,0,0,0,9,0,0],[0,0,0,0,8,0,0,0,0,9,0,0],[0,0,4,0,0,8,0,0,0,4,0,0],[0,0,4,0,0,0,8,0,0,4,0,0],[0,0,9,0,0,0,0,8,0,9,0,0],[0,0,9,0,0,0,0,0,0,9,0,0],[0,0,0,9,9,4,0,0,9,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0],[0,0,7,7,0,0,0,7,7,1,0],[0,7,0,0,0,0,0,0,0,0,0],[0,7,0,8,0,8,0,0,0,7,0],[0,7,0,0,8,8,0,0,0,7,0],[0,0,0,0,0,8,0,0,0,0,0],[0,7,0,0,0,8,8,0,0,7,0],[0,0,0,0,0,8,0,8,0,7,0],[0,7,0,0,0,0,0,0,0,7,0],[0,0,0,7,7,0,0,7,7,0,0],[0,0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0,0],[0,1,7,7,7,0,7,7,7,1,0],[0,7,0,0,0,0,0,0,0,7,0],[0,7,0,8,0,8,0,0,0,7,0],[0,7,0,0,8,8,0,0,0,7,0],[0,0,0,0,0,8,0,0,0,0,0],[0,7,0,0,0,8,8,0,0,7,0],[0,7,0,0,0,8,0,8,0,7,0],[0,7,0,0,0,0,0,0,0,7,0],[0,1,7,7,7,0,7,7,7,1,0],[0,0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,5,3,9,0,9,0,5,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0,0,0,0,0,5,0,0],[0,0,3,0,0,0,8,0,8,0,0,0,0,0,3,0,0],[0,0,9,0,0,0,0,8,8,0,0,0,0,0,9,0,0],[0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,2,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,2,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,0,0,0,0,0,0,0,0,0,2,0,0],[0,0,7,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,2,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,0,0,0,8,8,8,8,8,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,7,0,0,0,0,0,0,0,... | """Generator for Test2/t26: fill symmetry-supported gaps in a colored outline.
Rule:
- The input shows a colored hollow outline plus one or two central cyan lines.
- Each cyan line is a line of symmetry (vertical, horizontal, main diagonal, or
anti-diagonal).
- In the output, any gap position is filled if some other... | """Verifier for Test2/t26 symmetry-gap-fill task."""
from __future__ import annotations
from typing import List
from generator import transform_t26
Grid = List[List[int]]
def verify_t26(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('input grid must be non-empty')
w = len(inp[0])
... |
t27 | square_anchors | Several shapes lie on the grid, all of different shape. They divide into groups such that the shapes within a group can be fitted together, by translation, into a solid rectangle. For each group, take each of its shapes in turn as an anchor and lay the assembled rectangle down so that the anchor covers the cells it alr... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,4,4,0,0,0],[0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,1,1,0,0,0,0,3,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0],[0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0],[0,0,0,0,0,0,0,0,5,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,7,7,0,0,0,0,0],[0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,8,8,8,8,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,3,3,8,2,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,7,8,8,2,0,0],[0,0,0,0,0,0,0,2,5,5,7,7,0,0,0,0,0,0,3,7,5,2,2,0,0],[0,0,0,0,0,0,0,2,2,5,7,3,0,0,0,0,0,0,7,7,5,5,2,0,0],[0,0,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,5,0,0,0,0,2,2,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0],[0,0,5,5,0,0,0,0,2,2,0,0,0,0,0,0,7,7,7,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,5,0,0,0,0,2,2,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,0,0,0,0,2,2,0,0,0,0,0,0,7,7,7,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,... | """Diverse generator for t27_square_anchors.
Generated inputs contain several colored anchor shapes. The shapes can be
partitioned into one or two square arrangements. Within each arrangement, the
member shapes tile a filled 3x3, 4x4, or 5x5 square when rotations are allowed
(up to five pieces on a 5x5).
For each memb... | """Verifier for t27: square completion around each anchor shape.
Valid inputs contain several monochrome objects, identified by color. The
objects can be partitioned into one or two groups. Within each group (at most five
shapes), those shapes can be rotated and packed to form one filled k x k square. For every
mem... |
t28 | breakout_bounce_stop | The input contains several obstacles, a single coloured cell near the bottom, and a two-cell grey pointer extending from it diagonally. The pointer gives that cell's starting direction. The cell moves one step at a time along the diagonal, bouncing off the grid walls at forty-five degrees. It stops when the next step a... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0],[0,0,0,0,0,0,0,3,3,3,0],[0,0,0,0,0,0,0,3,3,3,0],[0,0,0,3,0,0,0,0,0,0,0],[0,0,3,3,3,0,0,0,0,0,0],[0,3,3,3,3,3,0,0,0,0,0],[0,3,3,3,3,3,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,3,3,3,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,0,0,0,0,0,0,0,0,0,0,7,0],[0,7,7,7,0,0,0,0,0,0,0,0,7,7,7],[0,0,7,0,0,0,0,7,0,0,0,0,0,7,0],[0,0,0,0,0,0,7,7,7,0,0,0,0,0,0],[0,0,0,0,0,0,0,7,0,0,0,7,0,0,0],[0,0,0,0,0,0,0,0,0,0,7,7,7,0,0],[0,7,0,0,0,5,0,0,0,0,0,7,0,0,0],[7,7,7,0,0,0,5,0,0,0,0,0,0,0,0],[0,7,0,0,0,0,0,4,0,0,0,0,0,0,0]... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,0,0,0,0,0,0,0,0,0,0,7,0],[0,7,7,7,0,0,0,0,0,0,0,0,7,7,7],[0,0,7,0,0,4,0,7,0,0,0,0,0,7,0],[0,0,0,0,0,0,7,7,7,0,0,0,0,0,0],[0,0,0,0,0,0,0,7,0,0,0,7,0,0,0],[0,0,0,0,0,0,0,0,0,0,7,7,7,0,0],[0,7,0,0,0,0,0,0,0,0,0,7,0,0,0],[7,7,7,0,0,0,0,0,0,0,0,0,0,0,0],[0,7,0,0,0,0,0,0,0,0,0,0,0,0,0]... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,9,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,9,9,0,0,0,0,0,0,0,0,0,0,0,0],[0,9,0,0,0,9,9,9,0,0,0,0,0,0,0],[9,9,0,0,0,0,0,0,0,0,9,9,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,9,9,0,0,0,0,9,0,0,0,0,0,0],[0,0,9,9,0,0,0,0,9,9,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0... | [{"input":[[0,0,0,9,9,9,0,0,9,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,9,9,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,9,9,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,9,9,9,9,0,0,0,0,0,0,0,0,0,0,0],[0,0,9,9,9,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,9,... | """Generator for t28: breakout-style diagonal bouncing stop.
Task rule:
- The input contains several obstacle cells/shapes, a single colored moving cell near
the bottom, and a 2-cell grey diagonal pointer extending from that cell.
- The pointer indicates the moving cell's initial diagonal direction.
- Imagine the ce... | """Verifier for t28 breakout-style bounce-stop task."""
from __future__ import annotations
from typing import List
from generator import transform_t28
Grid = List[List[int]]
def verify_t28(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('Input grid must be non-empty')
w = len(inp[0]... |
t29 | color_directed_v_motion | Each connected block of a single colour slides diagonally in a direction fixed by that colour: magenta up and right, green up and left, yellow down and left, cyan down and right. Every block travels as far as it can, stopping when one more step would push any part of it off the grid. Blocks are never rotated or reshape... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,3,3,0,0,0,0,6,6,0,0,0,0],[0,0,0,0,3,0,0,0,0,0,0,6,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,6,4,0,0,0,0,0,0,0],[0,0,0,0,6,6,4,4,0,0,0,0,0,0],[0,0,0,0,8,8,3,3,0,0,0,0,0,0],[0,0,0,0,0,8,3,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,6,0,0],[0,0,0,0,0,0,0,0,0,0,6,6,0,0],[3,3,0,0,0,0,0,0,0,0,0,0,0,0],[3,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,6,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0],[0,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,6,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0],[0,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,... | """Generator for t29: color-directed diagonal motion of V/L-shaped objects.
Rule:
- Each connected monochrome object moves rigidly in a direction determined only by
its color:
6 (magenta): up-right (-1, +1)
3 (green): up-left (-1, -1)
4 (yellow): down-left (+1, -1)
8 (cyan): down-right... | """Verifier for t29: color-directed diagonal motion of objects."""
from __future__ import annotations
from typing import List
from generator import transform_t29
Grid = List[List[int]]
def verify_t29(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('Input grid must be non-empty')
w =... |
t30 | missing_progression_frames | The grid is a vertical stack of equal-sized frames, and some of the frames are blank. The filled frames show a step-by-step progression — a shape growing, a ring expanding outward, a line sweeping across, a border travelling round, or a figure translating. Work out which progression the filled frames follow and continu... | human_reviewed | [{"input":[[0,0,0,0,0],[0,0,0,0,0],[0,0,4,0,0],[0,0,0,0,0],[0,0,0,0,0],[6,6,6,6,6],[0,0,0,0,0],[0,0,4,0,0],[0,4,0,4,0],[0,0,4,0,0],[0,0,0,0,0],[6,6,6,6,6],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[6,6,6,6,6],[0,4,0,4,0],[4,0,0,0,4],[0,0,0,0,0],[4,0,0,0,4],[0,4,0,4,0]],"output":[[0,0,0,0,0],[0,0,0,0,0... | [[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,8,0,0,0,8,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,8,0,0,0,8,0],[8,0,0,0,0,0,8]] | [[0,0,0,8,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,8,0,0,0,8,0],[0,0,0,0,0,0,0],[6,6,6,6,6,6,6],[0,0,0,8,0,0,0],[0,0,8,0,8,0,0],[0,8,0,0,0,8,0],[8,0,0,0,0,0,8]] | {"train":[{"input":[[0,0,0,0,0,9,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[6,6,6,6,6,6,6,6,6,6,6],[0,0,0,0,0,9,0,0,0,0,0],[0,0,0,0,9,0,9,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[1,0,0,0,0,0],[6,6,6,6,6,6],[0,0,0,0,0,0],[1,1,0,0,0,0],[1,0,0,0,0,0],[1,0,0,0,0,0],[6,6,6,6,6,6],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[6,6,6,6,6,6],[0,1,1,1,1,0],[1,1,0,0,1,1],[1,0,0,0,0,0],[1,0,0,0,0,0]],"output":[[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0... | """Generator for t30_missing_progression_frames.
Creates vertical frame sequences with blank missing frames. The output fills
those frames by continuing a simple visual progression.
"""
from __future__ import annotations
import random
from typing import Dict, Iterable, List, Sequence, Set, Tuple
from verifier impor... | """Verifier for t30: fill missing frames in a simple progression.
The grid is a vertical strip of equal-size frames separated by a full row of 6s.
Blank frames are missing. Supported progression families are deliberately
simple and natural: expanding diamond rings, growing V outlines, constant-speed
border motion, cum... |
t31 | mirror_blocks_no_collision | A full-height green line divides the grid into equal left and right halves. Every other object is a solid two-by-two block. Each block has a destination in the opposite half, on the same rows and at the same position within that half — a block sitting three columns from the left edge of its own half moves to three colu... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,3,0,0,0,0,0,0,0],[0,4,4,0,0,0,0,3,0,0,0,0,0,0,0],[0,4,4,0,0,0,0,3,0,0,0,0,0,0,0],[0,0,0,8,8,0,0,3,0,0,0,4,4,0,0],[0,0,0,8,8,0,0,3,0,0,0,4,4,0,0],[0,0,0,0,0,0,0,3,0,0,0,0,0,0,0],[0,0,7,7,0,0,0,3,0,0,0,0,0,0,0],[0,0,7,7,0,0,0,3,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,3,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0... | [[0,0,2,2,0,0,0,3,0,0,0,0,0,7,7],[0,0,2,2,0,0,0,3,0,0,0,0,0,7,7],[0,8,8,0,0,0,0,3,0,0,0,0,0,0,0],[0,8,8,4,4,0,0,3,0,0,0,0,0,0,0],[0,0,0,4,4,0,0,3,0,0,0,9,9,0,0],[0,0,0,0,0,0,0,3,0,0,0,9,9,0,0],[0,0,0,0,0,0,0,3,9,9,0,0,0,0,0],[0,0,0,0,0,0,0,3,9,9,0,0,0,0,0]] | [[0,0,0,0,0,7,7,3,0,0,2,2,0,0,0],[0,0,0,0,0,7,7,3,0,0,2,2,0,0,0],[0,0,0,0,0,0,0,3,0,8,8,0,0,0,0],[0,0,0,4,4,0,0,3,0,8,8,0,0,0,0],[0,0,0,4,4,0,0,3,0,0,0,9,9,0,0],[0,0,0,0,0,0,0,3,0,0,0,9,9,0,0],[9,9,0,0,0,0,0,3,0,0,0,0,0,0,0],[9,9,0,0,0,0,0,3,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0],[0,0,0,0,5,5,0,0,3,0,0,0,0,7,7,0,0],[0,0,0,0,5,5,0,0,3,0,8,8,0,7,7,0,0],[0,0,0,0,0,0,0,0,3,0,8,8,0,0,0,0,0],[2,2,0,0,2,2,0,0,3,0,0,0,0,0,0,0,0],[2,2,0,0,2,2,0,0,3,0,0,6,6,0,0,0,0],[0,0,0,0,0,0,0,0,3,0,0,6,6,0,0,0,0],[9,9,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0],[9,9,0,0,0,0... | [{"input":[[0,7,7,0,0,3,0,2,2,0,0],[0,7,7,0,0,3,0,2,2,0,0],[0,0,0,0,0,3,0,0,0,0,0],[0,0,8,8,0,3,0,0,9,9,0],[0,0,8,8,0,3,0,0,9,9,0],[0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,0,3,0,0,0,0,0],[1,1,0,0,0,3,0,0,0,6,6],[1,1,0,0,0,3,0,0,0,6,6],[0,0,0,0,0,3,0,0,0,0,0],[0,0,0,0,0,3,0,0,0,0,0]],"output":[[0,7,7,0,0,3,0,2,2,0,0],[0,7,7,0,0... | """Generator for t31: mirror 2x2 blocks across a green divider unless blocked.
Rule:
- The grid is split into equal left/right halves by a full-height green vertical
line.
- Each non-green object is a solid 2x2 block.
- Each block has a corresponding 2x2 target position on the opposite half at the
same row and sam... | """Verifier for t31 mirror-block transfer task."""
from __future__ import annotations
from typing import List
from generator import transform_t31
Grid = List[List[int]]
def verify_t31(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('input grid must be non-empty')
w = len(inp[0])
... |
t32 | bidirectional_color_mapping | A full grey row divides the grid. Above it, each row is a colour pairing: a run of one colour on the left and a run of another on the right, and those two colours correspond. The pairing works in both directions.
Below the grey row the area is split into two halves by a black column down the middle. Coloured blocks sit... | human_reviewed | [{"input":[[3,3,3,0,8,8,8],[3,3,3,0,8,8,8],[2,2,2,0,4,4,4],[2,2,2,0,4,4,4],[1,1,1,0,3,3,3],[1,1,1,0,3,3,3],[7,7,7,0,9,9,9],[7,7,7,0,9,9,9],[5,5,5,5,5,5,5],[2,2,2,0,0,0,0],[1,1,1,0,0,0,0],[1,1,1,0,0,0,0],[1,1,1,0,0,0,0],[3,3,3,0,0,0,0],[7,7,7,0,0,0,0],[7,7,7,0,0,0,0],[2,2,2,0,0,0,0],[2,2,2,0,0,0,0],[7,7,7,0,0,0,0],[3,3,... | [[3,3,0,2,2],[6,6,0,8,8],[1,1,0,9,9],[4,4,0,3,3],[9,9,0,1,1],[2,2,0,6,6],[7,7,0,7,7],[8,8,0,4,4],[5,5,5,5,5],[0,0,0,8,8],[3,3,0,0,0],[0,0,0,7,7],[0,0,0,7,7],[0,0,0,6,6],[0,0,0,6,6],[0,0,0,8,8],[9,9,0,0,0],[9,9,0,0,0],[1,1,0,0,0],[0,0,0,2,2],[4,4,0,0,0]] | [[3,3,0,2,2],[6,6,0,8,8],[1,1,0,9,9],[4,4,0,3,3],[9,9,0,1,1],[2,2,0,6,6],[7,7,0,7,7],[8,8,0,4,4],[5,5,5,5,5],[6,6,0,8,8],[3,3,0,2,2],[7,7,0,7,7],[7,7,0,7,7],[2,2,0,6,6],[2,2,0,6,6],[6,6,0,8,8],[9,9,0,1,1],[9,9,0,1,1],[1,1,0,9,9],[3,3,0,2,2],[4,4,0,3,3]] | {"train":[{"input":[[1,1,1,0,7,7,7],[3,3,3,0,6,6,6],[6,6,6,0,2,2,2],[4,4,4,0,8,8,8],[7,7,7,0,9,9,9],[2,2,2,0,4,4,4],[8,8,8,0,1,1,1],[5,5,5,5,5,5,5],[3,3,3,0,0,0,0],[3,3,3,0,0,0,0],[3,3,3,0,0,0,0],[4,4,4,0,0,0,0],[4,4,4,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,4,4,4],[0,0,0,0,4,4,4],[7,7,7,0,0,0,0],[7,7,7,0,0,0,0],[7,7,7,0,0,0... | [{"input":[[6,6,0,8,8],[1,1,0,3,3],[7,7,0,4,4],[2,2,0,9,9],[5,5,5,5,5],[0,0,0,4,4],[1,1,0,0,0],[0,0,0,0,0],[2,2,0,0,0],[1,1,0,0,0],[1,1,0,0,0],[1,1,0,0,0]],"output":[[6,6,0,8,8],[1,1,0,3,3],[7,7,0,4,4],[2,2,0,9,9],[5,5,5,5,5],[6,6,0,8,8],[1,1,0,3,3],[7,7,0,4,4],[7,7,0,4,4],[2,2,0,9,9],[2,2,0,9,9],[2,2,0,9,9]]},{"input"... | """Generator for t32: bidirectional color mapping across a horizontal separator.
Rule:
- The grid is divided into a top and bottom section by a full grey row.
- Above the grey row, each row encodes a color correspondence: the uniform color on
the left half maps to the uniform color on the right half. The mapping is ... | """Verifier for t32: bidirectional color mapping across a horizontal separator."""
from __future__ import annotations
from typing import List
from generator import transform_t32
Grid = List[List[int]]
def verify_t32(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('Input grid must be non... |
t33 | odd_one_out_rectangle | Several coloured pieces lie on the grid. Removing exactly one of them leaves a set that fits together into a solid rectangle; that removed piece is the odd one out. Output only the odd piece, cropped to its own bounding box. | human_annotated | [{"input":[[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,3,3,0,7,7,0,0],[0,0,0,3,0,0,0,7,7,0,0],[0,0,3,3,0,0,0,7,0,0,0],[0,0,0,3,0,0,0,7,0,0,0],[0,0,0,0,0,0,0,7,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[8,8,8,0,0,0,6,0,5,5,5],[8,0,0,0,6,6,6,0,0,5,0],[8,8,8,0,0,0,0,0,0,0,0],[0,0,0,0,1,0,1,0,1,0,0],[0,0,0,0,1,1,1,1,1,0,0]],"output":[[8,8,8],[8... | [[0,0,0,0,0,0,0,0,0,0],[0,0,4,4,4,0,0,5,5,0],[0,0,0,0,4,0,0,5,5,0],[0,0,0,0,0,0,0,0,5,0],[0,0,0,0,0,0,0,0,0,0],[0,7,7,0,0,0,0,0,0,0],[0,7,0,0,0,0,1,1,0,0],[0,7,0,0,0,1,1,1,0,0],[0,7,7,7,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]] | [[5,5],[5,5],[0,5]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,9,0,0,4,4,4,0,0,0,0,0,0],[9,9,9,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,3,3,3,3,3,0,0,0,0],[0,0,0,0,0,3,3,3,3,3,0,0,0,0],... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,9,0,0,4,4,4,0,0,0,0,0,0],[9,9,9,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,3,3,3,3,3,0,0,0,0],[0,0,0,0,0,3,3,3,3,3,0,0,0,0],[0,0,0,0,... | """Generator for t33: odd one out rectangle."""
from __future__ import annotations
import json
import random
from pathlib import Path
from typing import Dict, Iterable, List, Sequence, Set, Tuple
from verifier import _extract_objects, _normalize, _odd_candidates, verify_t33
Grid = List[List[int]]
Cell = Tuple[int, ... | """Verifier for t33: odd one out rectangle.
The input contains several colored objects. Exactly one object is the odd one
out. If that object is removed, the remaining objects can be translated (without
rotation) to tile one filled rectangle. The output is the odd object alone,
cropped to its bounding box and preservi... |
t34 | rotated_occlusion_recovery | The input contains a cyan square occluder with exactly one red cell at one of its corners. The output is the pattern hidden beneath that square, rotated so that the red corner would end up at the top-left: no rotation if the red corner is already top-left, a quarter turn anticlockwise if it is top-right, a quarter turn... | human_reviewed | [{"input":[[9,0,0,7,0,0,3,0,0,4,0,0],[0,9,0,0,7,0,0,3,0,0,4,0],[0,0,9,0,0,7,0,0,3,0,0,4],[1,0,0,9,0,0,7,0,0,3,0,0],[0,1,0,0,9,0,0,7,0,0,3,0],[0,0,1,0,0,8,8,8,8,2,0,3],[5,0,0,1,0,8,8,8,8,8,0,0],[0,5,0,0,1,8,8,8,8,8,7,0],[0,0,5,0,0,8,8,8,8,8,0,7],[6,0,0,5,0,8,8,8,8,8,0,0],[0,6,0,0,5,0,0,1,0,0,9,0],[0,0,6,0,0,5,0,0,1,0,0,... | [[1,1,1,1,1,1,1,1,1,1,1],[1,9,9,9,9,9,9,9,9,9,1],[1,9,3,3,3,3,3,3,3,9,1],[1,9,3,6,6,6,6,6,3,9,1],[1,9,3,6,4,4,4,6,3,9,1],[1,9,3,6,4,5,4,6,3,9,1],[1,9,3,6,4,4,8,8,8,8,1],[1,9,3,6,6,6,8,8,8,8,1],[1,9,3,3,3,3,8,8,8,8,1],[1,9,9,9,9,9,8,8,8,2,1],[1,1,1,1,1,1,1,1,1,1,1]] | [[9,9,9,9],[9,3,3,3],[9,3,6,6],[9,3,6,4]] | {"train":[{"input":[[4,4,4,4,4,4,4,4,4],[4,7,7,7,7,7,7,7,4],[4,7,5,5,5,5,5,7,4],[4,7,5,6,6,6,5,7,4],[4,7,5,6,4,6,5,7,4],[4,7,5,6,4,6,5,7,4],[4,8,8,8,8,8,2,7,4],[4,8,8,8,8,8,8,7,4],[4,8,8,8,8,8,8,7,4],[4,8,8,8,8,8,8,7,4],[4,8,8,8,8,8,8,7,4],[4,8,8,8,8,8,8,7,4],[4,7,5,5,5,5,5,7,4],[4,7,7,7,7,7,7,7,4],[4,4,4,4,4,4,4,4,4]]... | [{"input":[[7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7],[7,5,5,5,5,5,5,5,5,5,5,5,5,5,5,7],[7,5,7,7,7,8,8,8,8,2,7,7,7,7,5,7],[7,5,7,6,6,8,8,8,8,8,6,6,6,7,5,7],[7,5,7,6,4,8,8,8,8,8,4,4,6,7,5,7],[7,5,7,6,6,8,8,8,8,8,6,6,6,7,5,7],[7,5,7,7,7,8,8,8,8,8,7,7,7,7,5,7],[7,5,5,5,5,5,5,5,5,5,5,5,5,5,5,7],[7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7]],"o... | """Generator for t34: recover an occluded pattern, then rotate by the red-corner cue.
Task rule:
- The input contains a cyan square occluder with exactly one red cell at one corner.
- The output is the pattern hidden beneath the square, rotated so that the red corner
would move to the top-left of the square.
* red... | """Verifier for t34: recover the occluded patch and rotate by the red-corner cue."""
from __future__ import annotations
from typing import List
from generator import transform_t34
Grid = List[List[int]]
def verify_t34(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('Input grid must be n... |
t35 | repair_frame_order | The input is a horizontal row of equally sized frames separated by vertical cyan lines, shown out of order. In the correct order the content drifts steadily across the sequence: frames are ordered by the natural movement progression, and where that ties, by how many cells are filled. The output shows the same frames re... | human_reviewed | [{"input":[[0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,4],[0,0,0,0,0,8,0,0,0,4,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0],[0,0,0,0,0,8,0,0,0,0,0,8,0,0,4,0,0,8,0,0,0,0,0,8,0,0,0,0,0],[0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,4,0,0,0,8,0,0,0,0,0],[4,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0,8,0,0,0,0,0]],"output"... | [[0,0,0,0,8,0,0,0,0,8,6,0,0,0,8,0,0,0,0,8,6,6,0,0],[0,0,0,0,8,6,0,0,0,8,6,6,0,0,8,0,0,0,0,8,6,6,6,0],[0,0,0,0,8,6,6,0,0,8,6,6,6,0,8,6,0,0,0,8,6,6,6,6],[6,0,0,0,8,6,6,6,0,8,6,6,6,6,8,6,6,0,0,8,6,6,6,6]] | [[0,0,0,0,8,0,0,0,0,8,0,0,0,0,8,6,0,0,0,8,6,6,0,0],[0,0,0,0,8,0,0,0,0,8,6,0,0,0,8,6,6,0,0,8,6,6,6,0],[0,0,0,0,8,6,0,0,0,8,6,6,0,0,8,6,6,6,0,8,6,6,6,6],[6,0,0,0,8,6,6,0,0,8,6,6,6,0,8,6,6,6,6,8,6,6,6,6]] | {"train":[{"input":[[0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,1,1,1,1,1,1,1],[0,0,0,0,0,0,0,8,0,1,1,1,1,1,0,8,0,0,0,0,0,0,0,8,1,1,1,1,1,1,1],[0,0,0,0,0,0,0,8,0,1,1,1,1,1,0,8,0,0,1,1,1,0,0,8,1,1,1,1,1,1,1],[0,0,0,1,0,0,0,8,0,1,1,1,1,1,0,8,0,0,1,1,1,0,0,8,1,1,1,1,1,1,1],[0,0,0,0,0,0,0,8,0,1,1,1,1,1,0,8,0,0,1,1,1,0... | [{"input":[[0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,6,6,6,6,6,6,6],[0,0,0,0,0,0,0,8,0,6,6,6,6,6,0,8,0,0,0,0,0,0,0,8,6,6,6,6,6,6,6],[0,0,0,0,0,0,0,8,0,6,6,6,6,6,0,8,0,0,6,6,6,0,0,8,6,6,6,6,6,6,6],[0,0,0,6,0,0,0,8,0,6,6,6,6,6,0,8,0,0,6,6,6,0,0,8,6,6,6,6,6,6,6],[0,0,0,0,0,0,0,8,0,6,6,6,6,6,0,8,0,0,6,6,6,0,0,8,6,6,... | """Generator for Test2/t35: repair the order of frame sequence.
Rule:
- The input shows a horizontal sequence of same-sized "image" frames separated
by vertical cyan lines.
- In the correct order, the frames show a natural visual progression.
- The output reorders the frames into that progression.
Generation constr... | """Verifier for Test2/t35 repair-frame-order task."""
from __future__ import annotations
from typing import List
from generator import transform_t35
Grid = List[List[int]]
def verify_t35(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t36 | follow_gps | The top row carries the directions: a yellow start marker, then alternating pairs of a place colour and a turn colour, ending with a cyan destination marker. Below sits a lattice of grey three-by-three tiles separated by blank rows and columns, each tile holding a coloured centre. Begin at the yellow centre and move to... | human_reviewed | [{"input":[[4,0,0,6,1,0,0,9,2,0,0,1,2,0,0,3,1,0,0,8,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,1,5,0,5,9,5,0,5,3,5,0,5,1,5,0,5,2,5,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[... | [[4,0,0,3,3,0,0,7,1,0,0,9,2,0,0,6,3,0,0,8,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,4,5,0,5,9,5,0,5,6,5,0,5,1,5,0,5,3,5,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,3,5,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,4,5,0,5,9,5,0,5,6,5,0,5,1,5,0,5,3,5,0],[0,5,4,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,4,5,0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,4,4,4,... | {"train":[{"input":[[4,0,0,1,2,0,0,9,3,0,0,1,1,0,0,8,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,6,5,0,5,4,5,0,5,7,5,0,5,2,5,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,9,5,0,5,1,5,0,5,3,5,0,5,2,5,0],[0,5,5,5,0,5... | [{"input":[[4,0,0,1,2,0,0,9,3,0,0,1,1,0,0,8,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,6,5,0,5,4,5,0,5,7,5,0,5,2,5,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,0,5,5,5,0,5,5,5,0,5,5,5,0],[0,5,9,5,0,5,1,5,0,5,3,5,0,5,2,5,0],[0,5,5,5,0,5,5,5,0,5,... | """Generator for Test2/t36: follow the GPS-like relative-turn instructions.
Rule:
- The top row contains a yellow start token, then a sequence of (location color,
turn color) pairs, then a cyan end token.
- The lower part of the grid is a lattice of gray 3x3 node-tiles separated by
blank spacer rows/cols. Each nod... | """Verifier for Test2/t36 follow-GPS task."""
from __future__ import annotations
from typing import List
from generator import transform_t36
Grid = List[List[int]]
def verify_t36(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('input grid must be non-empty')
w = len(inp[0])
if a... |
t37 | row_shift_highlight | The input contains one large single-colour shape, clear of the top row and the left column. Cells in the left column mark rows: red means shift that row's shape cells one step right, green means one step left. Cells in the top row mark colours for columns. In each marked row, every shape cell moves one step in the mark... | human_reviewed | [{"input":[[0,0,0,0,0,1,0,0,8,9,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,4,0,0,0,0,0,0,0],[2,0,0,0,0,0,4,4,4,0,0,0,0,0,0],[0,0,0,0,0,4,4,4,4,4,0,0,0,0,0],[3,0,0,0,4,4,4,4,4,4,4,0,0,0,0],[3,0,0,4,4,4,4,4,4,4,4,4,0,0,0],[0,0,0,0,4,4,4,4,4,4,4,0,0,0,0],[2,0,0,0,0,4,4,4,4,4,0,0,0,0,0],[3,0,0,0,0,0,4,4,4,0,... | [[0,0,0,0,0,1,0,3,0,0,6,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,0,0,0,7,7,7,7,7,7,7,0,0,0],[0,0,0,0,7,0,0,0,0,0,7,0,0,0],[0,0,0,0,7,0,0,7,0,0,7,0,0,0],[2,0,0,0,7,0,0,7,0,0,7,0,0,0],[2,0,0,0,7,0,0,7,0,0,7,0,0,0],[3,0,0,0,7,0,0,7,0,0,7,0,0,0],[3,0,0,0,7,0,0,7,0,0,7,0,0,0],[0,0,0,0,7,0,0,7,0,0,7,0,0,0],[0,0,0,0,7,0,0,7,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,7,1,7,3,7,7,6,0,0,0,0],[0,0,0,0,7,0,0,0,0,0,7,0,0,0],[0,0,0,0,7,0,0,7,0,0,7,0,0,0],[0,0,0,0,0,7,0,0,3,0,0,6,0,0],[0,0,0,0,0,7,0,0,3,0,0,6,0,0],[0,0,0,7,0,0,3,0,0,6,0,0,0,0],[0,0,0,7,0,0,3,0,0,6,0,0,0,0],[0,0,0,0,7,0,0,7,0,0,7,0,0,0],[0,0,0,0,7,0,0,7,0,... | {"train":[{"input":[[0,0,0,0,0,0,9,0,0,0,0,5,0,6,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,0,0,0,0,0,7,7,7,7,7,7,7,0,0,0,0],[2,0,0,0,0,7,7,7,7,7,7,7,7,7,0,0,0],[0,0,0,0,0,7,7,7,7,7,7,7,7,7,0,0,0],[0,0,0,0,0,7... | [{"input":[[0,0,4,1,8,7,6,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[3,0,0,8,8,8,0,0,0,0,0,0],[3,0,0,8,8,8,0,0,0,0,0,0],[2,0,8,8,8,8,8,0,0,0,0,0],[3,0,0,8,8,8,0,0,0,0,0,0],[3,0,0,8,8,8,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,... | """Generator for Test2/t37: row-wise shift with top-row recoloring markers.
Rule:
- The input contains a large single-color shape away from the top row and left
column.
- Cells in the left column mark row shifts:
* red (2) means shift that row's shape cells right by 1,
* green (3) means shift that row's shap... | """Verifier for Test2/t37 row-shift highlight task."""
from __future__ import annotations
from typing import List
from generator import transform_t37
Grid = List[List[int]]
def verify_t37(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError('input grid must be non-empty')
w = len(inp[0])... |
t38 | inverse_fractal_template | The input is a self-similar fractal built from a small template. Starting from a single filled cell, each round replaces every filled cell with a copy of the whole template, so the grid grows by the template's height and width each time. Most filled cells share a base colour and a few carry a distinct highlight colour.... | human_reviewed | [{"input":[[2,0,0,0,0,0,0,0],[2,2,0,0,0,0,0,0],[8,0,2,0,0,0,0,0],[2,2,2,2,0,0,0,0],[2,0,0,0,2,0,0,0],[2,2,0,0,2,2,0,0],[2,0,8,0,2,0,2,0],[2,2,2,2,2,2,8,2]],"output":[[8,0],[8,2]]},{"input":[[3,3,0,3,3,0,0,0,0],[3,0,4,3,0,3,0,0,0],[3,3,3,3,3,3,0,0,0],[3,3,0,0,0,0,3,3,0],[3,0,3,0,0,0,4,0,3],[3,4,3,0,0,0,3,3,3],[3,3,0,3,3... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,6,6,9,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,6,0,0,6,0,0,6,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,6,6,6,6,6,6,6,6,6,0,0,0,0,0,0,0,0,0],[0,0,0,0,6,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,6,0,0,0,0],[0,0,0,6,6,6,0,0,0,0,0,0,6,9,6,0,0,0,0,... | [[0,6,0],[6,9,9]] | {"train":[{"input":[[9,0,0,0,0,0,0,0,0],[9,5,9,0,0,0,0,0,0],[0,0,9,0,0,0,0,0,0],[5,0,0,9,0,0,9,0,0],[9,9,9,9,9,9,9,9,9],[0,0,9,0,0,9,0,0,9],[0,0,0,0,0,0,9,0,0],[0,0,0,0,0,0,9,5,5],[0,0,0,0,0,0,0,0,9]],"output":[[5,0,0],[9,5,5],[0,0,9]]},{"input":[[3,0,0,0],[3,3,0,0],[3,0,9,0],[3,3,3,3]],"output":[[9,0],[3,3]]},{"input"... | [{"input":[[7,0,4,0,0,0,4,0,4],[0,4,0,0,0,0,0,7,0],[0,0,0,4,0,4,0,0,0],[0,0,0,0,4,0,0,0,0]],"output":[[7]]},{"input":[[8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0... | """Generator for Test2/t38: recover the atomic template from an inverse fractal.
Rule:
- The input is a self-similar fractal built from a small atomic template.
- The atomic template is a binary shape of size HxW.
- Starting from a single filled cell, each recursion replaces every filled cell
by a copy of the whole ... | """Verifier for Test2/t38 inverse fractal template extraction."""
from __future__ import annotations
from typing import List
from generator import transform_t38
Grid = List[List[int]]
def verify_t38(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = ... |
t39 | directed_island_path | The input contains several three-by-three hollow square islands, their borders sharing one colour. A red cell at the midpoint of an island's side is a one-way gate, allowing movement from that island to the neighbouring island in that direction. One island's centre holds a yellow cell, the source; another holds a cyan ... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,3,3,3,0,0,3,3,3,0,0,3,3,3,0,0,3,3,3,0,0],[0,0,3,4,2,0,0,3,0,2,0,0,3,0,2,0,0,3,0,3,0,0],[0,0,3,2,3,0,0,3,2,3,0,0,3,2,3,0,0,3,2,3,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,7,7,0,0,7,7,7,0,0,7,7,7,0,0,7,7,7,0,0],[0,0,7,0,7,0,0,2,0,7,0,0,2,0,7,0,0,2,0,7,0,0],[0,0,7,2,7,0,0,7,2,7,0,0,7,2,7,0,0,7,7,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,2,7,0,0,7,2,7,0,0,7,7,7,0,0,7,2,7,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,7,7,0,0,7,7,7,0,0,7,7,7,0,0,7,7,7,0,0],[0,0,7,0,7,0,0,2,0,7,0,0,2,0,7,0,0,5,0,7,0,0],[0,0,7,2,7,0,0,7,2,7,0,0,7,5,7,0,0,7,7,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,2,7,0,0,7,2,7,0,0,7,7,7,0,0,7,5,7,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,6,6,6,0,0,6,6,6,0,0,6,6,6,0,0,6,6,6,0,0,6,6,6,0,0],[0,0,6,0,2,0,0,2,0,2,0,0,6,0,2,0,0,2,0,2,0,0,2,0,6,0,0],[0,0,6,2,6,0,0,6,2,6,0,0,6,6,6,0,0,6,2,6,0,0,6,2,6,0,0],[0,0,0,0,0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,3,3,3,0,3,3,3,0,0],[0,0,3,0,2,0,2,8,3,0,0],[0,0,3,3,3,0,3,2,3,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,3,2,3,0,3,2,3,0,0],[0,0,3,0,3,0,2,0,3,0,0],[0,0,3,2,3,0,3,3,3,0,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,3,2,3,0,3,2,3,0,0],[0,0,3,0,3,0,3,4,3,0,0],[0,0,3,2,3,0,3,2,3,0,... | """Generator for Test2/t39: shortest directed path across cannon-islands.
Rule:
- The input contains several 3x3 hollow square "islands" laid out on a grid.
- The island borders use one outline color.
- A red cell (color 2) at the midpoint of one side of an island is a one-way
cannon, allowing movement from that isl... | """Verifier for Test2/t39 directed island shortest path."""
from __future__ import annotations
from typing import List
from generator import transform_t39
Grid = List[List[int]]
def verify_t39(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(in... |
t40 | remove_unsupported_blocks | The input contains several hollow rectangular blocks. Some are marked by having their whole interior filled with red. Every marked block is removed. Any remaining block then left unsupported is removed as well, and this repeats until nothing more falls. A block is supported if its bottom edge rests on the bottom row of... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,7,7,7,7,7,0],[0,1,1,1,1,0,7,0,0,0,0,7,0],[0,1,0,0,1,0,7,7,7,7,7,7,0],[0,1,1,1,1,0,0,3,3,3,0,0,0],[0,0,4,4,4,4,4,3,2,3,0,0,0],[0,0,4,0,0,0,4,3,2,3,0,0,0],[0,0,4,4,4,4,4,3,3,3,0,0,0],[0,0,0,0,8,8,8,8,8,0,0,0,0],[0,0,0,0,8,0,0,0,8,0,0,0,0],[0,0,0,0,8,0,0,0,8,0,0,0,0],[... | [[0,0,0,9,9,9,9,7,7,7,7,0,0,0,0],[0,0,0,9,0,0,9,7,2,2,7,0,0,0,0],[0,0,0,9,9,9,9,7,7,7,7,0,0,0,0],[0,0,0,0,0,0,1,1,1,1,1,0,0,0,0],[0,0,0,0,0,0,1,0,0,0,1,0,0,0,0],[0,0,0,0,0,0,1,1,1,1,1,0,0,0,0],[0,4,4,4,4,4,4,4,4,5,5,5,5,0,0],[0,4,0,0,0,0,0,0,4,5,0,0,5,0,0],[0,4,0,0,0,0,0,0,4,5,0,0,5,0,0],[0,4,4,4,4,4,4,4,4,5,0,0,5,0,0]... | [[0,0,0,9,9,9,9,0,0,0,0,0,0,0,0],[0,0,0,9,0,0,9,0,0,0,0,0,0,0,0],[0,0,0,9,9,9,9,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,1,1,1,1,0,0,0,0],[0,0,0,0,0,0,1,0,0,0,1,0,0,0,0],[0,0,0,0,0,0,1,1,1,1,1,0,0,0,0],[0,4,4,4,4,4,4,4,4,0,0,0,0,0,0],[0,4,0,0,0,0,0,0,4,0,0,0,0,0,0],[0,4,0,0,0,0,0,0,4,0,0,0,0,0,0],[0,4,4,4,4,4,4,4,4,0,0,0,0,0,0]... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,1,0,1,0,0,0,0,0,0],[0,0,0,0,0,0,1,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,4,4,4,0,0,0,0,0,0],[0,0,0,0,0,0,4,2,4,0,0,0,0,0,0],[0,0,0,0,0,0,4,2,4,0,0,0,0,0,0],[0,0,0,0,0,0,4,2,4,0,0,0,0,0,0],[0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,3,3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,... | """Generator for Test2/t40: remove red-marked hollow blocks and unsupported blocks.
Rule:
- The input contains several hollow rectangular blocks.
- Some blocks are marked red by filling the entire interior of the block with
red cells (color 2).
- In the output, every red-marked block is removed.
- Then any remaining... | """Verifier for Test2/t40 remove unsupported hollow blocks."""
from __future__ import annotations
from typing import List
from generator import transform_t40
Grid = List[List[int]]
def verify_t40(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len... |
t41 | refraction_surface | The input contains a dotted vertical grey line and a single coloured cell to its left. The cell travels horizontally right, passing through the line and continuing to the far-right edge on the same row. From the point where it crosses the line, a second copy sets off diagonally up and to the right until it reaches the ... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,9,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0],[0,0,0... | [{"input":[[0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0,0,0],[6,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,5,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0... | """Generator for Test2/t41: refraction through a dotted vertical surface.
Rule:
- The input contains a vertical dotted gray line (color 5) and a single colored
cell to its left.
- The colored cell is imagined to move horizontally right, passing through the
surface and ending at the far-right edge on the same row.
... | """Verifier for Test2/t41 refraction-through-surface rule."""
from __future__ import annotations
from typing import List
from generator import transform_t41
Grid = List[List[int]]
def verify_t41(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(... |
t42 | section_pattern_shift | The grid is split down the middle into a left and a right half. The left half is unchanged. Both halves are divided into the same stack of boxes, one above the other, each box using two colours. Every box on the right is adjusted to show the same pattern as the box beside it on the left. Only the two colours already pr... | human_reviewed | [{"input":[[3,6,6,6,7,8,8,8],[3,6,3,3,7,8,7,7],[3,3,3,6,7,8,7,8],[6,3,6,6,8,7,8,8],[7,7,7,7,4,4,4,4],[8,8,8,7,1,1,1,4],[7,7,8,8,4,4,4,1],[8,8,7,7,1,1,4,1],[4,1,4,4,3,6,3,3],[4,1,1,1,3,6,6,6],[4,4,1,4,3,3,6,3],[4,1,4,4,3,6,3,6]],"output":[[3,6,6,6,7,8,8,8],[3,6,3,3,7,8,7,7],[3,3,3,6,7,7,7,8],[6,3,6,6,8,7,8,8],[7,7,7,7,4... | [[9,9,1,1,7,7,3,7],[9,1,9,9,7,3,7,3],[9,1,9,1,7,3,7,3],[1,9,1,1,3,7,3,3],[1,9,9,9,3,7,7,7],[3,3,7,7,9,1,1,1],[7,3,7,3,1,9,1,9],[7,7,7,3,1,9,1,9],[3,7,3,7,9,1,9,1],[7,3,7,7,1,9,1,1]] | [[9,9,1,1,7,7,3,3],[9,1,9,9,7,3,7,7],[9,1,9,1,7,3,7,3],[1,9,1,1,3,7,3,3],[1,9,9,9,3,7,7,7],[3,3,7,7,9,9,1,1],[7,3,7,3,1,9,1,9],[7,7,7,3,1,1,1,9],[3,7,3,7,9,1,9,1],[7,3,7,7,1,9,1,1]] | {"train":[{"input":[[1,9,9,1,9,9,9,2,6,6,2,6,6,6],[9,1,9,9,9,1,1,6,2,6,6,6,2,2],[1,9,9,9,1,9,1,2,6,6,6,2,6,6],[6,6,2,6,2,6,6,8,8,3,8,3,8,8],[2,2,6,2,2,6,2,3,3,8,3,3,3,3],[6,2,6,6,2,2,2,8,3,8,8,8,3,3],[6,6,2,6,6,6,6,8,8,3,8,8,8,3],[6,6,6,6,2,6,2,8,8,8,8,3,8,3],[8,3,3,3,8,8,3,9,1,1,1,9,9,1],[3,8,8,8,8,8,8,1,9,9,9,9,9,1],... | [{"input":[[6,6,1,6,2,7,2,7],[1,6,1,6,2,7,2,7],[1,1,6,6,2,7,7,7],[1,6,6,6,2,7,7,7],[1,1,6,1,2,2,7,2],[7,2,2,2,8,9,9,9],[7,2,2,2,8,9,8,9],[7,2,7,7,8,9,8,8],[2,2,7,7,9,9,8,8],[8,9,8,8,3,4,3,3],[8,8,8,9,3,3,3,3],[9,9,8,8,4,4,3,3],[3,4,3,3,6,1,6,6],[4,3,3,4,1,6,6,1],[3,4,3,4,6,6,6,1],[4,3,3,3,1,6,6,6]],"output":[[6,6,1,6,2... | """Generator for Test2/t42: correct shifted color-scheme pattern copies across sections.
Rule:
- The grid is split into equal left/right halves.
- It is also split into several horizontal sections.
- In each section, the left half contains a two-color pattern.
- The right half should contain the *same pattern* but rec... | """Verifier for Test2/t42 shifted section-pattern correction."""
from __future__ import annotations
from typing import List
from generator import transform_t42
Grid = List[List[int]]
def verify_t42(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = l... |
t43 | reverse_occlusion_order | Several objects overlap, each hiding part of those behind it. Every object's full shape can be worked out from the parts that stay visible, and the front-to-back order is unambiguous. Rebuild each object complete, then redraw them all with that order reversed, so what was in front is now furthest back and what was most... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,6,6,6,6,0,0,0,0,0,0],[0,0,6,6,6,6,0,0,0,0,0,0],[0,0,6,6,3,3,3,3,3,3,0,0],[0,0,6,6,3,3,3,3,3,3,0,0],[0,0,6,6,3,3,3,3,3,3,0,0],[0,0,0,0,3,3,3,3,3,3,0,0],[0,0,0,0,3,3,3,3,3,3,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,8,8,8,8,8,8,8,8,8,8,8,8,0],[0,0,8,0,0,0,4,4,4,0,0,0,8,0,0],[0,0,8,0,4,4,0,0,0,4,4,8,0,0,0],[0,0,8,4,0,0,0,0,0,0,8,4,0,0,0],[0,0,8,4,0,0,0,0,0,8,0,4,0,0,0],[0,0,4,0,0,0,5,5,5,5,5,5,4,5,5],[0,0,4,0,0,0,5,8,0,0,0,0,4,0,5],[0,0,4,0,0,0,5,0,0,0,0,0,4,0,5],[0,0,8,4,0,8,5,0,0,0,0,4,0,0,5]... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,8,8,8,8,8,8,8,8,8,8,8,8,0],[0,0,8,0,0,0,4,4,4,0,0,0,8,0,0],[0,0,8,0,4,4,0,0,0,4,4,8,0,0,0],[0,0,8,4,0,0,0,0,0,0,8,4,0,0,0],[0,0,8,4,0,0,0,0,0,8,0,4,0,0,0],[0,0,8,0,0,0,5,5,8,5,5,5,5,5,5],[0,0,8,0,0,0,5,8,0,0,0,0,4,0,5],[0,0,8,0,0,0,8,0,0,0,0,0,4,0,5],[0,0,8,4,0,8,5,0,0,0,0,4,0,0,5]... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,5,5,5,5,5,5,5,5,0,0],[0,0,5,0,0,0,0,0,0,0,0,5,0,0],[0,0,5,0,0,0,0,0,0,0,0,5,0,0],[0,0,5,0,0,0,0,0,0,0,0,5,0,0],[0,0,5,0,0,0,7,7,7,7,7,5,0,0],[0,0,5,0,0,0,7,7,7,7,7,5,0,0],[0,0,5,5,5,5,7,7,7,7,7,5,0,0],[0,0,0,0,0,0,7,7,7,7,7,0,0,0],... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,6,6,6,6,6,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,6,9,9,9,9,9,9,9,0,0,0,1,0,0,0,0,0,0],[0,6,9,6,6,6,0,0,9,0,0,0,1,0,0,0,0,0,0],[0,6,9,6,6,6,0,7,9,7,7,7,1,7,0,0,0,0,0],[0,6,9,6,6,6,0,7,9,0,0,0,1,7,0,0,0,0,0],[0,0,9,0,0,0,0,7,9,0,0,0,1,7,... | """Generator for Test2/t43: reverse the front-to-back occlusion order of objects.
Rule:
- The input shows several recognizable objects stacked/occluding one another.
- Their front-to-back order is uniquely identifiable from the visible overlaps.
- Reconstruct each full object, then reverse the depth order: the previou... | """Verifier for Test2/t43 reverse occlusion order rule."""
from __future__ import annotations
from typing import List
from generator import transform_t43
Grid = List[List[int]]
def verify_t43(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp... |
t44 | gap_rotation_counts | A nest of concentric square outlines surrounds a single marked centre cell, and a second cell of that same marker colour sits on the grid edge, lined up with the centre either horizontally or vertically. The side of the nest that this edge marker faces is the target side. Every outline is missing exactly one cell, at t... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,7,7,7,7,7,7,7,7,7,7,7,7,7,0,0],[0,0,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,7,0,5,5,5,5,5,5,5,5,5,0,7,0,0],[0,0,7,0,5,0,0,0,0,0,0,0,5,0,7,0,0],[0,0,7,0,5,0,4,4,4,4,4,0,5,0,7,0,0],[0,0,7,0,5,0,4,0,0,0,4,0,5,0,7,0,0],[0,0,7,0,0,0,4,0,1,0,... | [[0,0,0,0,0,0,0,0,0,0,0],[0,1,1,1,1,1,1,1,1,1,0],[0,1,3,3,3,3,3,3,3,1,0],[0,1,3,6,6,6,6,6,3,1,0],[0,1,3,6,8,8,8,6,3,1,0],[0,0,3,0,8,7,8,6,0,1,0],[0,1,3,6,8,0,8,6,3,1,0],[0,1,3,6,6,6,6,6,3,1,0],[0,1,3,3,3,3,3,3,3,1,0],[0,1,1,1,1,1,1,1,1,1,0],[0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,7,0,0,0,0,0]] | [[0,0,0],[6,6,6],[3,0,0],[1,1,1]] | {"train":[{"input":[[0,0,0,0,0,0,0,7,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,2,2,2,2,2,2,2,2,2,2,2,2,2,0],[0,2,1,1,1,1,1,0,1,1,1,1,1,2,0],[0,2,1,4,4,4,4,4,4,4,4,4,1,2,0],[0,2,1,4,5,5,5,5,5,5,5,4,1,2,0],[0,2,1,4,5,6,6,6,6,6,5,4,1,2,0],[0,2,1,4,5,6,0,0,0,6,5,4,1,2,0],[0,0,1,4,0,6,0,7,0,0,5,4,1,2,0],[0,2,1,4,5,6... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0],[0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0],[0,0,0,0,1,0,4,4,4,4,4,4,4,4,0,4,4,4,4,4,4,4,4,0,1,0],[0,0,0,0,1,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,1,0],[0,0,0,0,1,0,4,0,2,2,2,2,2,2,2,2,2,2,2,... | """Generator for Test2/t44: count rotations needed to align outline gaps.
Rule:
- The input has two cells of one marker color: one at the center of a nest of
concentric square outlines, and one on the grid edge aligned horizontally or
vertically with the center.
- Each square outline has exactly one gap at the mid... | """Verifier for Test2/t44 gap-rotation-count rule."""
from __future__ import annotations
from typing import List
from generator import transform_t44
Grid = List[List[int]]
def verify_t44(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
... |
t45 | toggle_shadow_light | A yellow marker sits at a corner of the grid or at the midpoint of one edge, and the grid has a single background colour. Every cell that is neither background nor yellow casts a black shadow directly away from the marker — along rows and columns when the marker is on an edge, along diagonals when it is at a corner. Ye... | human_reviewed | [{"input":[[1,1,1,1,1,1,4,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,2,1,1,1,1,1,1,1,1],[1,1,1,2,1,1,1,1,1,1,1,1,1],[1,1,2,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,3,3,3,3,1,1],[1,1,1,1,1,1,1,3,1,1,3,1,1],[1,1,6,1,1,1,1,3,1,1,3,1,1],[1,6,1,6,1,1,1,3,3,3,3,1,1],[6,1,6,1,6,1,1,1,1,1,1,1,1],[... | [[4,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,7,9,9,9],[9,9,9,9,9,9,6,9,7,9,9],[9,9,9,9,9,7,9,4,9,7,9],[9,9,9,9,9,9,7,9,6,9,9],[9,9,9,9,9,9,9,7,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,1,9,9,9,9,9,9],[9,9,9,1,4,1,9,9,9,9,9],[9,9,8,8,9,8,8,9,9,9,9],[9,1,8,... | [[4,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,9,9,9,9],[9,9,9,9,9,9,9,7,9,9,9],[9,9,9,9,9,9,6,9,7,9,9],[9,9,9,9,9,7,9,4,9,7,9],[9,9,9,9,9,9,7,9,6,9,0],[9,9,9,9,9,9,9,7,9,0,9],[9,9,9,9,9,9,9,9,0,9,0],[9,9,9,9,9,9,9,9,9,0,9],[9,9,9,9,1,9,9,9,9,9,0],[9,9,9,1,4,1,9,9,9,9,9],[9,9,8,8,0,8,8,9,9,9,9],[9,1,8,... | {"train":[{"input":[[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,3,3,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,8,8,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,8,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,8,1,1,1,1,1,1,1,1,6,1,1,1,1,1,1... | [{"input":[[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,8,1,1,1,1,1,1,1,1,1,1,9,9,1],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,7,1],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,7,7],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],[1,1,1,1,1,1,1,... | """Generator for Test2/t45: toggle shadow and light from a yellow marker.
Rule:
- A yellow (4) marker is placed at a corner or the midpoint of one edge.
- The grid has a single non-black/non-yellow background color.
- Non-background, non-yellow cells cast black shadows away from the marker:
* from an edge midpoint... | """Verifier for Test2/t45 toggle shadow/light rule."""
from __future__ import annotations
from typing import List
from generator import transform_t45
Grid = List[List[int]]
def verify_t45(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])... |
t46 | sudoku_quadrants | The grid is five by five, with a grey middle row and middle column dividing it into four two-by-two quadrants. Four colours fill the sixteen non-grey cells so that no row, no column and no quadrant holds the same colour twice. The input reveals four cells, one of each colour, and the output is the single completion tho... | human_reviewed | [{"input":[[0,0,5,8,0],[0,4,5,0,0],[5,5,5,5,5],[0,0,5,7,0],[3,0,5,0,0]],"output":[[7,3,5,8,4],[8,4,5,3,7],[5,5,5,5,5],[4,8,5,7,3],[3,7,5,4,8]]},{"input":[[0,0,5,0,0],[0,1,5,6,0],[5,5,5,5,5],[0,0,5,0,0],[8,0,5,0,9]],"output":[[6,8,5,9,1],[9,1,5,6,8],[5,5,5,5,5],[1,9,5,8,6],[8,6,5,1,9]]},{"input":[[7,0,5,0,0],[0,0,5,3,0]... | [[0,0,5,0,8],[0,6,5,0,0],[5,5,5,5,5],[3,0,5,0,0],[0,0,5,4,0]] | [[4,3,5,6,8],[8,6,5,3,4],[5,5,5,5,5],[3,4,5,8,6],[6,8,5,4,3]] | {"train":[{"input":[[0,1,5,0,0],[0,0,5,4,0],[5,5,5,5,5],[0,9,5,0,0],[0,0,5,8,0]],"output":[[4,1,5,9,8],[9,8,5,4,1],[5,5,5,5,5],[8,9,5,1,4],[1,4,5,8,9]]},{"input":[[0,0,5,0,0],[7,0,5,1,0],[5,5,5,5,5],[0,0,5,0,0],[0,9,5,0,3]],"output":[[9,1,5,3,7],[7,3,5,1,9],[5,5,5,5,5],[3,7,5,9,1],[1,9,5,7,3]]},{"input":[[0,0,5,4,0],[3... | [{"input":[[0,1,5,0,0],[0,0,5,4,0],[5,5,5,5,5],[0,9,5,0,0],[0,0,5,8,0]],"output":[[9,1,5,8,9],[4,8,5,4,1],[5,5,5,5,5],[1,9,5,4,1],[8,4,5,8,9]]},{"input":[[0,0,5,0,0],[7,0,5,1,0],[5,5,5,5,5],[0,0,5,0,0],[0,9,5,0,3]],"output":[[7,9,5,1,3],[3,1,5,9,7],[5,5,5,5,5],[1,3,5,7,9],[9,7,5,3,1]]},{"input":[[0,0,5,4,0],[3,0,5,0,0]... | """Generator for Test2/t46: 4-color sudoku over 2x2 quadrants.
Rule:
- The grid is always 5x5.
- The middle row and middle column are gray (5), splitting the grid into four
2x2 quadrants.
- The four non-gray colors must fill the sixteen non-gray cells.
- No row, column, or 2x2 quadrant may contain the same color twi... | """Verifier for Test2/t46 4-color sudoku quadrants rule."""
from __future__ import annotations
from typing import List
from generator import transform_t46
Grid = List[List[int]]
def verify_t46(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
if len(inp... |
t47 | xor_halves | Two equal halves are separated by a full grey line, and both share one background colour. Each half carries a single other colour as its foreground. Compare the halves position by position: where only the first half has foreground, the output takes the first half's colour; where only the second does, it takes the secon... | human_reviewed | [{"input":[[4,4,2,4,4,4,5,4,4,4,3,4,4],[4,4,2,2,4,4,5,3,4,3,4,4,4],[4,2,4,2,2,4,5,3,4,3,4,4,4],[4,4,4,4,4,4,5,4,4,3,4,3,3],[2,2,4,2,4,4,5,3,4,4,4,4,3],[4,4,4,4,2,2,5,3,3,3,4,4,3]],"output":[[0,0,2,3,0,0],[3,0,0,2,0,0],[3,2,3,2,2,0],[0,0,3,0,3,3],[0,2,0,2,0,3],[3,3,3,0,2,0]]},{"input":[[8,8,8,8,7,8,8],[8,8,7,8,8,8,8],[8... | [[1,1,1,4,4,5,1,1,1,9,1],[4,4,1,1,4,5,9,9,1,9,9],[1,1,4,1,1,5,1,1,1,1,1],[1,4,4,4,1,5,9,1,9,9,1],[4,1,4,1,1,5,1,1,1,9,1],[4,4,4,1,1,5,1,9,1,1,1],[1,1,1,4,1,5,1,9,9,9,1],[1,4,1,1,4,5,1,9,1,9,1],[1,4,4,1,1,5,1,9,1,1,1]] | [[0,0,0,0,4],[0,0,0,9,0],[0,0,4,0,0],[9,4,0,0,0],[4,0,4,9,0],[4,0,4,0,0],[0,9,9,0,0],[0,0,0,9,4],[0,0,4,0,0]] | {"train":[{"input":[[1,1,1,4,1,1,4,1,1,5,7,1,7,7,1,1,7,7,1],[1,4,1,1,1,1,4,1,4,5,1,1,1,1,1,7,1,7,1],[1,1,1,1,1,4,1,4,4,5,7,1,1,7,1,1,1,7,7],[4,1,4,4,4,4,1,1,1,5,1,1,1,1,1,7,1,7,7],[4,1,4,1,1,4,1,1,4,5,1,1,1,7,1,7,7,1,1],[1,4,1,1,4,1,4,1,1,5,7,1,1,7,1,7,7,7,7],[1,1,1,1,4,4,4,4,4,5,1,1,1,1,1,1,7,1,1],[1,1,4,4,1,4,1,4,4,5... | [{"input":[[3,3,3,5,2,2,3],[3,9,3,5,2,3,3],[3,9,3,5,3,3,2],[3,9,3,5,2,2,3],[3,9,9,5,2,3,2],[3,9,3,5,2,2,2]],"output":[[2,2,0],[2,9,0],[0,9,2],[2,9,0],[2,9,9],[2,9,2]]},{"input":[[4,4,2,2,4,2,4,4,4,5,3,3,3,3,4,3,3,3,3],[4,4,2,4,4,4,2,2,4,5,3,4,4,3,3,3,4,4,4],[4,4,2,4,4,2,4,4,2,5,3,3,4,3,3,4,4,3,3],[2,2,4,4,4,2,4,4,2,5,4... | """Generator for Test2/t47: XOR two halves separated by a gray line.
Rule:
- The input consists of two equal-size halves separated by a full gray (5) line.
- The halves share one background color.
- Each half has exactly one non-background foreground color.
- For each corresponding location, output:
- the left/top... | """Verifier for Test2/t47 XOR-halves rule."""
from __future__ import annotations
from typing import List
from generator import transform_t47
Grid = List[List[int]]
def verify_t47(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
w = len(inp[0])
if a... |
t48 | unique_map_coloring | The last row begins with four palette colours. Above it lies a map whose walls are drawn in a colour that is not in the palette, dividing the area into regions. Some regions already carry a palette colour and at least one is still empty. Fill every empty region so that no two regions sharing a border end up the same co... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,3,3,3,3,3,0,0],[0,0,0,0,3,3,3,3,3,4,4,4,3,0,0],[0,0,0,0,3,6,6,6,3,4,4,4,3,0,0],[0,0,0,0,3,6,6,6,3,4,4,4,3,0,0],[0,0,0,0,3,6,3,3,3,3,4,4,3,0,0],[0,0,0,0,3,6,3,5,5,3,3,3,3,3,0],[0,0,0,0,3,6,3,5,5,3,8,8,8,3,0],[0,0,0,3,3,3,3,3,3,3,8,8,8,3,0],[0,0,0,3,0,0,0,0,3,8,... | [[0,0,0,6,6,6,6,6,0,0,0,0,0,0,0,0,0],[0,0,0,6,4,4,4,6,6,6,6,0,0,0,0,0,0],[0,0,0,6,4,4,4,6,0,0,6,6,6,6,6,6,0],[0,0,0,6,4,4,4,6,0,0,6,5,5,5,5,6,0],[0,0,0,6,4,4,4,6,0,0,6,5,5,5,5,6,0],[6,6,6,6,6,6,6,6,6,6,6,6,6,5,5,6,0],[6,8,8,8,8,8,6,9,9,9,9,9,6,5,5,6,0],[6,8,8,8,8,8,6,9,9,9,9,9,6,6,6,6,0],[6,6,6,6,6,6,6,9,9,9,9,9,6,0,0,... | [[0,0,0,6,6,6,6,6,0,0,0,0,0,0,0,0,0],[0,0,0,6,4,4,4,6,6,6,6,0,0,0,0,0,0],[0,0,0,6,4,4,4,6,8,8,6,6,6,6,6,6,0],[0,0,0,6,4,4,4,6,8,8,6,5,5,5,5,6,0],[0,0,0,6,4,4,4,6,8,8,6,5,5,5,5,6,0],[6,6,6,6,6,6,6,6,6,6,6,6,6,5,5,6,0],[6,8,8,8,8,8,6,9,9,9,9,9,6,5,5,6,0],[6,8,8,8,8,8,6,9,9,9,9,9,6,6,6,6,0],[6,6,6,6,6,6,6,9,9,9,9,9,6,0,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,7,7,7,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,8,8,7,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,8,8,7,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,7,8,8,7,0,0,0,0,0,0,0,0,0],[0,7,7,7,7,7,7,7,7,7,0,0,0,0,0,0,0,0,0],[0,7,8,8,8,8,7,0,0,7... | [{"input":[[0,0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,3,0,0,0,0,3,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,3,0,0,0,0,3,0,0,0,0,0,0],[0,0,3,0,0,0,3,3,3,3,3,0,0,0,0,3,3,3,3,0,0,0],[0,0,3,0,0,0,3,2,2,2,3,0,0,0,0,3,5,5,3,0,0,0],[0,0,3,0,0,0,3,2,2,2,3,0,0,0,0,3,5,5,3,0,0,0],[0,0,3,0,0,0,3,2,2,2,3,0,0,0,0,3,... | """Generator for Test2/t48: uniquely completable four-color map coloring.
Rule:
- The last row begins with four palette colors.
- In the map area above, one boundary color (not in the palette) forms the map
walls, enclosing several regions.
- Some regions are already colored with palette colors; at least one region ... | """Verifier for Test2/t48 uniquely completable four-color map coloring."""
from __future__ import annotations
from typing import List
from generator import transform_t48
Grid = List[List[int]]
def verify_t48(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")... |
t49 | aligned_node_mst | Several two-by-two nodes sit on the grid, all in one colour. Two nodes can be joined only where their blocks line up, sharing a top row or a left column. The cost of a join is the gap between the facing edges of the two blocks, counted in cells. Connect every node using the cheapest set of joins that leaves them all li... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0],[0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,1,1,0,0,0,0,0,1,1,0,1,1,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,0,0,0,2,2,0,0,0,0],[0,0,0,2,2,0,0,0,2,2,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,0,2,2,0,0,2,2,0,0],[0,0,0,2,2,0,2,2,0,0,2,2,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,5,5,5,2,2,0,0,0,0],[0,0,0,2,2,5,5,5,2,2,0,0,0,0],[0,0,0,5,5,0,0,0,0,0,0,0,0,0],[0,0,0,5,5,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,5,2,2,5,5,2,2,0,0],[0,0,0,2,2,5,2,2,5,5,2,2,0,0],[0,0,0,5,5,0,0,0,0,0,5,5,0,0],[0,0,0,5,5,0,0,0,0,0,5,5,0,0],[0,0,0,5,5,0,0,0,0,0,5,5,0,0],[0,0,0,2,2,0,0,0,0,... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0],[0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0],... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,2,2,0,0,2,2,0,0,0,0,2,2,0,0],[0,0,0,2,2,0,0,2,2,0,0,0,0,2,2,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,2,2,0,... | """Generator for Test2/t49: aligned 2x2 nodes connected by an MST.
Rule:
- The input contains several 2x2 nodes, all in one non-black/non-gray color.
- Two nodes can be connected only when their 2x2 blocks have the same top row
or the same left column.
- The weight of a valid connection is the gap distance between t... | """Verifier for Test2/t49 aligned-node minimal-spanning-tree rule."""
from __future__ import annotations
from typing import List
from generator import transform_t49
Grid = List[List[int]]
def verify_t49(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
... |
t50 | cycle_polygon | Grey cells are nodes, and one node carries a different colour, marking the start. Beside each node sits a single orange cell, which points in one of the four directions. From a node, travel in its indicated direction until the next node is met; this gives every node exactly one successor. Follow successors from the hig... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,5,7,0,5,7,0,5,0,0],[0,0,7,0,0,0,0,0,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,7,0,5,0,0,3,7,0,5,0,0],[0,0,0,0,0,7,0,0,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,5,7,0,5,7,0,5,0,0],[0,0,7,0,0,0,0,0,0,0,0,7,0,0],[0,0,0,0,... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,0,7,5,0,7,5,0,0,5,7,0,5,0],[0,7,0,0,0,0,0,0,0,0,0,0,0,7,0],[0,0,0,0,0,0,0,0,0,0,7,0,0,0,0],[0,1,7,0,5,0,0,5,7,0,5,0,0,5,0],[0,0,0,0,7,0,0,0,0,0,0,0,0,7,0],[0,7,0,0,0,0,0,7,0,0,0,0,0,0,0],[0,5,0,0,5,0,0,5,0,0,5,7,0,5,0],[0,0,0,0,7,0,0,0,0,0,0,0,0,7,0],[0,7,0,0,0,0,0,7,0,0,0,0,0,0,0]... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,0,7,5,0,7,5,0,0,1,1,1,1,0],[0,7,0,0,0,0,0,0,0,0,1,0,0,1,0],[0,0,0,0,0,0,0,0,0,0,1,0,0,1,0],[0,5,7,0,5,0,0,1,1,1,1,0,0,1,0],[0,0,0,0,7,0,0,1,0,0,0,0,0,1,0],[0,7,0,0,0,0,0,1,0,0,0,0,0,1,0],[0,5,0,0,5,0,0,1,0,0,5,7,0,1,0],[0,0,0,0,7,0,0,1,0,0,0,0,0,1,0],[0,7,0,0,0,0,0,1,0,0,0,0,0,1,0]... | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,5,0,0,5,0,7,5,0,7,5,0,7,5,0,0,0],[0,7,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0],[0,5,7,0,5,7,0,5,0,7,9,0,7,5,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0... | [{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,5,0,0,0,5,0,0],[0,0,7,0,0,0,7,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,7,5,0,0,0,5,0,0],[0,0,7,0,0,0,0,0,0,0,7,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,7,0,0],[0,0,5,7,0,0,5,0,0,0,5,0,0],[... | """
Generator for t50: Functional-graph cycle detection → polygon drawing.
Layout
------
Nodes occupy a regular (R_n × C_n) sub-grid inside the pixel grid.
Each node sits at pixel position
(r0 + ri * s, c0 + ci * s)
where (ri, ci) is its 0-based node-grid index, r0/c0 are the top-left
offsets, and s is the node... | """
Verifier for t50: Functional-graph cycle detection → polygon drawing.
Rule
----
The input is a pixel grid containing:
• Gray (5) nodes arranged on a regular sub-grid.
• Exactly one highlighted node (any colour ≠ 0, 5, 7) — the start.
• For every node (gray or highlighted) exactly one adjacent (4-connected)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.