Participant 1

Initial description: Copy the input board and then fill in individual green blocks with black, that stand alone and aren't connected to another green block.

Final description: Copy the input board and then fill in individual green blocks with black, that stand alone and aren't connected to another green block.


Attempt 1: Correct

Participant 2

Initial description: The rule is to remove all single squares that are not connected to another one.

Final description: The rule has got to be removing all single colored squares that aren't connected to another one, I don't see how it could be anything else and I've checked and re-checked multiple times.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Incorrect

Participant 3

Initial description: The rule I believe was to transform the test output so that all blocks from the test input that had two or more squares touching where to be placed in the test output. The squares that were one block were to be ignored.

Final description: I thought the rule was that all squares that were touching another square were to be placed in the test output as was shown in the example inputs.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Incorrect

Participant 4

Initial description: I was thinking based on the example inputs and outputs that only clusters of squares remain in the output and squares that are not clustered are removed for the output.

Final description: My understanding of the rule was that only clusters of squares would remain in the output and individual squares would be removed.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Incorrect

Participant 5

Initial description: I thought that every block that is by itself should be removed.

Final description: I removed all of the blocks that were not part of a group of blocks. If the blocks were touching any other blocks, they needed to be reproduced.


Attempt 1: Incorrect
Attempt 2: Correct

Participant 6

Initial description: Same as the input, but removing any cells that don't touch or connect to any other cells.

Final description: Identical to the input task, but removing any cells that don't touch another cell.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Correct

Participant 7

Initial description: copy the input and delete some of the green squares

Final description: copy the green squares but delete about half of them.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Incorrect

Participant 8

Initial description: Well

Final description: Well


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Incorrect

Participant 9

Initial description: Copy the grid over as is, and then delete any box that isn't touching another box, boxes where only the corners meet also count as touching. Keep the color the same.

Final description: Copy the grid over as is, and then delete any box that isn't touching another box, boxes where only the corners meet also count as touching. Keep the color the same.


Attempt 1: Correct

Participant 10

Initial description: All single colored squares not touching any other colored square are eliminated.

Final description: All single colored squares not touching any other colored square are eliminated.


Attempt 1: Correct

Participant 11

Initial description: The input examples are copied to the output example, but any colored square that's alone, disconnected from other colored squares, is erased into a black square.

Final description: The example input has a scattering of colored squares, some side by side, others on their own. The output copies the input design, but it removes all of the colored squares that aren't connected to any other colored square.


Attempt 1: Incorrect
Attempt 2: Incorrect
Attempt 3: Correct

Participant 12

Initial description: Remove any green square that is not touching another one from the grid.

Final description: Remove any green square that isn't touching another one from the grid.


Attempt 1: Incorrect
Attempt 2: Correct

Participant 13

Initial description: Any cell not touching another is not in test output.

Final description: Any single cell in the test input will not be in the test output. For a cell to be in test output it must touch another cell.


Attempt 1: Incorrect
Attempt 2: Correct

Participant 14

Initial description: from the examples it seemed like all the single blocks needed to be removed

Final description: from the examples it seemed like all the single blocks needed to be removed


Attempt 1: Correct

Participant 15

Initial description: The squares that are not touching other squares are removed from the output.

Final description: The squares that are not touching other squares are removed from the output.


Attempt 1: Correct

Participant 16

Initial description: Copy the input exactly and get rid of any of the squares that are absolutely by themsleves. Single squares that aren't touching any other squares, even the ones hanging off by a corner can be left, but single ones should be turned to the background color.

Final description: Copy from the grid exactly, any single square that is not touching any other square, even by the corner, can be turned to the background black color so that all that is left are groups of squares or any that are touching.


Attempt 1: Incorrect
Attempt 2: Correct

Participant 17

Initial description: If a green square is only touched by a black square or the edge of the grid horizontally, diagonally and vertically, change the green square to a black square.

Final description: If a green square is only touched by a black square or the edge of the grid horizontally, diagonally and vertically, change the green square to a black square.


Attempt 1: Correct

Participant 18

Initial description: According to demo to join the grid.

Final description: According to demo to join the grid.


Attempt 1: Correct