Datasets:
row_uid stringlengths 16 16 | source stringclasses 1
value | task stringclasses 1
value | question stringlengths 142 277 | options stringclasses 0
values | answer stringclasses 4
values | num_input_images int32 1 1 | num_steps int32 3 7 | input_image_0 imagewidth (px) 293 512 | thought_0 stringlengths 50 398 | target_image_0 imagewidth (px) 336 512 | thought_1 stringlengths 47 626 | target_image_1 imagewidth (px) 336 512 | thought_2 stringlengths 46 411 | target_image_2 imagewidth (px) 336 512 | thought_3 stringlengths 46 366 ⌀ | target_image_3 imagewidth (px) 336 512 ⌀ | thought_4 stringlengths 43 255 ⌀ | target_image_4 imagewidth (px) 336 512 ⌀ | thought_5 stringlengths 46 277 ⌀ | target_image_5 imagewidth (px) 336 512 ⌀ | thought_6 stringclasses 235
values | target_image_6 imagewidth (px) 336 448 ⌀ | thought_7 stringlengths 61 495 | split stringclasses 1
value | license stringclasses 1
value | source_scene_corpus stringclasses 1
value | est_tokens int32 10.6k 24.6k | filter_flags stringclasses 5
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6b42e76ba4799ec1 | zebra_tetris | tetris_transform | Fill the exact red shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly fill the given red shape. I need to examine the shape and the pieces in each option.
THOUGHT 1: Let's isolate the red shape from the grid to better visualize its form and count the number of cells it occupies. | THOUGHT 2: The isolated red shape is shown. It occupies 14 cells. Now I need to check the options to find a set of pieces that also totals 14 cells and can fit into this shape.
THOUGHT 3: Option A contains three pieces. Let's test if these pieces can tile the red shape. I will start by placing the first piece. | THOUGHT 4: The first piece from option A has been placed, covering part of the red shape. Now I will place the second piece from option A. | THOUGHT 5: The second piece is now placed, filling more of the shape. Let's place the third and final piece from option A. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from Option A have been placed and they perfectly tile the red shape without any gaps or overlaps.
THOUGHT 7: Since the pieces in Option A perfectly fit the red shape, Option A is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,641 | S5.replay_unsupported | |||||
e48a5281429753e5 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the magenta shape: scale by 2×, then rotate 90° clockwise, then translate 1 down and 1 left, then translate 2 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | A | 1 | 6 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the given shape and identifying the final result among the options.
THOUGHT 1: First, visualize the initial shape on the grid to understand its structure before transformations begin. | THOUGHT 2: Apply the first transformation: scale the shape by 2x. This doubles the size in both dimensions. | THOUGHT 3: Next, rotate the scaled shape 90 degrees clockwise. The orientation of the shape changes. | THOUGHT 4: Apply the first translation: move the shape 1 unit down and 1 unit left from its current position. | THOUGHT 5: Apply the second translation: move the shape 2 units right from its current position. | THOUGHT 6: Finally, apply the second rotation: rotate the shape 90 degrees clockwise again. This is the final transformed shape. | null | Not supported with pagination yet | THOUGHT 7: Compare the final transformed shape shown in the last image to the provided options (A, B, C, D) in the problem image.
THOUGHT 8: The shape resulting from the sequence of transformations exactly matches the shape shown in option A. | train | cc-by-nc-4.0 | procedural_grid | 23,599 | S5.replay_unsupported | |||||||
3434a0afa773659c | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the blue shape: translate 2 right, then translate 2 left, then rotate 90° clockwise, then translate 2 up and 1 left. Choose the option that shows the resulting shape. | null | D | 1 | 5 | THOUGHT 0: The problem asks to apply a sequence of transformations to a given blue shape and identify the final resulting shape from the options provided.
THOUGHT 1: I will visualize the initial shape on a grid before applying any transformations. | THOUGHT 2: The initial shape consists of five blue squares arranged in an 'L' like pattern.
THOUGHT 3: The first transformation is to translate the shape 2 units to the right. I will visualize this step. | THOUGHT 4: After translating 2 units right, the shape has shifted horizontally across the grid.
THOUGHT 5: The second transformation is to translate the shape 2 units to the left. I will visualize this step. | THOUGHT 6: Translating 2 units left brings the shape back to its original horizontal position.
THOUGHT 7: The third transformation is to rotate the shape 90 degrees clockwise. I will visualize this rotation. | THOUGHT 8: The shape is now rotated 90 degrees clockwise and positioned on the right side of the grid.
THOUGHT 9: The final transformation is to translate the shape 2 units up and 1 unit left. I will visualize this final step. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 10: The final shape is a horizontal line of three squares with two squares below the left end.
THOUGHT 11: I will compare this final shape to the options provided in the original problem image to find the correct match. | train | cc-by-nc-4.0 | procedural_grid | 16,349 | S5.replay_unsupported | ||||||
bf4f0b2573bd9aa1 | zebra_tetris | tetris_transform | Fill the exact orange shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly tile the given orange shape.
THOUGHT 1: First, I need to clearly identify the target orange shape on the grid. | THOUGHT 2: The image shows the specific grid and the orange area that needs to be filled by the pieces.
THOUGHT 3: I will evaluate the options provided to see which set of pieces matches the area of the orange shape and can tile it. Option A consists of three pieces.
THOUGHT 4: Let's attempt to tile the orange shape us... | THOUGHT 5: The first piece from option A has been placed, covering part of the orange area.
THOUGHT 6: Now, I will place the second piece from option A into the remaining orange area. | THOUGHT 7: The second piece from option A is placed, filling more of the shape.
THOUGHT 8: Finally, I will place the third piece from option A to complete the tiling. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 9: All three pieces from option A have been placed, completely filling the orange shape without any gaps or overlaps.
THOUGHT 10: Since the pieces from option A perfectly tile the shape, option A is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 13,428 | S5.replay_unsupported | |||||
15a5c679936d7c6a | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the green shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the green shape. | null | A | 1 | 6 | THOUGHT 0: The problem asks to identify the set of pieces that perfectly fill the grid area not covered by the green shape.
THOUGHT 1: First, I will isolate the green shape from the grid to clearly see the area it occupies. | THOUGHT 2: Next, I will determine the area that needs to be filled, which is the complement of the green shape within the grid. | THOUGHT 3: Now I need to find which option provides pieces that can completely cover the white area shown in the previous image without overlap.
THOUGHT 4: Let's test option A by placing its first piece (light blue) onto the target area. | THOUGHT 5: I will continue with the second piece from option A (green) and place it in the remaining white space. | THOUGHT 6: Placing the third piece from option A (orange) covers more of the white area. | THOUGHT 7: Finally, placing the fourth piece from option A (red) completes the filling of the white area. | null | Not supported with pagination yet | THOUGHT 8: All pieces from option A fit perfectly into the complement of the green shape, filling the entire grid.
THOUGHT 9: Option A successfully covers the target area, while other options contain different shapes or counts of cells that would not fit correctly. | train | cc-by-nc-4.0 | procedural_grid | 21,248 | S5.replay_unsupported | |||||||
87402f41b42b6b97 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: translate 1 up and 1 left, then translate 1 down and 2 left, then mirror horizontally. Choose the option that shows the resulting shape. | null | A | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial cyan shape shown in the top grid and identifying the final result among the given options.
THOUGHT 1: I will start by visualizing the initial shape to prepare for the transformations. | THOUGHT 2: The first transformation is to translate the shape 1 unit up and 1 unit left. I will show the shape after this step. | THOUGHT 3: Next, I apply the second translation: 1 unit down and 2 units left. This is the shape after the second step. | THOUGHT 4: The final transformation is to mirror the shape horizontally. I will now show the shape after this reflection. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Now that all transformations are complete, I will compare the final shape with the provided options to find the match.
THOUGHT 6: The final transformed shape matches option A. | train | cc-by-nc-4.0 | procedural_grid | 13,551 | S5.replay_unsupported | |||||
04213b2d0e60377b | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the yellow shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the yellow shape. | null | A | 1 | 6 | THOUGHT 0: The goal is to identify the set of pieces that perfectly fill the grid area not covered by the initial yellow shape.
THOUGHT 1: First, isolate the initial yellow shape within the grid to clearly see its form. | THOUGHT 2: Determine the area of the grid that is not occupied by the yellow shape. This is the target area to be filled. | THOUGHT 3: Now, evaluate the options provided to find the set of pieces that precisely fit into the identified empty area.
THOUGHT 4: Begin by attempting to place the first piece from Option A into the empty region. | THOUGHT 5: Continue placing the second piece from Option A to see if it fits alongside the first piece in the empty area. | THOUGHT 6: Place the third piece from Option A to further fill the remaining empty space. | THOUGHT 7: Finally, place the fourth piece from Option A to complete the filling of the empty region. | null | Not supported with pagination yet | THOUGHT 8: The pieces from Option A successfully cover the entire area not occupied by the original yellow shape.
THOUGHT 9: Comparing this filled area with the options confirms that the set of pieces in Option A is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 23,705 | S5.replay_unsupported | |||||||
ca9d681baba4607d | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: rotate 90° clockwise, then translate 2 up and 1 right, then translate 1 right, then rotate 90° clockwise, then translate 2 up and 2 left. Choose the option that shows the resulting shape. | null | B | 1 | 6 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial red shape and identifying the final position and orientation from the given options.
THOUGHT 1: I will start by visualizing the initial shape on a grid to track its position through the transformations. | THOUGHT 2: The initial shape is shown on the grid. Now, apply the first transformation: rotate 90° clockwise around a pivot point. | THOUGHT 3: The shape is now rotated. Next, apply the second transformation: translate the shape 2 units up and 1 unit right. | THOUGHT 4: The shape has been translated. Apply the third transformation: translate the shape an additional 1 unit right. | THOUGHT 5: The shape is translated further right. Now, apply the fourth transformation: rotate 90° clockwise. | THOUGHT 6: The shape has been rotated again. Finally, apply the fifth transformation: translate the shape 2 units up and 2 units left. | null | Not supported with pagination yet | THOUGHT 7: This is the final transformed shape. I will now compare this result to the options provided in the problem image to find the match.
THOUGHT 8: Comparing the final shape with options A, B, C, and D, option B exactly matches the position and orientation of the transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 18,955 | S5.replay_unsupported | |||||||
9244cac93c6cb709 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the yellow shape: rotate 90° clockwise, then translate 1 down and 2 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | D | 1 | 4 | THOUGHT 0: The problem asks to apply a sequence of three transformations to the initial yellow shape and identify the final result among the given options.
THOUGHT 1: I will start by visualizing the initial shape on a grid to track the transformations. | THOUGHT 2: First, rotate the shape 90° clockwise. The shape is a 2x2 square, so it remains a 2x2 square but its position relative to a fixed point would change if it were not centered. Since it's a symmetric shape, the visual representation after rotation looks the same as the initial shape but its position on the grid... | THOUGHT 3: Next, translate the shape 1 unit down and 2 units right from its current position. | THOUGHT 4: Finally, rotate the shape 90° clockwise again. Since it's still a 2x2 square, the shape itself doesn't change visually, but its position on the grid is the result of the previous steps and this final rotation. The image shows the shape in the bottom right corner. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The final shape is a 2x2 square in the bottom right corner of the grid.
THOUGHT 6: Compare the final transformed shape with the given options A, B, C, and D. Option D shows a 2x2 yellow square in the bottom right corner, which matches the final transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 13,734 | S5.replay_unsupported | |||||
d927726c6983a8c3 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | B | 1 | 5 | THOUGHT 0: The problem asks to identify the set of cells in the grid that are not part of the given magenta shape and find the option that represents this set.
THOUGHT 1: First, I will isolate the magenta shape from the grid to clearly see its form and position. | THOUGHT 2: Next, I will determine the complement of the magenta shape within the grid, which represents the area to be filled. | THOUGHT 3: The task is to find which option provides pieces that perfectly fill the black area shown in the previous image.
THOUGHT 4: I will test option B by placing its first piece, the green shape, into the complement area. | THOUGHT 5: Now, I will place the second piece from option B, the gray shape, into the remaining space. | THOUGHT 6: Finally, I will place the third piece from option B, the red shape, into the last remaining space. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: After placing all three pieces from option B, they completely fill the area that was not occupied by the original magenta shape.
THOUGHT 8: Option B's pieces perfectly tile the complement area, while other options do not match the required shape or size. | train | cc-by-nc-4.0 | procedural_grid | 17,977 | S5.replay_unsupported | ||||||
254787726beecea8 | zebra_tetris | tetris_transform | Fill the exact cyan shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | C | 1 | 4 | THOUGHT 0: Analyze the target cyan shape displayed in the puzzle grid. | THOUGHT 1: The visual shows the specific grid layout of the cyan shape that needs to be tiled.
THOUGHT 2: Examine the provided options to find a set of pieces that could tile the shape. Option C appears promising.
THOUGHT 3: To verify option C, I will place its pieces onto the target shape. First, place the yellow piec... | THOUGHT 4: The first piece fits into the lower right corner.
THOUGHT 5: Next, place the orange piece from option C. | THOUGHT 6: The second piece fits into the upper left corner, filling a significant portion.
THOUGHT 7: Finally, place the gray piece from option C. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 8: The third piece perfectly fills the remaining area of the cyan shape.
THOUGHT 9: All pieces from option C tile the cyan shape exactly without overlap or gaps. | train | cc-by-nc-4.0 | procedural_grid | 16,489 | S5.replay_unsupported | |||||
de5a54bef1f4ef33 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the green shape: scale by 2×, then translate 1 right, then translate 2 up, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | A | 1 | 5 | THOUGHT 0: The problem asks to apply a sequence of transformations to the initial green shape and identify the resulting shape among the options.
THOUGHT 1: I will visualize the initial green shape on a grid to perform the transformations step-by-step. | THOUGHT 2: The first transformation is scaling by 2x. This doubles the size of the shape while keeping its center relative to the grid. The image shows the shape after scaling. | THOUGHT 3: Next, the shape is translated 1 unit to the right. The image shows the scaled shape shifted one column to the right. | THOUGHT 4: The third transformation is translating the shape 2 units up. The image depicts the shape after being moved two rows upwards from the previous position. | THOUGHT 5: Finally, the shape is rotated 90 degrees clockwise. The image shows the final orientation and position of the shape after all transformations. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: Now I need to compare the final shape shown in the last image with the given options A, B, C, and D.
THOUGHT 7: I will carefully examine the arrangement of the green cells in the final transformed shape and compare it to each option.
THOUGHT 8: Option A perfectly matches the shape resulting from the sequence... | train | cc-by-nc-4.0 | procedural_grid | 18,239 | S5.replay_unsupported | ||||||
d71b2875e5275fe3 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the yellow shape: mirror horizontally, then translate 1 up and 2 right, then translate 1 down and 1 left. Choose the option that shows the resulting shape. | null | D | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to an initial shape and identifying the final result among the given options.
THOUGHT 1: I will apply the transformations step-by-step, starting with the initial shape shown in the puzzle grid. | THOUGHT 2: The first transformation is mirroring horizontally. This flips the shape across a vertical line. | THOUGHT 3: Next, translate the shape 1 unit up and 2 units right from its current position. | THOUGHT 4: Finally, translate the shape 1 unit down and 1 unit left from its position after the previous step. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The image above shows the shape after all transformations are applied. I need to compare this final shape to the four options provided in the problem image.
THOUGHT 6: By comparing the position and arrangement of the yellow squares in the final transformed shape with options A, B, C, and D, I can find the co... | train | cc-by-nc-4.0 | procedural_grid | 16,741 | S5.replay_unsupported | |||||
69e90f84e52a0b1d | zebra_tetris | tetris_transform | Fill the exact cyan shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | D | 1 | 3 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly fill the given cyan shape.
THOUGHT 1: First, let's isolate and examine the exact layout of the cyan shape to understand its dimensions and structure. | THOUGHT 2: The isolated shape consists of 9 squares. We need to find an option set whose pieces combine to form this 9-square shape.
THOUGHT 3: Let's evaluate Option D, which contains two pieces: one with 4 squares and one with 5 squares, totaling 9 squares.
THOUGHT 4: Place the first piece from Option D (the 4-square ... | THOUGHT 5: The first piece fits perfectly in the left part of the shape. Now, place the second piece from Option D (the 5-square piece). | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: The second piece fills the remaining area of the cyan shape without overlap or gaps. This confirms Option D tiles the shape.
THOUGHT 7: Since Option D's pieces perfectly tile the shape, it is the correct solution. Other options can be visually inspected to confirm they do not fit or have a different total nu... | train | cc-by-nc-4.0 | procedural_grid | 11,937 | S5.replay_unsupported | ||||
793bbd64f8c91906 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the yellow shape: rotate 90° clockwise, then translate 1 up and 1 left, then translate 2 down and 2 right, then translate 1 left, then translate 2 down. Choose the option that shows the resulting shape. | null | A | 1 | 6 | THOUGHT 0: The problem requires applying a specific sequence of geometric transformations to the initial yellow shape shown in the puzzle grid.
THOUGHT 1: I will apply each transformation step-by-step to the shape, visualizing the result on a grid. This is the initial shape. | THOUGHT 2: First, rotate the shape 90° clockwise around its center. The image shows the shape after this rotation. | THOUGHT 3: Next, translate the rotated shape 1 unit up and 1 unit left. The image shows the shape after this translation. | THOUGHT 4: Now, translate the shape 2 units down and 2 units right. The image displays the shape's new position. | THOUGHT 5: Apply the fourth transformation: translate the shape 1 unit left. The image shows the result of this movement. | THOUGHT 6: Finally, translate the shape 2 units down. This last image shows the final position and orientation of the transformed shape. | null | Not supported with pagination yet | THOUGHT 7: The final shape needs to be compared to the given options (A, B, C, D) to find the correct match. | train | cc-by-nc-4.0 | procedural_grid | 23,582 | S5.replay_unsupported | |||||||
49b767030254273f | zebra_tetris | tetris_transform | Fill the exact yellow shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | D | 1 | 4 | THOUGHT 0: Analyze the target yellow shape that needs to be filled by pieces from one of the options. | THOUGHT 1: Review the available options (A, B, C, D) and their respective sets of pieces. Option D contains pieces that appear to match the shape's components.
THOUGHT 2: Begin the process of tiling the yellow shape using the pieces provided in Option D. Start by placing the first piece (red). | THOUGHT 3: Continue tiling the shape by placing the second piece from Option D (grey) next to the first piece. | THOUGHT 4: Place the third and final piece from Option D (green) to attempt to complete the tiling of the yellow shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Observe that the three pieces from Option D perfectly fill the entire yellow shape without any gaps or overlaps. This confirms Option D is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,532 | S5.replay_unsupported | |||||
b5a096cc9b8a28a0 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: translate 2 up and 1 left, then translate 1 up and 2 right, then mirror horizontally, then translate 2 up and 1 left. Choose the option that shows the resulting shape. | null | B | 1 | 5 | THOUGHT 0: The problem asks to apply a sequence of four transformations to an initial shape and identify the final result among the options.
THOUGHT 1: I will visualize the initial shape on a grid to track its position and form through the transformations. | THOUGHT 2: The first transformation is a translation of 2 units up and 1 unit left. The image shows the shape after this step. | THOUGHT 3: Next, apply a translation of 1 unit up and 2 units right to the shape from the previous step. | THOUGHT 4: The third transformation is a horizontal mirror of the current shape. The image shows the shape reflected horizontally. | THOUGHT 5: Finally, apply a translation of 2 units up and 1 unit left to the shape from the previous step. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: The final shape after all transformations is shown in the last image.
THOUGHT 7: Compare the final transformed shape with the given options A, B, C, and D to find the exact match. The shape matches option B. | train | cc-by-nc-4.0 | procedural_grid | 18,159 | S5.replay_unsupported | ||||||
eb2863193a565ba4 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the blue shape: scale by 2×, then rotate 90° clockwise, then translate 2 down and 2 left, then translate 2 down and 2 right, then translate 2 up and 2 left. Choose the option that shows the resulting shape. | null | C | 1 | 6 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial blue shape and identifying the final shape among the options.
THOUGHT 1: First, visualize the initial shape on the grid before any transformations. | THOUGHT 2: The first transformation is scaling by 2x. This doubles the size of the shape. | THOUGHT 3: Next, rotate the scaled shape 90 degrees clockwise. | THOUGHT 4: Apply the first translation: move the shape 2 units down and 2 units left. | THOUGHT 5: Apply the second translation: move the shape 2 units down and 2 units right from its current position. | THOUGHT 6: Apply the final translation: move the shape 2 units up and 2 units left from its current position. | null | Not supported with pagination yet | THOUGHT 7: Compare the final transformed shape to the given options to find the match.
THOUGHT 8: The final shape matches option C. | train | cc-by-nc-4.0 | procedural_grid | 21,146 | S5.replay_unsupported | |||||||
a7210a38198bbf16 | zebra_tetris | tetris_transform | Fill the exact cyan shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | B | 1 | 4 | THOUGHT 0: The problem asks to find the set of pieces from the given options that perfectly fills the cyan shape in the grid.
THOUGHT 1: I will focus on the cyan shape to understand its structure and count the number of cells it occupies. | THOUGHT 2: The isolated cyan shape shows a total of 12 cells. I need to find an option set with pieces that sum to 12 cells and can tile this shape. Option B has pieces with 4, 4, and 4 cells, totaling 12.
THOUGHT 3: I will test if the pieces from Option B can tile the shape. First, I will place the green piece. | THOUGHT 4: Next, I will place the blue piece from Option B into the remaining space. | THOUGHT 5: Finally, I will place the pink piece from Option B to complete the tiling. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from Option B fit perfectly into the cyan shape without any gaps or overlaps.
THOUGHT 7: Since the pieces from Option B successfully tiled the shape, it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 14,953 | S5.replay_unsupported | |||||
77bc21f69495c711 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | D | 1 | 6 | THOUGHT 0: The task is to find the set of pieces that perfectly tile the area of the grid not covered by the initial magenta shape.
THOUGHT 1: First, I will isolate the magenta shape from the puzzle grid to clearly see its form. | THOUGHT 2: Next, I will determine the complement shape, which includes all grid cells not occupied by the magenta shape. This is the area to be filled. | THOUGHT 3: I will now examine the options to find the set of pieces that perfectly fit into the identified complement shape.
THOUGHT 4: Let's test option D by placing the first piece (red) into the complement area. | THOUGHT 5: Continue testing option D by placing the second piece (magenta single square) into the remaining area. | THOUGHT 6: Place the third piece (grey) from option D into the remaining space. | THOUGHT 7: Now, place the fourth piece (blue) and the fifth piece (green) from option D. | null | Not supported with pagination yet | THOUGHT 8: All pieces from option D successfully tile the complement shape, confirming it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 23,495 | S5.replay_unsupported | |||||||
6c8c40da8ffa6581 | zebra_tetris | tetris_transform | Fill the exact cyan shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | C | 1 | 4 | THOUGHT 0: The problem asks to find the set of pieces from the options that perfectly fills the given cyan shape.
THOUGHT 1: Let's isolate the target cyan shape to analyze its form and area. | THOUGHT 2: The isolated shape shows the exact area to be filled. It consists of 14 cells.
THOUGHT 3: Examine the options provided. Option C contains three pieces. Let's see if these pieces can tile the shape.
THOUGHT 4: Begin tiling the shape with the first piece from Option C (the gray L-shape). | THOUGHT 5: The gray piece fits in the bottom left corner. Now, place the second piece from Option C (the orange 2x3 rectangle with a cell removed). | THOUGHT 6: The orange piece fits next to the gray piece, covering the middle section. Place the third piece from Option C (the blue 2x2 square with a cell removed). | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: The blue piece fits in the remaining space on the right. All three pieces from Option C perfectly tile the cyan shape. | train | cc-by-nc-4.0 | procedural_grid | 16,556 | S5.replay_unsupported | |||||
7a67ab726ed99c7c | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: translate 1 up, then mirror horizontally, then translate 1 down. Choose the option that shows the resulting shape. | null | D | 1 | 4 | THOUGHT 0: The problem asks to apply a sequence of three geometric transformations to the given red shape and identify the final result from the options.
THOUGHT 1: To perform the transformations step-by-step, I will visualize the initial shape on a grid. | THOUGHT 2: Next, apply the first transformation: translate the shape 1 unit upwards from its current position. | THOUGHT 3: Now, apply the second transformation: mirror the shape horizontally across a vertical line. | THOUGHT 4: Finally, apply the third transformation: translate the shape 1 unit downwards. This is the final transformed shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Compare the final shape obtained after all transformations with the shapes provided in options A, B, C, and D.
THOUGHT 6: The shape in option D perfectly matches the final transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 15,076 | S5.replay_unsupported | |||||
3bc5edb8dcea45b8 | zebra_tetris | tetris_transform | Fill the exact yellow shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem requires tiling the given yellow shape using pieces from one of the provided options. I need to find the option that perfectly fits the shape.
THOUGHT 1: First, I will isolate the yellow shape on the grid to better visualize its form and size. | THOUGHT 2: The isolated yellow shape is now clear. I will test option A by attempting to fit its pieces into this shape.
THOUGHT 3: I will place the first piece from option A (the green 3-cell piece) into the yellow shape. | THOUGHT 4: Next, I will place the second piece from option A (the maroon 7-cell piece) into the remaining area of the yellow shape. | THOUGHT 5: Finally, I will place the third piece from option A (the red 4-cell piece) into the last remaining space. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from option A perfectly tile the yellow shape without any gaps or overlaps, as shown in the final placement image.
THOUGHT 7: Since option A's pieces completely fill the yellow shape, it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,601 | S5.replay_unsupported | |||||
bd81c08a18ea2567 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: translate 2 down and 2 left, then translate 1 down and 1 left, then mirror horizontally. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial cyan shape and identifying the resulting shape among the options.
THOUGHT 1: I will start by visualizing the initial cyan shape on the grid. | THOUGHT 2: Next, I apply the first transformation: translate the shape 2 units down and 2 units left from its initial position. | THOUGHT 3: Now, I apply the second translation: move the shape 1 unit down and 1 unit left from its position after the first translation. | THOUGHT 4: Finally, I apply the horizontal mirror transformation to the shape from the previous step. This flips the shape across a vertical line. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The image above shows the shape after all transformations have been applied. I need to compare this final shape and its position to the given options.
THOUGHT 6: By comparing the final transformed shape with the shapes in options A, B, C, and D, I can identify the correct result.
THOUGHT 7: Upon visual compa... | train | cc-by-nc-4.0 | procedural_grid | 16,768 | S5.replay_unsupported | |||||
dd7c0c1b471c5972 | zebra_tetris | tetris_transform | Fill the exact cyan shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | C | 1 | 3 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly tile the given cyan shape.
THOUGHT 1: Let's isolate the cyan shape to better analyze its form and the number of cells it occupies. | THOUGHT 2: The isolated shape has 16 cells. Looking at the options, Option C also contains pieces with a total of 16 cells (two 4-cell pieces and two 4-cell pieces). Let's test if Option C fits.
THOUGHT 3: I will attempt to tile the cyan shape using the pieces from Option C. First, place one of the pieces. | THOUGHT 4: Now, place the second piece from Option C next to the first one. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: After placing all four pieces from Option C, they perfectly cover the cyan shape without any gaps or overlaps.
THOUGHT 6: Since the pieces from Option C successfully tiled the shape, and only one option can be correct, Option C is the solution. | train | cc-by-nc-4.0 | procedural_grid | 13,137 | S5.replay_unsupported | ||||
fdea4b3b7b909da9 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: translate 2 left, then translate 2 up, then translate 2 up, then translate 1 right, then mirror horizontally. Choose the option that shows the resulting shape. | null | C | 1 | 6 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial cyan shape and identifying the final result among the options.
THOUGHT 1: Start with the initial shape from the puzzle diagram to visualize the transformation process step-by-step. | THOUGHT 2: Apply the first transformation, translating the shape 2 units to the left. | THOUGHT 3: Next, translate the shape 2 units upward from its current position. | THOUGHT 4: Apply the third translation, moving the shape another 2 units up. | THOUGHT 5: Now, apply the translation of 1 unit to the right. | THOUGHT 6: Finally, perform a horizontal mirror reflection of the shape. | null | Not supported with pagination yet | THOUGHT 7: Compare the resulting shape from the last step with the four options provided in the problem image. The shape in option C matches the final transformed shape exactly. | train | cc-by-nc-4.0 | procedural_grid | 18,821 | S5.replay_unsupported | |||||||
ad8d636d9e6c90af | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the green shape: rotate 90° clockwise, then translate 1 down, then rotate 90° clockwise, then translate 2 right, then translate 2 right. Choose the option that shows the resulting shape. | null | C | 1 | 6 | THOUGHT 0: I will apply the sequence of transformations to the initial green shape step by step.
THOUGHT 1: First, I will visualize the initial green shape from the problem description. | THOUGHT 2: Next, I apply the first transformation: rotate the shape 90° clockwise. | THOUGHT 3: Then, I apply the second transformation: translate the rotated shape 1 unit down. | THOUGHT 4: Now, I apply the third transformation: rotate the shape 90° clockwise again. | THOUGHT 5: Following the sequence, I apply the fourth transformation: translate the shape 2 units to the right. | THOUGHT 6: Finally, I apply the last transformation: translate the shape another 2 units to the right. | null | Not supported with pagination yet | THOUGHT 7: This is the final transformed shape. I will compare it to the given options to find the match.
THOUGHT 8: Comparing the final shape with options A, B, C, and D, I see that option C matches the position and orientation of the transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 21,167 | S5.replay_unsupported | |||||||
98e7f250f5d63f54 | zebra_tetris | tetris_transform | Fill the exact blue shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | D | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options perfectly fills the given blue shape.
THOUGHT 1: First, let's isolate and examine the target blue shape to understand its form and size. | THOUGHT 2: The isolated blue shape has a specific form. Let's test option D, which contains three pieces, to see if they can tile this shape.
THOUGHT 3: Place the first piece from option D onto the blue shape. | THOUGHT 4: Now, place the second piece from option D onto the remaining blue area. | THOUGHT 5: Finally, place the third piece from option D into the last remaining space. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from option D fit perfectly into the blue shape, covering it completely without overlap or gaps.
THOUGHT 7: Since the pieces from option D perfectly tile the blue shape, option D is the correct answer. | train | cc-by-nc-4.0 | procedural_grid | 16,505 | S5.replay_unsupported | |||||
1b1203afc2a08b15 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: scale by 2×, then translate 1 up, then mirror horizontally, then translate 1 up and 2 left. Choose the option that shows the resulting shape. | null | C | 1 | 5 | THOUGHT 0: The problem requires applying a series of geometric transformations to an initial shape and identifying the resulting shape among the options.
THOUGHT 1: I will start by visualizing the initial shape on a grid to perform the transformations step-by-step. | THOUGHT 2: The first transformation is scaling by 2x. This means each dimension of the shape is doubled. | THOUGHT 3: Next, translate the scaled shape 1 unit upwards. | THOUGHT 4: Now, mirror the shape horizontally across a vertical axis. | THOUGHT 5: Finally, translate the mirrored shape 1 unit up and 2 units left. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: The final shape after all transformations is shown in the last image. I will now compare this shape to the given options A, B, C, and D.
THOUGHT 7: Comparing the final shape with the options, option C matches the position and configuration of the cells exactly. | train | cc-by-nc-4.0 | procedural_grid | 18,118 | S5.replay_unsupported | ||||||
4c8fde67a08e2ad5 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: scale by 2×, then translate 2 down and 1 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | B | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of three transformations to the initial cyan shape and identifying the resulting shape from the options.
THOUGHT 1: First, I will visualize the initial shape on a grid to clearly see its structure before transformations. | THOUGHT 2: The image shows the initial cyan shape on a grid. Now, I apply the first transformation: scale by 2x. This doubles the size of the shape. | THOUGHT 3: The second image shows the shape after scaling by 2x. Next, I apply the translation: 2 units down and 1 unit right. | THOUGHT 4: The third image shows the shape after translation. Finally, I apply the rotation: 90° clockwise. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The fourth image displays the shape after the 90° clockwise rotation. This is the final transformed shape.
THOUGHT 6: I will now compare this final transformed shape with the given options A, B, C, and D in the problem image.
THOUGHT 7: Comparing the final shape with the options, option B exactly matches the... | train | cc-by-nc-4.0 | procedural_grid | 16,724 | S5.replay_unsupported | |||||
40db71f444c9255d | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the blue shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the blue shape. | null | D | 1 | 5 | THOUGHT 0: The goal is to find the set of shapes that perfectly fill the grid area not covered by the given blue shape.
THOUGHT 1: First, I will isolate the blue shape from the puzzle grid to clearly see the area it occupies. | THOUGHT 2: The isolated blue shape helps identify the cells that must be excluded. Now, I will determine the target area by highlighting all cells in the grid *except* those occupied by the blue shape. | THOUGHT 3: The target area is the complement of the blue shape. I need to find which option's pieces fit exactly into this area. Let's test option D by placing its pieces.
THOUGHT 4: I will place the first piece from option D onto the target area to see if it fits. | THOUGHT 5: The first piece fits. Now, I will place the second piece from option D into the remaining empty cells. | THOUGHT 6: The second piece also fits. Finally, I will place the third piece from option D to fill the last remaining empty cells. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: All three pieces from option D fit perfectly and completely fill the complement area of the original blue shape.
THOUGHT 8: Since the pieces from option D exactly cover the required area, option D is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,114 | S5.replay_unsupported | ||||||
696cb32fe3463ec7 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: rotate 90° clockwise, then translate 2 left, then translate 1 right. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial red shape and identifying the final position from the given options.
THOUGHT 1: First, I will isolate the initial red shape to clearly see its structure before any transformations are applied. | THOUGHT 2: Next, I will apply the first transformation: rotating the shape 90° clockwise around a pivot point (e.g., the bottom-right cell of the vertical bar). | THOUGHT 3: Now, I will apply the second transformation: translating the rotated shape 2 units to the left. | THOUGHT 4: Finally, I will apply the third transformation: translating the shape 1 unit to the right from its current position. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: This image shows the final position of the shape after all transformations have been applied.
THOUGHT 6: I will now compare this final shape with the four options provided in the problem image.
THOUGHT 7: By comparing the arrangement of the red cells in the final transformed shape to options A, B, C, and D, ... | train | cc-by-nc-4.0 | procedural_grid | 13,618 | S5.replay_unsupported | |||||
2ebb2a51766c7932 | zebra_tetris | tetris_transform | Fill the exact yellow shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | C | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options perfectly tiles the given yellow shape.
THOUGHT 1: First, visualize the precise layout of the yellow shape on the grid. | THOUGHT 2: The image shows the target yellow shape composed of 10 squares.
THOUGHT 3: Examine the options provided and consider how their pieces might fit together to form the yellow shape. Option C contains three pieces.
THOUGHT 4: Attempt to tile the yellow shape using the pieces from option C. Start by placing one o... | THOUGHT 5: The first piece (green) from option C is placed onto the yellow shape.
THOUGHT 6: Place the second piece from option C onto the remaining yellow area. | THOUGHT 7: The second piece (pink) is placed, covering more of the target shape.
THOUGHT 8: Place the third and final piece from option C to see if it completes the yellow shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 9: The third piece (grey) fits perfectly into the remaining area, completely tiling the yellow shape.
THOUGHT 10: Since the pieces from option C perfectly tile the yellow shape without gaps or overlap, option C is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 14,985 | S5.replay_unsupported | |||||
f95c9e3c5c7348bc | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: translate 1 left, then translate 1 left, then translate 2 down and 2 right, then mirror horizontally. Choose the option that shows the resulting shape. | null | C | 1 | 5 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial red shape and identifying the final shape among the options.
THOUGHT 1: First, visualize the starting position of the red shape. | THOUGHT 2: Apply the first transformation: translate the shape 1 unit to the left. | THOUGHT 3: Apply the second transformation: translate the shape another 1 unit to the left. | THOUGHT 4: Apply the third transformation: translate the shape 2 units down and 2 units right. | THOUGHT 5: Apply the final transformation: mirror the shape horizontally. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: Compare the resulting shape after all transformations with the provided options A, B, C, and D.
THOUGHT 7: Option C shows the shape that exactly matches the final transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 16,162 | S5.replay_unsupported | ||||||
abd612c670a81117 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the red shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the red shape. | null | D | 1 | 6 | THOUGHT 0: The problem asks to find the set of pieces that perfectly fill the grid area not covered by the initial red shape.
THOUGHT 1: First, I will focus on the red shape presented in the puzzle grid. | THOUGHT 2: Next, I determine the complement shape, which is the area of the grid not occupied by the red cells. | THOUGHT 3: I will now test option D to see if its pieces can fill the complement shape. I start by placing the first piece from option D. | THOUGHT 4: I continue by placing the second piece from option D into the remaining empty space. | THOUGHT 5: Next, I place the third piece from option D to fill more of the remaining area. | THOUGHT 6: Finally, I place the last piece from option D to see if it completes the complement shape. | null | Not supported with pagination yet | THOUGHT 7: The pieces from option D perfectly fit together to fill the entire area outside the original red shape, confirming it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 21,275 | S5.replay_unsupported | |||||||
635580a25027c4f0 | zebra_tetris | tetris_transform | Fill the exact red shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly tile the given red shape.
THOUGHT 1: I will first isolate the target red shape to better visualize its form and size. | THOUGHT 2: The isolated red shape is shown. It occupies a specific area on the grid.
THOUGHT 3: Let's test Option A by attempting to fit its pieces into the red shape. I will place the first piece. | THOUGHT 4: The first piece from Option A has been placed, covering a portion of the red shape.
THOUGHT 5: Now, I will place the second piece from Option A next to the first one. | THOUGHT 6: The second piece is placed, filling more of the shape.
THOUGHT 7: Finally, I will place the third piece from Option A to complete the shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 8: All three pieces from Option A have been placed and perfectly tile the red shape without any gaps or overlaps. This confirms Option A is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,541 | S5.replay_unsupported | |||||
29e96d3d24d48738 | zebra_tetris | tetris_transform | Fill the exact blue shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | C | 1 | 4 | THOUGHT 0: The problem requires tiling the given blue shape using pieces from one of the option sets.
THOUGHT 1: First, let's isolate and examine the blue shape to understand its dimensions and structure. | THOUGHT 2: The isolated shape has 20 blue cells. We need to find an option set with pieces that sum to 20 cells and can tile this shape. Option C has three pieces: one with 8 cells, one with 6 cells, and one with 6 cells, totaling 20 cells. Let's test Option C.
THOUGHT 3: Place the first piece from Option C (the 6-cell... | THOUGHT 4: Next, place the second piece from Option C (the 8-cell orange piece) into the upper right part of the remaining blue area. | THOUGHT 5: Finally, place the third piece from Option C (the 6-cell red piece) into the remaining blue area at the bottom. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from Option C perfectly tile the blue shape without any gaps or overlaps.
THOUGHT 7: Therefore, Option C is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,626 | S5.replay_unsupported | |||||
809228f83011d86c | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: mirror horizontally, then scale by 2×, then translate 2 up and 2 left. Choose the option that shows the resulting shape. | null | D | 1 | 4 | THOUGHT 0: The problem asks to apply a sequence of three geometric transformations to the initial red shape and identify the final result among the options.
THOUGHT 1: Visualize the initial shape on a grid before applying any transformations. | THOUGHT 2: Apply the first transformation: mirror the shape horizontally across its vertical axis. | THOUGHT 3: Next, apply the second transformation: scale the mirrored shape by a factor of 2 in both horizontal and vertical directions. | THOUGHT 4: Finally, apply the third transformation: translate the scaled shape 2 units up and 2 units left. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Compare the final transformed shape with the provided options A, B, C, and D.
THOUGHT 6: The shape in the final image matches option D. | train | cc-by-nc-4.0 | procedural_grid | 15,054 | S5.replay_unsupported | |||||
c0dd6a84af4c5dac | zebra_tetris | tetris_transform | Fill the exact green shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem asks to identify which set of pieces from the options perfectly fits the green shape in the grid.
THOUGHT 1: Let's focus on the green shape itself to understand its dimensions and structure. | THOUGHT 2: The green shape is composed of 12 squares. Option A consists of three pieces with a total of 12 squares (5 + 4 + 3).
THOUGHT 3: I will now attempt to tile the green shape using the pieces from Option A, starting with the first piece. | THOUGHT 4: Next, I will place the second piece from Option A into the remaining space. | THOUGHT 5: Finally, I will place the third piece from Option A to see if it completes the shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: The three pieces from Option A successfully tile the entire green shape without any gaps or overlaps.
THOUGHT 7: Based on the successful tiling, Option A is confirmed as the correct set of pieces. | train | cc-by-nc-4.0 | procedural_grid | 14,919 | S5.replay_unsupported | |||||
474f4b73a333bee1 | zebra_tetris | tetris_transform | Fill the exact red shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The goal is to determine which set of pieces from the options perfectly fills the given red shape in the puzzle grid.
THOUGHT 1: First, let's focus on the target red shape itself to understand its configuration and size. | THOUGHT 2: The red shape is clearly defined. It consists of 12 individual squares. We need to find an option where the pieces combine to form this shape. Option A contains pieces with 3, 4, and 5 squares, totaling 12 squares. Let's attempt to tile the shape with these pieces.
THOUGHT 3: Let's begin placing the pieces f... | THOUGHT 4: The first piece is now placed. Next, we will fit the 4-square piece from Option A into the remaining area of the red shape. | THOUGHT 5: With the second piece in place, let's now fit the final piece from Option A, the 5-square piece, into the last remaining space. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from Option A have been successfully placed, completely filling the red shape without any gaps or overlaps.
THOUGHT 7: Since Option A's pieces perfectly tile the red shape, it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 16,623 | S5.replay_unsupported | |||||
adbfca18bdf93c5b | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: mirror horizontally, then translate 2 up and 2 left, then translate 2 up and 1 right. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the given shape and identifying the final result among the options.
THOUGHT 1: First, visualize the initial cyan shape on a grid to track its position and form. | THOUGHT 2: Apply the first transformation: mirror the shape horizontally. | THOUGHT 3: Next, apply the second transformation: translate the mirrored shape 2 units up and 2 units left. | THOUGHT 4: Finally, apply the third transformation: translate the shape 2 units up and 1 unit right from its current position. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The image above shows the final position and form of the shape after all transformations.
THOUGHT 6: Compare the final transformed shape to the given options (A, B, C, D) to find the exact match.
THOUGHT 7: Option C shows the shape in the correct final position and orientation. | train | cc-by-nc-4.0 | procedural_grid | 13,553 | S5.replay_unsupported | |||||
c74735d4c816d768 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the green shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the green shape. | null | B | 1 | 6 | THOUGHT 0: The problem asks to identify the set of pieces that perfectly fill the grid area not covered by the initial green shape.
THOUGHT 1: First, identify the initial green shape on the grid. | THOUGHT 2: Next, determine the area of the grid that is NOT covered by the green shape. This is the target area to be filled. | THOUGHT 3: Now, examine the options to find which set of pieces exactly fits the empty area identified in the previous step.
THOUGHT 4: Let's test option B by placing the first piece into the empty region. | THOUGHT 5: Continue placing the second piece from option B into the remaining empty space. | THOUGHT 6: Place the third piece from option B to fill more of the target area. | THOUGHT 7: Finally, place the fourth piece from option B to see if it completes the empty region. | null | Not supported with pagination yet | THOUGHT 8: After placing all pieces from option B, they perfectly fill the area not occupied by the original green shape.
THOUGHT 9: Option B's pieces precisely match the complement of the green shape, confirming it as the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 23,649 | S5.replay_unsupported | |||||||
d3b01440681818a5 | zebra_tetris | tetris_transform | Fill the exact orange shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | B | 1 | 3 | THOUGHT 0: The problem requires finding which set of given pieces perfectly fits the orange shape in the grid.
THOUGHT 1: Let's first clearly visualize the target shape we need to tile. | THOUGHT 2: The image shows the specific cells that form the orange shape within the grid.
THOUGHT 3: Examine the options provided to find a set of pieces that appears to match the area and configuration of the orange shape. Option B looks promising.
THOUGHT 4: Place the first piece from Option B onto the orange shape t... | THOUGHT 5: The first piece (dark red) covers a portion of the orange shape accurately.
THOUGHT 6: Next, place the second piece from Option B into the remaining orange area. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: The second piece (pink) fits perfectly next to the first piece, covering more of the target shape.
THOUGHT 8: The last piece from Option B (yellow) fits precisely into the final remaining cell of the orange shape.
THOUGHT 9: All pieces from Option B tile the orange shape completely and exactly, confirming it... | train | cc-by-nc-4.0 | procedural_grid | 13,173 | S5.replay_unsupported | ||||
0626a4d2d27292d2 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: rotate 90° clockwise, then translate 1 down and 1 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | D | 1 | 4 | THOUGHT 0: The problem asks to apply a sequence of three transformations to the initial cyan shape and identify the final result from the given options.
THOUGHT 1: First, let's visualize the initial shape on the grid to understand its position and orientation. | THOUGHT 2: Now, apply the first transformation: rotate the shape 90° clockwise around a pivot point (e.g., the bottom right cell of the initial shape). | THOUGHT 3: Next, apply the second transformation: translate the rotated shape 1 unit down and 1 unit right. | THOUGHT 4: Finally, apply the third transformation: rotate the translated shape 90° clockwise. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Compare this final transformed shape with the options provided in the problem image.
THOUGHT 6: The final shape matches option D exactly. | train | cc-by-nc-4.0 | procedural_grid | 13,525 | S5.replay_unsupported | |||||
bc8d7143a68c21df | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: translate 1 down, then mirror horizontally, then translate 1 left. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of three geometric transformations to the initial red shape shown in the puzzle grid and identifying the final shape among the given options.
THOUGHT 1: First, I will represent the initial red shape from the puzzle grid to clearly visualize its starting position. | THOUGHT 2: This image shows the initial shape on a grid, which will be the starting point for the transformations.
THOUGHT 3: Next, I apply the first transformation: translate the shape 1 unit down. | THOUGHT 4: This image shows the shape after it has been moved one square downwards.
THOUGHT 5: Now, I apply the second transformation: mirror the shape horizontally. | THOUGHT 6: This image depicts the shape after it has been mirrored across a vertical axis.
THOUGHT 7: Finally, I apply the third transformation: translate the shape 1 unit left. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 8: This image shows the shape after the final translation, completing the sequence of transformations.
THOUGHT 9: I will now compare this final transformed shape with the provided options (A, B, C, D) to find the exact match. The shape in the last image matches option C. | train | cc-by-nc-4.0 | procedural_grid | 13,646 | S5.replay_unsupported | |||||
ac3e65952d20b356 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the yellow shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the yellow shape. | null | C | 1 | 6 | THOUGHT 0: The problem asks to identify the set of pieces that perfectly fill the grid area not occupied by the initial yellow shape.
THOUGHT 1: First, I need to isolate the initial yellow shape from the puzzle grid to clearly see its form and position. | THOUGHT 2: Based on the initial shape, I can determine the complement area within the grid that needs to be filled. This is the area not covered by the yellow cells. | THOUGHT 3: The goal is to find which option provides pieces that can tile this black area perfectly. I will test option C.
THOUGHT 4: I will place the first piece from option C (the orange piece) into the target area. | THOUGHT 5: Next, I will place the second piece from option C (the green piece) into the remaining unfilled area. | THOUGHT 6: Then, I will place the third piece from option C (the yellow piece) into the next available space. | THOUGHT 7: Finally, I will place the fourth piece from option C (the maroon piece) to complete the tiling. | null | Not supported with pagination yet | THOUGHT 8: The pieces from option C successfully and completely fill the complement of the original yellow shape, covering all the black cells.
THOUGHT 9: Since option C's pieces perfectly tile the required area, it is the correct answer. | train | cc-by-nc-4.0 | procedural_grid | 23,738 | S5.replay_unsupported | |||||||
f3a1805959b68b61 | zebra_tetris | tetris_transform | Fill the exact yellow shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options perfectly tiles the given yellow shape.
THOUGHT 1: First, let's clearly see the yellow shape that needs to be tiled. | THOUGHT 2: The visual confirms the target yellow shape. Now, I will examine the piece sets provided in the options.
THOUGHT 3: Option A consists of three pieces. I will attempt to tile the yellow shape using these pieces. Let's place the first piece. | THOUGHT 4: The first piece (grey) fits into the right side of the shape. Now, let's place the second piece from Option A. | THOUGHT 5: The second piece (maroon) fits into the top left part. Let's place the third piece from Option A. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All three pieces from Option A (grey, maroon, and blue) perfectly tile the yellow shape without gaps or overlap.
THOUGHT 7: Since Option A's pieces completely fill the shape, it is the correct solution. Other options would not fit. | train | cc-by-nc-4.0 | procedural_grid | 13,384 | S5.replay_unsupported | |||||
a0324ab129223ac7 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: rotate 90° clockwise, then translate 1 down, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial red shape and identifying the final result among the options.
THOUGHT 1: First, visualize the initial shape on the grid. | THOUGHT 2: The first image shows the starting shape. Apply the first transformation: rotate the shape 90° clockwise. | THOUGHT 3: The second image shows the shape after the first rotation. Now, apply the translation: move the shape 1 unit down. | THOUGHT 4: The third image shows the shape after the translation. Apply the final transformation: rotate the shape 90° clockwise again. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The fourth image shows the shape after all transformations are applied.
THOUGHT 6: Compare the final shape with the given options to find the correct match.
THOUGHT 7: Comparing the final shape with the options, option C is an exact match. | train | cc-by-nc-4.0 | procedural_grid | 16,662 | S5.replay_unsupported | |||||
16d3d83d093a2c93 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the cyan shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the cyan shape. | null | B | 1 | 5 | THOUGHT 0: The problem asks to identify the set of pieces that perfectly fill the area of the grid not covered by the given cyan shape.
THOUGHT 1: First, I will isolate the cyan shape from the puzzle grid to clearly see the area it occupies. | THOUGHT 2: Now I will determine the area of the grid that is empty, which is the complement of the cyan shape. | THOUGHT 3: I need to find which option provides pieces that fit exactly into this empty area. Let's test option B by placing its pieces.
THOUGHT 4: I will place the first piece from option B into the empty area. | THOUGHT 5: Next, I will place the second piece from option B into the remaining empty space. | THOUGHT 6: Finally, I will place the third piece from option B to see if it completes the empty area. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: All three pieces from option B perfectly fill the area not occupied by the original cyan shape. | train | cc-by-nc-4.0 | procedural_grid | 20,165 | S5.replay_unsupported | ||||||
c741200c9eca373f | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: mirror horizontally, then translate 2 down, then translate 2 down, then translate 1 down, then translate 1 up and 1 left. Choose the option that shows the resulting shape. | null | B | 1 | 6 | THOUGHT 0: The problem asks to apply a series of geometric transformations to the given red shape and identify the final position and orientation from the options.
THOUGHT 1: I will start with the initial red shape shown in the puzzle section of the problem image. | THOUGHT 2: First, I apply a horizontal mirror transformation to the shape. | THOUGHT 3: Next, I translate the mirrored shape 2 units down. | THOUGHT 4: Then, I translate the shape another 2 units down. | THOUGHT 5: After that, I translate the shape 1 unit down. | THOUGHT 6: Finally, I apply the last transformation: translate 1 unit up and 1 unit left. | null | Not supported with pagination yet | THOUGHT 7: I will now compare the final transformed shape with the provided options (A, B, C, D) in the problem image to find the matching one.
THOUGHT 8: Comparing the final shape from the last step with the options, option B matches the position and arrangement of the red squares exactly. | train | cc-by-nc-4.0 | procedural_grid | 23,546 | S5.replay_unsupported | |||||||
b776a28f831fa806 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: scale by 2×, then mirror horizontally, then translate 2 up and 1 left. Choose the option that shows the resulting shape. | null | C | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of three geometric transformations to the initial orange shape: scaling, mirroring, and translating.
THOUGHT 1: I will visualize the original shape on a grid to prepare for the transformations. | THOUGHT 2: The first step is to scale the shape by 2x. This doubles the size in both dimensions. | THOUGHT 3: Next, the scaled shape is mirrored horizontally. This reflects the shape across a vertical line. | THOUGHT 4: Finally, the shape is translated 2 units up and 1 unit left. This shifts the shape's position on the grid. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The final transformed shape is shown in the last image. I need to compare this shape to the options in the problem image.
THOUGHT 6: Comparing the final shape with options A, B, C, and D, option C is an exact match. | train | cc-by-nc-4.0 | procedural_grid | 16,677 | S5.replay_unsupported | |||||
2b17b0d9e997348d | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | D | 1 | 6 | THOUGHT 0: The problem asks to identify the set of pieces that perfectly fill the grid area not occupied by the magenta shape. First, isolate the magenta shape from the puzzle grid. | THOUGHT 1: Identify the complement shape, which is the area of the grid not covered by the magenta shape. This is the target area to be filled. | THOUGHT 2: The task is to find which set of pieces from the options can exactly fill the empty white cells shown in the previous image.
THOUGHT 3: Test option D by placing its pieces into the complement area. Begin by placing the orange piece. | THOUGHT 4: Continue placing the pieces from option D. Place the red piece next. | THOUGHT 5: Add the green piece from option D to the arrangement. | THOUGHT 6: Finally, place the blue piece from option D. | null | Not supported with pagination yet | THOUGHT 7: The pieces from option D completely fill the area that was not occupied by the original magenta shape.
THOUGHT 8: Therefore, option D is the correct set of pieces that fills the complement of the magenta shape. | train | cc-by-nc-4.0 | procedural_grid | 23,558 | S5.replay_unsupported | |||||||
07d3867376284985 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the red shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the red shape. | null | A | 1 | 5 | THOUGHT 0: The goal is to find which set of pieces from the options can perfectly fill the grid area not occupied by the red shape.
THOUGHT 1: First, I need to clearly see the red shape that is already in the grid. | THOUGHT 2: Now I need to identify the exact area of the grid that is *not* covered by the red shape. This is the space that needs to be filled. | THOUGHT 3: I will test Option A to see if its pieces can fill the white space shown in the previous image. Option A has three pieces.
THOUGHT 4: Let's place the first piece from Option A (the orange one) into the complement area. | THOUGHT 5: Next, I will place the second piece from Option A (the green one) into the remaining empty space. | THOUGHT 6: Finally, I place the third piece from Option A (the light blue one) into the last empty section. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 7: The three pieces from Option A successfully fill the entire area that was not occupied by the original red shape.
THOUGHT 8: This confirms that the pieces in Option A are exactly the cells not occupied by the red shape. | train | cc-by-nc-4.0 | procedural_grid | 17,998 | S5.replay_unsupported | ||||||
a26b33f1ec183b60 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the magenta shape: mirror horizontally, then translate 2 down, then translate 1 down and 1 left. Choose the option that shows the resulting shape. | null | B | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of three transformations to the given magenta shape and identifying the final position and orientation from the options.
THOUGHT 1: First, visualize the initial shape on the grid. | THOUGHT 2: The image shows the initial shape. Now, apply the first transformation: mirror horizontally. | THOUGHT 3: The image displays the shape after mirroring horizontally. Next, apply the second transformation: translate 2 units down. | THOUGHT 4: The image shows the shape after translating 2 units down. Finally, apply the third transformation: translate 1 unit down and 1 unit left. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The image shows the final transformed shape. Compare this resulting shape with the given options.
THOUGHT 6: Option B matches the final transformed shape exactly. | train | cc-by-nc-4.0 | procedural_grid | 16,679 | S5.replay_unsupported | |||||
3a642cce06dfee93 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | A | 1 | 6 | THOUGHT 0: The goal is to find the set of shapes that perfectly fill the grid area not covered by the initial magenta shape.
THOUGHT 1: First, I need to clearly visualize the original magenta shape within the grid. | THOUGHT 2: The image shows the magenta shape isolated. Now I need to determine the area of the grid that is *not* covered by this shape. | THOUGHT 3: This image highlights the area to be filled (the complement). I must now find which option's pieces can tile this specific area.
THOUGHT 4: Let's test option A by placing its first piece (gray) onto the target area. | THOUGHT 5: The gray piece fits. Now I will place the second piece from option A (yellow) next to the first piece. | THOUGHT 6: The yellow piece also fits. I will now place the third piece from option A (orange) into the remaining space. | THOUGHT 7: The orange piece fits as well. Finally, I will place the fourth piece from option A (green) to complete the area. | null | Not supported with pagination yet | THOUGHT 8: All four pieces from option A fit perfectly into the complement area, filling the entire grid except for the original magenta shape.
THOUGHT 9: By visually comparing the filled complement area with the pieces provided in option A, they match exactly. | train | cc-by-nc-4.0 | procedural_grid | 23,682 | S5.replay_unsupported | |||||||
3baabd0cd20753e1 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the yellow shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the yellow shape. | null | D | 1 | 6 | THOUGHT 0: The goal is to find which set of pieces from the options perfectly fills the grid area not occupied by the yellow shape.
THOUGHT 1: First, identify the specific cells that form the yellow shape within the grid. | THOUGHT 2: Next, determine the complement shape, which includes all grid cells not part of the yellow shape. This is the area to be filled. | THOUGHT 3: Now, test option D by attempting to fit its pieces into the complement area. Place the first piece. | THOUGHT 4: Continue placing the second piece from option D into the remaining empty cells. | THOUGHT 5: Add the third piece from option D to fill more of the remaining space. | THOUGHT 6: Place the fourth and final piece from option D to complete the filling of the complement area. | null | Not supported with pagination yet | THOUGHT 7: The pieces from option D successfully and completely fill the area outside the original yellow shape, confirming it is the correct set of pieces. | train | cc-by-nc-4.0 | procedural_grid | 23,698 | S5.replay_unsupported | |||||||
0016372cd4e8d7bd | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the yellow shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the yellow shape. | null | A | 1 | 7 | THOUGHT 0: The problem asks us to find the set of pieces that perfectly fill the grid area not covered by the initial yellow shape.
THOUGHT 1: First, I will isolate the initial yellow shape from the grid to clearly see the area it occupies. | THOUGHT 2: The image shows the yellow shape. Now I need to identify the complementary area, which is the part of the grid that is not yellow. | THOUGHT 3: The image displays the grid with the yellow shape highlighted. The black cells represent the area we need to fill. I will now check which option's pieces can fill this black area.
THOUGHT 4: I will start by placing the first piece from option A into the empty region of the grid. | THOUGHT 5: The first piece from option A is placed, covering some of the empty cells. Next, I will place the second piece from option A. | THOUGHT 6: The second piece is now placed. I will continue by adding the third piece from option A to the remaining empty cells. | THOUGHT 7: With the third piece placed, I will now add the fourth piece from option A to see if it fits the remaining space. | THOUGHT 8: The fourth piece is placed, filling more of the area. Finally, I will place the fifth and last piece from option A. | THOUGHT 9: All five pieces from option A have been placed. The visual shows that they perfectly fill the entire grid area that was not occupied by the original yellow shape.
THOUGHT 10: Since option A's pieces completely fill the required area, it is the correct solution. Other options would not fit this specific shape... | train | cc-by-nc-4.0 | procedural_grid | 24,298 | S5.replay_unsupported | ||||||||
4ed06f0d5693079b | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the yellow shape: translate 1 left, then translate 1 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | A | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of three geometric transformations to the initial yellow shape and identifying the final configuration among the given options.
THOUGHT 1: I will start by visualizing the initial shape on the grid provided in the puzzle. | THOUGHT 2: Next, I apply the first transformation, which is to translate the shape 1 unit to the left. I will visualize the shape's new position. | THOUGHT 3: Now, I apply the second transformation, translating the shape 1 unit to the right from its current position. I visualize the shape after this step. | THOUGHT 4: Finally, I apply the third transformation, rotating the shape 90° clockwise around a pivot point (e.g., the bottom-most cell of the vertical segment). I visualize the final transformed shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The final step is to compare the resulting shape from the transformations with the four answer options (A, B, C, and D) provided in the problem image to find the exact match. | train | cc-by-nc-4.0 | procedural_grid | 16,701 | S5.replay_unsupported | |||||
f3f109b81d8f727e | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: rotate 90° clockwise, then translate 2 up and 1 right, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | A | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of transformations to an initial orange shape and identifying the final result among the options.
THOUGHT 1: First, visualize the initial orange shape on the grid. | THOUGHT 2: The image shows the starting shape. Now, apply the first transformation: rotate the shape 90° clockwise. | THOUGHT 3: The image shows the shape after the first rotation. Next, apply the translation: move the shape 2 units up and 1 unit right. | THOUGHT 4: The image shows the shape after the translation. Finally, apply the second rotation: rotate the shape 90° clockwise again. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: The image shows the final transformed shape. Compare this shape to the provided options A, B, C, and D to find the match. | train | cc-by-nc-4.0 | procedural_grid | 15,061 | S5.replay_unsupported | |||||
28dfcd1696bddf40 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | A | 1 | 6 | THOUGHT 0: The goal is to identify the set of cells in the grid that are not part of the given magenta shape and find the option that represents this set of cells.
THOUGHT 1: First, I need to isolate the magenta shape within the grid provided in the puzzle. | THOUGHT 2: The image shows the magenta shape clearly defined on the grid. Next, I will determine the cells that are *not* part of this shape. This is the complement area. | THOUGHT 3: The image now highlights all cells in the grid except for the original magenta shape. I need to find which option's pieces can perfectly fill this area.
THOUGHT 4: I will examine option A and attempt to place its first piece into the complement area. | THOUGHT 5: The first piece from option A is placed. Now I will place the second piece from option A to continue filling the complement area. | THOUGHT 6: The second piece is placed. I will now place the third piece from option A into the remaining space. | THOUGHT 7: The third piece is placed. Finally, I will place the fourth piece from option A to see if it completes the area. | null | Not supported with pagination yet | THOUGHT 8: After placing all four pieces from option A, the entire complement area is filled without overlap.
THOUGHT 9: Option A's pieces perfectly fill the grid cells not occupied by the original magenta shape. Therefore, option A is the correct set of cells. | train | cc-by-nc-4.0 | procedural_grid | 23,870 | S5.replay_unsupported | |||||||
fd8c13b5e4f7fd5c | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the red shape: translate 2 up and 1 left, then mirror horizontally, then translate 2 down and 1 left, then translate 2 up and 2 right. Choose the option that shows the resulting shape. | null | D | 1 | 5 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to an initial shape and identifying the final resulting shape among the given options.
THOUGHT 1: To track the changes accurately, I will visualize the initial shape on a grid before applying any transformations. | THOUGHT 2: First, translate the shape 2 units up and 1 unit left from its initial position. | THOUGHT 3: Next, mirror the translated shape horizontally. | THOUGHT 4: Then, translate the mirrored shape 2 units down and 1 unit left. | THOUGHT 5: Finally, translate the shape 2 units up and 2 units right. This is the final position. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: Comparing the final shape shown in the last image with the options provided, I can determine the correct answer. | train | cc-by-nc-4.0 | procedural_grid | 20,068 | S5.replay_unsupported | ||||||
c429d59e9f88091a | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the cyan shape: mirror horizontally, then translate 1 left, then translate 2 up and 1 left. Choose the option that shows the resulting shape. | null | B | 1 | 4 | THOUGHT 0: The problem requires applying a sequence of geometric transformations to the initial cyan shape shown in the puzzle grid and identifying the resulting shape among the options.
THOUGHT 1: I will visualize the initial shape on a grid to track the transformations step-by-step. | THOUGHT 2: The first image shows the starting cyan shape on a grid, ready for transformation.
THOUGHT 3: Apply the first transformation: mirror the shape horizontally. | THOUGHT 4: The second image shows the shape after it has been mirrored horizontally.
THOUGHT 5: Apply the second transformation: translate the shape 1 unit to the left. | THOUGHT 6: The third image shows the shape after translating 1 unit left from the previous step.
THOUGHT 7: Apply the final transformation: translate the shape 2 units up and 1 unit left. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 8: The fourth image shows the final position and orientation of the shape after all transformations.
THOUGHT 9: Compare the final shape shown in the last image with the shapes in options A, B, C, and D from the problem image.
THOUGHT 10: Option B is an exact match for the final transformed shape. | train | cc-by-nc-4.0 | procedural_grid | 13,640 | S5.replay_unsupported | |||||
75da25ae707499ea | zebra_tetris | tetris_transform | Fill the exact magenta shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | A | 1 | 4 | THOUGHT 0: The problem requires tiling a specific magenta shape on a grid using a set of pieces provided in one of the options. I need to find the option that perfectly fits the shape.
THOUGHT 1: To analyze the shape and potential tiling, I will isolate the magenta shape from the grid. | THOUGHT 2: The isolated magenta shape consists of 16 cells. I will examine the options to find a set of pieces that also total 16 cells and appear to fit the shape. Option A contains pieces that look promising.
THOUGHT 3: I will attempt to tile the magenta shape using the pieces from Option A. First, I will place the b... | THOUGHT 4: Next, I will place the yellow piece from Option A into the remaining space. | THOUGHT 5: Finally, I will place the red piece from Option A to complete the tiling. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All pieces from Option A fit perfectly into the magenta shape without any gaps or overlaps. This confirms that Option A is the correct solution.
THOUGHT 7: The tiling process shows that only the pieces in Option A can completely cover the target shape. | train | cc-by-nc-4.0 | procedural_grid | 16,568 | S5.replay_unsupported | |||||
df05bb5ac9d4b87b | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: rotate 90° clockwise, then translate 2 up, then translate 1 down, then translate 2 down and 1 left. Choose the option that shows the resulting shape. | null | B | 1 | 5 | THOUGHT 0: The problem asks to apply a series of transformations to an initial shape and identify the final position and orientation from the given options.
THOUGHT 1: I will first isolate the initial orange shape from the problem image to track its transformations step-by-step. | THOUGHT 2: The first step is to rotate the shape 90° clockwise. The image shows the shape after this rotation. | THOUGHT 3: Next, I translate the rotated shape 2 units upwards from its current position. The image displays the shape after this translation. | THOUGHT 4: The third transformation is to translate the shape 1 unit downwards. This image shows the result of moving the shape down by one unit. | THOUGHT 5: The final transformation is to translate the shape 2 units down and 1 unit left. This image represents the final position and orientation of the shape after all steps. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: Now I will compare the final shape shown in the last image to the options provided in the original problem image to find the matching result. | train | cc-by-nc-4.0 | procedural_grid | 18,175 | S5.replay_unsupported | ||||||
82f409959bca495f | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the cyan shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the cyan shape. | null | B | 1 | 5 | THOUGHT 0: The goal is to identify the set of shapes that perfectly fill the grid area not covered by the initial cyan shape.
THOUGHT 1: First, I need to clearly identify the specific cells occupied by the cyan shape in the grid. | THOUGHT 2: This image isolates the cyan shape, showing the exact cells it occupies.
THOUGHT 3: Next, I need to determine the complement area, which is the entire grid excluding the cyan shape. | THOUGHT 4: This image shows the target area to be filled by pieces from the options.
THOUGHT 5: Now I will check the options to see which set of pieces can exactly cover this target area.
THOUGHT 6: Let's test option B by placing its first piece onto the target area. | THOUGHT 7: The first piece of option B fits correctly into a part of the complement area.
THOUGHT 8: Now, I will place the second piece from option B into the remaining space. | THOUGHT 9: The second piece also fits perfectly into the unfilled region.
THOUGHT 10: Finally, I will place the third piece from option B. | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 11: The third piece completes the filling of the entire complement area.
THOUGHT 12: Since the pieces from option B exactly fill the area outside the original cyan shape, option B is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 20,100 | S5.replay_unsupported | ||||||
4207578357001ade | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the orange shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the orange shape. | null | B | 1 | 7 | THOUGHT 0: The problem asks to identify the set of pieces that fill the grid excluding the initial orange shape.
THOUGHT 1: First, I need to isolate the initial orange shape from the grid to clearly see the area to be filled. | THOUGHT 2: Based on the isolated orange shape, I can determine the area that needs to be filled, which is the complement of the orange shape in the grid. | THOUGHT 3: Now I need to find which set of pieces from the options can perfectly fill the area shown in the second image. I will test option B.
THOUGHT 4: I will place the first piece from option B (the grey 2x2 square) into the target area to see if it fits. | THOUGHT 5: Next, I will place the second piece from option B (the orange 2x3 rectangle) into the remaining empty space. | THOUGHT 6: I will continue by placing the third piece from option B (the pink 2x3 rectangle) into the next available space. | THOUGHT 7: Now, I will place the fourth piece from option B (the yellow 1x2 rectangle) into the remaining empty cells. | THOUGHT 8: Finally, I will place the last piece from option B (the maroon 1x2 rectangle) into the last two empty cells. | THOUGHT 9: All pieces from option B successfully fill the complement of the original orange shape, covering the entire grid except for the initial orange cells.
THOUGHT 10: Since option B's pieces perfectly tile the required area, it is the correct solution. | train | cc-by-nc-4.0 | procedural_grid | 21,638 | S5.replay_unsupported | ||||||||
f33339c920aa6dc0 | zebra_tetris | tetris_transform | Apply the following sequence of transformations to the orange shape: rotate 90° clockwise, then translate 1 left, then rotate 90° clockwise. Choose the option that shows the resulting shape. | null | B | 1 | 4 | THOUGHT 0: The problem asks to apply a sequence of three transformations to the given orange shape and identify the final shape among the options.
THOUGHT 1: I will start by visualizing the initial orange shape on a grid to track the transformations step-by-step. | THOUGHT 2: The first transformation is a 90° clockwise rotation of the initial shape. The visual shows the shape after this rotation. | THOUGHT 3: Next, the shape is translated 1 unit to the left. The image below shows the result of this translation. | THOUGHT 4: The final transformation is another 90° clockwise rotation. This image displays the shape after the second rotation. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 5: Now I will compare the final transformed shape from the last step to the provided options (A, B, C, D) to find the matching one. | train | cc-by-nc-4.0 | procedural_grid | 13,528 | S5.replay_unsupported | |||||
d7d3d186df85fdfb | zebra_tetris | tetris_transform | Fill the exact red shape shown in the question grid. Choose the only option set whose pieces perfectly tile the shape without gaps or overlap. | null | D | 1 | 4 | THOUGHT 0: The problem asks to find which set of pieces from the options can perfectly tile the given red shape.
THOUGHT 1: First, let's focus on the red shape itself to understand its form and size. | THOUGHT 2: Observing the red shape, we can see it occupies a specific area on the grid. We need to find an option whose pieces fit this area precisely. Option D appears to be a potential candidate.
THOUGHT 3: Let's test option D by placing its first piece onto the red shape. | THOUGHT 4: Now, let's place the second piece from option D next to the first one. | THOUGHT 5: Finally, let's place the third piece from option D to complete the shape. | null | Not supported with pagination yet | null | Not supported with pagination yet | null | Not supported with pagination yet | THOUGHT 6: All pieces from option D have been placed and they perfectly fill the red shape without any gaps or overlaps.
THOUGHT 7: Since the pieces from option D successfully tiled the red shape, option D is the correct answer. | train | cc-by-nc-4.0 | procedural_grid | 16,541 | S5.replay_unsupported | |||||
67583604105a4f28 | zebra_tetris | tetris_transform | Fill the entire grid EXCEPT for the magenta shape shown in the puzzle. Pick the option that consists of exactly all cells not occupied by the magenta shape. | null | A | 1 | 6 | THOUGHT 0: The goal is to identify the shape that fills the grid excluding the given magenta shape. This requires finding the complement of the magenta shape within the grid.
THOUGHT 1: First, I will isolate the magenta shape from the puzzle grid to clearly see its form. | THOUGHT 2: The image shows the magenta shape. Now I will determine the cells that are NOT part of this shape within the grid, representing the area to be filled. | THOUGHT 3: The image displays the complement shape (all cells except the magenta ones). I need to find which option provides pieces that perfectly tile this complement shape.
THOUGHT 4: Let's test option A by placing its first piece onto the complement shape. | THOUGHT 5: The first piece of option A fits. Now I will place the second piece from option A to see if it covers more of the remaining area. | THOUGHT 6: The second piece also fits. Next, I will place the third piece from option A into the remaining space. | THOUGHT 7: The third piece fits as well. Finally, I will place the fourth piece from option A to complete the shape. | null | Not supported with pagination yet | THOUGHT 8: All four pieces from option A have been placed and they exactly fill the complement shape.
THOUGHT 9: Option A successfully tiles the entire area not occupied by the original magenta shape. Therefore, option A is the correct set of pieces. | train | cc-by-nc-4.0 | procedural_grid | 21,271 | S5.replay_unsupported |
Spatial MMCoT v1 · zebra_tetris
Zebra-CoT Tetris: polyomino puzzles of three kinds: apply a sequence of transformations to a shape, tile a shape with a set of pieces, and fill the grid outside a shape. The options are drawn in the input image, so the answer is a letter. Each step has its own target image: transformation puzzles start with a redraw of the start shape, then one image per transformation; tiling puzzles start with the isolated shape, fill-the-complement puzzles with the isolated shape and then its complement, and both then add one image per placed piece. All three kinds carry one task name, and no column tells them apart; the question's first words do (Apply the following sequence of transformations, Fill the exact <colour> shape, Fill the entire grid EXCEPT). The task table, the S13 balancing and the text-only baselines below pool the three kinds. The thoughts are upstream's text and were not checked against the images (see Known issues). Released rows carry 3 to 7 target images. The thoughts keep upstream's numbered labels ('THOUGHT 0:', 'THOUGHT 1:', ...) inside <think>. They count upstream's thoughts across the whole trace, not the row's slots, so one slot often holds two or more labelled thoughts, and a slot after a target image can open with the unlabelled end of the previous thought. No other source in this release has these labels; if you mix sources and do not want a model to learn them, remove them with re.sub(r'THOUGHT \d+:\s*', '', text). Refused by the conversion's checks: 1 row whose read-back is empty (S0.empty_readback).
Supervision kind (supervision_kind in meta): full_interleaved on every row: the upstream trace itself interleaves text and target images (drawn or rendered states on most sources; the source note above says which), and the read-back comes after the target image it reads. The text is upstream's and was not checked against the images.
Upstream: multimodal-reasoning-lab/Zebra-CoT. Licence: cc-by-nc-4.0. Changes from upstream: every image is decoded and re-encoded as JPEG, inputs at a 512 px long edge and targets at the size in meta.target_px (upstream's own size, at most 512 px; smaller on rows flagged S9.px=*); the image placeholders in the question and the reasoning were removed and the sentence around each repaired, sometimes by inserting words such as 'the image'; the reasoning is split into one thought per target; the ThinkMorph system prompt is prepended to the question; rows were filtered and balanced as described below.
Known issues
Rows with a measured per-row problem are listed in reports/known_issues/, one TSV per issue (a # <description> line, then row_uid<TAB>split<TAB>detail lines), so they can be filtered out. They are still in this release: no row was removed for these issues.
| issue | rows | train | validation | what | how it was found | file |
|---|---|---|---|---|---|---|
plan_names_answer_before_pieces |
4,988 | 4,827 | 161 | Tiling / fill-the-complement puzzle: the plan names the correct option before any of its pieces is drawn and no other option is tried; the piece images only confirm a choice already made in text. | question starts 'Fill the exact' (tiling; first piece is target_1) or 'Fill the entire grid EXCEPT' (complement; first piece is target_2), and after removing enumerations the thoughts up to that piece's plan name 'option/set/choice <answer>'; measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/plan_names_answer_before_pieces.tsv |
translation_clips_cells |
2,242 | 2,159 | 83 | Transformation puzzle: a translation step pushes part of the shape off the grid and upstream drops those cells, so the target after it shows fewer cells than the image before it while the thought describes a plain move. | question starts 'Apply the following sequence'; target_0 is the start shape and target_j the result of transformation j; for a 'translate' step, target_j has fewer coloured cells than target_j-1 (HSV S>90, V>70, cell-sized 4-connected components; the same count is unchanged on 3,883 of 3,884 rotations and 2,452 of 2,453 mirrors on r2); measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/translation_clips_cells.tsv |
shape_cell_count_contradicts_image |
1,089 | 1,052 | 37 | Tiling puzzle: the thought right after the isolated-shape image states a cell count for the shape that the image contradicts (almost always too few), so the row teaches a wrong read of an image the model has just drawn. | question starts 'Fill the exact'; the first 'consists of / occupies / has ... N cells|squares' in thought_1 differs from the coloured cells counted in target_0 (HSV S>90, V>70, cell-sized 4-connected components); measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/shape_cell_count_contradicts_image.tsv |
readback_names_no_option |
951 | 914 | 37 | The final thought never says which option matches (it only announces a comparison); the choice is only in <answer>. | after removing enumerations ('options A, B, C and D', 'A-D'), the read-back names no option: no 'option/choice/set/piece/answer X', no 'is X.', no quoted '(X)'/'X', no 'the second option'; measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/readback_names_no_option.tsv |
target_repeats_previous_target |
541 | 531 | 10 | Transformation puzzle: a target is byte-identical to the image before it while the plan says the shape moves (upstream does not apply a translation that would push the shape off the grid, and mirrors a symmetric shape onto itself). | md5 of target j equals md5 of target j-1; measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/target_repeats_previous_target.tsv |
validation_target_identical_to_train |
34 | 0 | 34 | A target of this validation row is byte-identical to a training target (for some rows the puzzle's end state), so part of what the row asks the model to draw was seen in training. | md5 of a validation target equals the md5 of some training target; measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/validation_target_identical_to_train.tsv |
text_says_options_not_shown |
27 | 26 | 1 | The upstream text says the options are not shown or cites a trace, template or answer the model never sees ('options (not shown, but implied by the original trace)'), although every input image draws options A-D; training on it teaches the model to deny visible options. | the question or any thought matches 'not shown|not provided|original trace|in the trace|implied by|template indicates|options are not|inferred from the answer' (the review's pattern); measured 2026-09-25; known_issues.py sha1 655e5307; export 4aaee1f rows 30d352ab/67287f6f | reports/known_issues/text_says_options_not_shown.tsv |
To leave the listed rows out (the snippet in the loader section downloads reports/known_issues/ with the data):
import glob, os
root = "<root>/zebra_tetris"
drop = {line.split("\t")[0] for f in glob.glob(os.path.join(root, "reports/known_issues/*.tsv"))
for line in open(f) if line.strip() and not line.startswith(("#", "row_uid\t"))}
# keep a row when its row_uid (a column of train/, meta/ and preview/) is not in drop
Measured caveats
Measured on this release by the pre-publication review (2026-09-25): problems that cannot be listed row by row (a shortcut in the options, a label convention, an upstream labelling scheme) and what the review found around the lists above. Where a caveat counts listed rows ("listed as ..."), the count is the table's, read from reports/known_issues/summary.json. Its other numbers are the review's own measurements, which no file carries: they hold for exactly these rows and are not re-measured automatically. Items marked Training-signal defect are problems in what the rows teach, not only in how they are described; no row was removed for them.
- Training-signal defect. In the tiling and fill-the-complement puzzles (4,994 rows, half the source) the plan names the correct option before any of its pieces is drawn, and only that option's pieces are placed: 4,988 rows (4,827 train, 161 validation; listed as
plan_names_answer_before_pieces), 99.9% of those puzzles, name the labelled option at or before the plan of the first piece image (e.g.6b42e76ba4799ec1: 'Option A contains three pieces. Let's test if these pieces can tile the red shape.'). The piece images confirm a choice the text has already made: use these rows as image supervision, not as evidence that generating the image helps. In the 4,999 transformation puzzles no option is named until the read-back after the last image. - Training-signal defect. In tiling puzzles the thought after the isolated-shape image often states a cell count for the shape that the image contradicts, nearly always too low: at least 1,089 rows (1,052 train, 37 validation; listed as
shape_cell_count_contradicts_image) (the list reads only 'consists of / occupies / has N cells' wordings), 43.7% of the 2,494 tiling rows and 10.9% of the source (e.g.6b42e76ba4799ec1says 'It occupies 14 cells' of a 25-cell shape). The piece sizes and totals quoted in the same thoughts are unreliable in the same way (2949258c0e73136bsays '3, 3, and 3 cells, totaling 9'). These rows teach a wrong reading of the image the model has just drawn. - Training-signal defect. Upstream's generator does not keep the shape whole at the grid edge: a translation drops the cells it would move off the grid (2,242 rows (2,159 train, 83 validation; listed as
translation_clips_cells) have at least one such step, listed astranslation_clips_cellswith the clipped steps per row), and one that would move every cell off is not applied. With mirrors and rotations of symmetric shapes, this leaves 669 target images in 541 rows (531 train, 10 validation; listed astarget_repeats_previous_target) identical to the image before them, although the thought before each describes a move (e.g.fdea4b3b7b909da9); the loss on those targets can be met by copying the previous image. - 951 rows (914 train, 37 validation; listed as
readback_names_no_option), nearly all of them transformation puzzles (about one in five of that kind), end with a final thought that only says the final shape will be compared with the options and never says which option matches; the choice is then only in<answer>. - The three puzzle kinds: transformation 4,999 rows (4,832 train, 167 validation), tiling 2,494 (2,411 / 83), fill-the-complement 2,500 (2,422 / 78).
- The 69 validation target slots with the content of a training target (see the split paragraph) hold 64 distinct images in the 34 of the 328 validation rows listed as
validation_target_identical_to_train; they are shapes other puzzles also reach: 15 are the redraw of the start shape, 39 an intermediate step and 15 the final result.
Size
| split | rows | target image slots | distinct target images |
|---|---|---|---|
| train | 9,665 | 47,178 | 45,234 |
| validation | 328 | 1,581 | 1,565 |
A slot is one target position in one row. Different puzzles pass through the same shapes, and a transformation that changes nothing visible (a mirror of a symmetric shape, a translation at the grid edge) repeats the previous image, so there are fewer distinct target images (by content hash) than slots.
| task | train | validation |
|---|---|---|
| tetris_transform | 9,665 | 328 |
Input images per row: 1. Target images per row (the images the model is trained to generate): 3 to 7.
Image corpus (source_scene_corpus): procedural_grid 9,993. procedural_grid is this pipeline's label for any procedurally generated synthetic image (2D grid puzzles and simple 3D renders of primitive objects alike); the source note above says what the images show.
Row format
One row is: input image(s) and a question, then K rounds of thought → target image (the target is the source's own ground-truth image, which the model is trained to generate), then a final thought (normally a read-back of the last target; where a source's final thought is something else, or often leaves out the answer, the source note or Known issues says so) and the answer; here K is 3 to 7. In the train config:
image_list list<binary> inputs first, then the K target images in order
num_input_images int64 how many of image_list are inputs
instruction_list list<string> one element: system prompt + question; the options A-D are drawn in the input image, there is no option text
output_text_list list<string> K+1 elements:
[0] <think>plan 1</think><image_start>
[j] <image_end><think>plan j+1</think><image_start>
[K] <image_end><think>read-back</think><answer>answer</answer>
row_uid string join key to `meta` and `preview`
Every image is a JPEG, and no input image is larger than 512 px on its long edge (measured on this release, 2026-09-25); the size each target was stored at is target_px in meta.
<answer> holds exactly meta.answer_value (also the answer column of preview) on every row: score model output against that string.
The system prompt is ThinkMorph's VLM_THINK_SYSTEM_PROMPT from its inferencer.py, verbatim (GEN_THINK_SYSTEM_PROMPT there has the same text), including its leading and trailing newline. The markers are plain strings, not tokenizer special tokens; the prompt writes </image_end> and the data writes <image_end>, exactly as the ThinkMorph-7B checkpoint was trained.
preview shows the same rows with one column per slot: input_image_i for the inputs; for each of the K = num_steps rounds, the plan thought_j and its target target_image_j, both empty for K <= j < 7; and the read-back in thought_7 on every row.
meta holds the per-row sidecar: task, scene_id and geometry_uid (the scene and geometry keys; the split key is named in the split paragraph below), trajectory_id (a camera-path or sample label, empty where the source has none), num_steps, num_input_images, answer_type, answer_value, majority_class_rate, target_image_kind, target_px, est_tokens, licence, split (train / validation, the Hub split names), supervision_kind (full_interleaved / visual_aux / visual_only) and filter_flags. majority_class_rate is the share of the task's most frequent answer_value among its training rows: it measures answer skew and is not a guessing baseline (where a task mixes question types or each row has its own options it can be far below chance); compare scores with the text-only baselines below.
Per-row license in meta: cc-by-nc-4.0 9,993.
Flags on released rows (filter_flags in meta and preview, comma-separated):
| flag | rows | meaning |
|---|---|---|
S5.replay_unsupported |
9,993 | no solver re-derives this task's answer from the trace, so S5 did not replay it |
S14.sampled_qa |
200 | chosen for the S14 human spot-check (reports/s14_sample.tsv) |
S9.px=384 |
112 | targets stored at this long-edge size (px) because the row was over the token budget at full size; the trainer's VAE transform (short edge at least 512) scales them back up, so these targets are trained as upsampled, softer images |
S9.px=448 |
9 | targets stored at this long-edge size (px) because the row was over the token budget at full size; the trainer's VAE transform (short edge at least 512) scales them back up, so these targets are trained as upsampled, softer images |
Training with a BAGEL-family loader
Every row here has one input image (num_input_images is 1), so the stock ThinkMorph UnifiedEditIterableDataset (https://github.com/ThinkMorph/ThinkMorph: image_list[0] as input, image_list[j+1] after output_text_list[j]) and the IPT release's version (which reads num_input_images) both read it as intended. Mixed with a source whose rows have more than one input image, only a loader that reads num_input_images is correct.
The stock BAGEL edit loader (ByteDance-Seed/Bagel) cannot train these rows: it never reads output_text_list and expects each instruction_list element to be a list of paraphrases.
parquet_info.json keys each training chunk as <source>/<split>/<file>, here zebra_tetris/train/chunk_00000.parquet, with row-group counts read from the parquet footers. The loader matches a chunk only when its key equals the path it builds, os.path.join(data_dir, file), and skips a chunk with no key without a warning: a source that is alone in its group then fails with IndexError: list index out of range, and in a mixed group it adds no rows. Download into a directory named after the source, not after the repository:
from huggingface_hub import snapshot_download
snapshot_download("yrlyrl/spatial-mmcot-zebra_tetris", repo_type="dataset", local_dir="<root>/zebra_tetris",
allow_patterns=["train/*", "validation/*", "parquet_info.json", "reports/known_issues/*"])
Then either run from <root> with data_dir: zebra_tetris/train and parquet_info_path: zebra_tetris/parquet_info.json, or rebuild the index with absolute keys and use an absolute data_dir:
import json, os
root = "/abs/path/to/root" # the directory that holds zebra_tetris/
info = json.load(open(os.path.join(root, "zebra_tetris", "parquet_info.json")))
info = {os.path.join(root, k): v for k, v in info.items()}
json.dump(info, open(os.path.join(root, "zebra_tetris", "parquet_info_abs.json"), "w"))
# data_dir = os.path.join(root, "zebra_tetris", "train") (spelled exactly so, no trailing slash)
# parquet_info_path = os.path.join(root, "zebra_tetris", "parquet_info_abs.json")
The Hugging Face cache (.../snapshots/<hash>/train/) or a folder named spatial-mmcot-zebra_tetris matches no key.
num_used_data counts chunk files, not rows: the loader repeats this source's file list up to that number, lists every (file, row group) pair, and deals whole row groups out, floor(R / world_size) to each rank and floor(that / num_workers) to each DataLoader worker. The remainder is never read. This source has 2 training chunk files holding 76 row groups of up to 128 rows, so keep num_used_data large, e.g. the 128 of ThinkMorph's interleaved_reasoning.yaml (upstream's example.yaml asks for more than GPUs x workers); every row group is then read. Set to 2 and alone in its group on 8 GPUs with 4 workers, it reads only 64 of the 76 row groups. In a run that mixes sources, give each source the same multiple of its own training chunk-file count, e.g. 128 per file (256 here): the file list is repeated up to num_used_data entries, so a flat 128 for every source would read a two-file source's rows half as often as a one-file source's.
How the rows were chosen
| stage | rows |
|---|---|
| upstream rows read | 10,000 |
refused before conversion (S0raw) |
0 |
| dropped at S5 (the text contains a phrase from S5's self-contradiction list, e.g. 'does not make sense', 'discrepancy', 'there must be a mistake'; a keyword match, not a comparison with the images, so it also removes some sound rows) | 5 |
| refused by the final structural check (S0, after S9) | 1 |
| after conversion and per-row filters | 9,994 |
| removed by S10 (1 exact duplicate) | 1 |
| removed by answer-prior balancing (S13) | 0 |
| released | 9,993 |
Every removed row has one line, with its reason, in reports/:
| file | step | reason (the line's flag, or the field shown) |
rows |
|---|---|---|---|
build/dropped.jsonl |
S0 | S0.empty_readback |
1 |
build/dropped.jsonl |
S5 | S5.self_contradiction |
5 |
s10_dropped.jsonl |
S10 | level: exact |
1 |
Per-step counters of the conversion
10,000 upstream rows were read; S0raw refused 0 before a row existed and passed 10,000 to the first step. S0 runs once more, last, on the final bytes. The reason for every refused, dropped or quarantined row is in the files above.
| step | in | out | dropped | quarantined | rejected | repaired |
|---|---|---|---|---|---|---|
| S4 | 10,000 | 10,000 | 0 | 0 | 0 | 0 |
| S4c | 10,000 | 10,000 | 0 | 0 | 0 | 0 |
| S5 | 10,000 | 9,995 | 5 | 0 | 0 | 0 |
| S8 | 9,995 | 9,995 | 0 | 0 | 0 | 0 |
| S9 | 9,995 | 9,995 | 0 | 0 | 0 | 0 |
| S0 (final structural check, after S9) | 9,995 | 9,994 | 1 | 0 | 0 | 0 |
The train/validation split keeps rows sharing a scene_id in meta on one side, and the assignment is frozen (splits/ in the summary repository). scene_id is the md5 of the raw puzzle image, so a key is one puzzle. S12 saw 9,993 rows under 9,993 keys, one row per key, so the split is in effect per row. No validation input image has the content of a training input image, and none is a pixel-level near-copy of one. S12 does not record per source whether that test ran, but it skips it only for a source whose spec sets split_leak_pixels: false, and no spec does; over all sources it compared 21,661 candidate pairs (perceptual hash within 6 bits) pixel by pixel and found no near-copy (checked 2026-09-25). Target images are not covered by that check: 69 target-image slots in validation rows hold an image with the same content as a training target image (S12 compares a 64x64 greyscale hash and counts slots, so an image repeated in validation counts each time). These are states that other puzzles also reach, as a step or as their final state.
Answer-prior balancing (S13)
Each (task, split) group is checked separately. An answer is the answer value compared as lower-cased text without a trailing full stop, with 'farther' read as 'further' and 'nearer' as 'closer' (for multiple choice, the option text, not the letter; where the candidates are drawn in the image, as in zebra_jigsaw and zebra_tetris, the answer is the letter itself). An answer is real when it holds at least 5 rows and 2% of the group; k is the number of real answers. Answer step: the target is max(30%, 1/k) when k >= 2, and max(30%, 1/d) over the d distinct answers when k = 1; a validation group uses the larger of its own target and its task's train target. A group is cut only when k >= 1 and its most common answer holds more than the target plus 5 percentage points; every answer is then capped at one common count, chosen so that none exceeds the target, and smaller answers keep all their rows. At the answer step, a group at or below that trigger, or with no real answer (k = 0), is left as it is, so its most common answer can hold up to the target plus 5 percentage points. A task whose train group has exactly two real answers is instead cut, in every split, so that its two largest answers have equal counts, with no trigger. Rank and label steps: then, in a group where every option value of every row is a number, the rank of the correct option among the sorted values, and after it, in a group where every trained answer is an option label, the label, are each capped by the same cut-and-trigger rule on their own counts (own target, validation included): capped, never evened out, so two labels are cut only when one exceeds 55%, and then only down to 50%. These steps can also cut groups the answer step left whole, including k = 0 groups, and can raise an answer's final share above its target; the run fails if a real answer ends above the target plus 5 percentage points. A train group of at least 20 rows in which one answer holds 90% or more fails the run. PET (exact_cells_pet) instead cuts each (question type x turn direction) cell to equal counts of its two answers; a PET cell that shows only one answer is removed.
| task | split | pass | rule | rows in → out | real answers k | target | largest share, before → after | cut |
|---|---|---|---|---|---|---|---|---|
| tetris_transform | train | answer | cap30[canon] |
9,665 → 9,665 | 4 | 30.0% | 25.9% → 25.9% | no |
| tetris_transform | train | letter | cap30[letter] |
9,665 → 9,665 | 4 | 30.0% | 25.9% → 25.9% | no |
| tetris_transform | validation | answer | cap30[canon] |
328 → 328 | 4 | 30.0% | 26.2% → 26.2% | no |
| tetris_transform | validation | letter | cap30[letter] |
328 → 328 | 4 | 30.0% | 26.2% → 26.2% | no |
S13 removed no row from this source.
Text-only baselines
Accuracy of guessers that never see an image. For each task the released training rows are split into two fixed halves by a hash of row_uid; each guesser is fitted on one half and scored once on the other (one held-out half, not cross-validation; eval rows below). The reference is chance (the mean of 1 / number of options) where every row is multiple choice, and otherwise the eval-half accuracy of always giving the answer most common in the fit half (when a task's top answers are nearly tied, this need not be the task's most common answer; the line after the table gives that answer's validation score). Accuracies are recounted from the stored rates and eval rows, so they are exact. A task is flagged when a text-only guesser beats its reference by more than 0.15 (for a free-form task, a guesser other than the most common answer). A flagged task can be partly answered from the text alone; an unflagged task passed only these probes, which do not prove the text carries no answer. Report scores on every task next to this baseline.
Guessers: keywords: the most common answer per set of spatial words in the question; last_mentioned: the option named last in the question body; letter_prior: the most common answer letter; majority: the answer most common in the fit half; option_prior: the option text that won most often when shown; template: the most common answer per question wording (numbers masked, object names kept).
| task | best text-only guesser | accuracy | reference | margin | eval rows | flagged |
|---|---|---|---|---|---|---|
| tetris_transform | keywords |
0.259 | 0.250 (chance) | +0.009 | 4,846 | no |
Spot-check (S14)
Pending. The S14 rows are chosen and flagged S14.sampled_qa in meta and preview; the human pass over them has not been signed off yet.
Citation
Zebra-CoT is by Ang Li, Charles Wang, Deqing Fu, Kaiyu Yue, Zikui Cai, Wang Bill Zhu, Ollie Liu, Peng Guo, Willie Neiswanger, Furong Huang, Tom Goldstein and Micah Goldblum, released under CC BY-NC 4.0; this repository is a converted subset of it (the changes are listed under the licence line above). Its card asks users to cite:
@inproceedings{li2026zebracot,
title={Zebra-CoT: A Dataset for Interleaved Vision-Language Reasoning},
author={Ang Li and Charles Wang and Deqing Fu and Kaiyu Yue and Zikui Cai and Wang Bill Zhu and Ollie Liu and Peng Guo and Willie Neiswanger and Furong Huang and Tom Goldstein and Micah Goldblum},
booktitle={The Fourteenth International Conference on Learning Representations},
year={2026},
url={https://openreview.net/forum?id=c6XIVI3TiQ}
}
Provenance
The release files were written by our conversion code (the code repository is not public yet), scripts/convert/export.py at commit 4aaee1f4e946, from build zebra_tetris_r2. The build was made by scripts/convert/run_source.py from the same repository at commit 949af62f8ab7. S10, S12 and S13 ran before the export; reports/export_manifest.json pins every input the export read by SHA-1 (build_manifest_sha1, s10_keep_sha1, s12_assignments_sha1, s13_balanced_keep_sha1).
Every row removed between upstream and this release has one line, with its reason, in reports/: build/dropped.jsonl (rows refused before conversion or dropped by a conversion step); build/quarantine.jsonl (rows set aside by S4c because an automatic check could not match the read-back's conclusion to the label); s10_dropped.jsonl (duplicates removed by S10); s10_label_conflicts.jsonl (rows S10 withheld because another row asks the identical question, options in the same order, of the same images with a different answer); s13_dropped.jsonl (rows removed by answer-prior balancing). known_issues/ lists rows with a measured problem (see Known issues); reports/ also holds the build manifest (absolute paths cut to basenames) and counters, the S14 sample list (s14_sample.tsv: row_uid, task, split) and export_manifest.json. Part of yrlyrl/spatial-mmcot.
- Downloads last month
- 52