messages
list | ground_truth
list | dataset
string | difficulty
string | id
string | problem_family
string | name
string |
|---|---|---|---|---|---|---|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns RB with BB, then put 'BB' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'BB'",
"expected_accepted": true,
"expected_output": "BB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'BBR'",
"expected_accepted": true,
"expected_output": "BBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'BB' → output: 'BBBB'",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'BBBBR'",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'BBR' → output: 'BBBBR'",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RBB' → output: 'BBRBB'",
"expected_accepted": true,
"expected_output": "BBRBB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'BBB'",
"expected_accepted": true,
"expected_output": "BBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BBB' → output: 'BBBBB'",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'BBBR'",
"expected_accepted": true,
"expected_output": "BBBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'BBRR'",
"expected_accepted": true,
"expected_output": "BBRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'BBBB'",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BRRR' → mutated: 'BRRR' → output: 'BBBRRR'",
"expected_accepted": true,
"expected_output": "BBBRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'BBBBB'",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'BBRRR'",
"expected_accepted": true,
"expected_output": "BBRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BBBR' → output: 'BBBBBR'",
"expected_accepted": true,
"expected_output": "BBBBBR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'BBBB' → output: 'BBBBBB'",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'RRRBBBRB' → mutated: 'RRBBBBBB' → output: 'BBRRBBBBBB'",
"expected_accepted": true,
"expected_output": "BBRRBBBBBB",
"input": "RRRBBBRB"
},
{
"check_output": true,
"description": "Input 'RBRRBBBBRBBR' → mutated: 'BBRBBBBBBBBR' → output: 'BBBBRBBBBBBBBR'",
"expected_accepted": true,
"expected_output": "BBBBRBBBBBBBBR",
"input": "RBRRBBBBRBBR"
}
] |
manufactoria
|
hard
|
342539cf-c4a3-4e8e-855c-b3bc5832feea
|
prepend_sequence
|
Prepend BB after Replace patterns RB with BB
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nRemove patterns RB, then put 'RR' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'RR'",
"expected_accepted": true,
"expected_output": "RR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'RRR'",
"expected_accepted": true,
"expected_output": "RRR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: '' → output: 'RR'",
"expected_accepted": true,
"expected_output": "RR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'RRBBR'",
"expected_accepted": true,
"expected_output": "RRBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'R' → output: 'RRR'",
"expected_accepted": true,
"expected_output": "RRR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'R' → output: 'RRR'",
"expected_accepted": true,
"expected_output": "RRR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'RRRR'",
"expected_accepted": true,
"expected_output": "RRRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'RRBR'",
"expected_accepted": true,
"expected_output": "RRBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'B' → output: 'RRB'",
"expected_accepted": true,
"expected_output": "RRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'RRBB'",
"expected_accepted": true,
"expected_output": "RRBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'RRB'",
"expected_accepted": true,
"expected_output": "RRB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'BBRB' → mutated: 'BB' → output: 'RRBB'",
"expected_accepted": true,
"expected_output": "RRBB",
"input": "BBRB"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'RRBBB'",
"expected_accepted": true,
"expected_output": "RRBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'RRRRR'",
"expected_accepted": true,
"expected_output": "RRRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BR' → output: 'RRBR'",
"expected_accepted": true,
"expected_output": "RRBR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: '' → output: 'RR'",
"expected_accepted": true,
"expected_output": "RR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'RRBBBBRR' → mutated: 'RBBBRR' → output: 'RRRBBBRR'",
"expected_accepted": true,
"expected_output": "RRRBBBRR",
"input": "RRBBBBRR"
},
{
"check_output": true,
"description": "Input 'BBBBRBBBRBBR' → mutated: 'BBBBBBBR' → output: 'RRBBBBBBBR'",
"expected_accepted": true,
"expected_output": "RRBBBBBBBR",
"input": "BBBBRBBBRBBR"
}
] |
manufactoria
|
hard
|
d1724967-5a2f-43c9-83cb-a938ff5a6a77
|
prepend_sequence
|
Prepend RR after Remove patterns RB
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns RR with R, then put 'BB' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'BB'",
"expected_accepted": true,
"expected_output": "BB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'BBR'",
"expected_accepted": true,
"expected_output": "BBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'RB' → output: 'BBRB'",
"expected_accepted": true,
"expected_output": "BBRB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'BBBBR'",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'RBR' → output: 'BBRBR'",
"expected_accepted": true,
"expected_output": "BBRBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RB' → output: 'BBRB'",
"expected_accepted": true,
"expected_output": "BBRB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'R' → output: 'BBR'",
"expected_accepted": true,
"expected_output": "BBR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'BBBR'",
"expected_accepted": true,
"expected_output": "BBBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BRB' → output: 'BBBRB'",
"expected_accepted": true,
"expected_output": "BBBRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'BBBB'",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'BBB'",
"expected_accepted": true,
"expected_output": "BBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RRRR' → mutated: 'RR' → output: 'BBRR'",
"expected_accepted": true,
"expected_output": "BBRR",
"input": "RRRR"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'BBBBB'",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RR' → output: 'BBRR'",
"expected_accepted": true,
"expected_output": "BBRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BRBR' → output: 'BBBRBR'",
"expected_accepted": true,
"expected_output": "BBBRBR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'RBRB' → output: 'BBRBRB'",
"expected_accepted": true,
"expected_output": "BBRBRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBBRBRBR' → mutated: 'BBBRBRBR' → output: 'BBBBBRBRBR'",
"expected_accepted": true,
"expected_output": "BBBBBRBRBR",
"input": "BBBRBRBR"
},
{
"check_output": true,
"description": "Input 'RBBBBRRBBRRR' → mutated: 'RBBBBRBBRR' → output: 'BBRBBBBRBBRR'",
"expected_accepted": true,
"expected_output": "BBRBBBBRBBRR",
"input": "RBBBBRRBBRRR"
}
] |
manufactoria
|
hard
|
2b32396f-9ba1-4e3b-9723-3940e4d2a1b2
|
prepend_sequence
|
Prepend BB after Replace patterns RR with R
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns RB with RR, then put 'RBR' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'RBR'",
"expected_accepted": true,
"expected_output": "RBR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'RBRR'",
"expected_accepted": true,
"expected_output": "RBRR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'RR' → output: 'RBRRR'",
"expected_accepted": true,
"expected_output": "RBRRR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'RBRBBR'",
"expected_accepted": true,
"expected_output": "RBRBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'RRR' → output: 'RBRRRR'",
"expected_accepted": true,
"expected_output": "RBRRRR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RRR' → output: 'RBRRRR'",
"expected_accepted": true,
"expected_output": "RBRRRR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'RBRB'",
"expected_accepted": true,
"expected_output": "RBRB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'RBRRR'",
"expected_accepted": true,
"expected_output": "RBRRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'RBRBR'",
"expected_accepted": true,
"expected_output": "RBRBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BRR' → output: 'RBRBRR'",
"expected_accepted": true,
"expected_output": "RBRBRR",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'RBRBB'",
"expected_accepted": true,
"expected_output": "RBRBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'RRBR' → mutated: 'RRRR' → output: 'RBRRRRR'",
"expected_accepted": true,
"expected_output": "RBRRRRR",
"input": "RRBR"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'RBRBBB'",
"expected_accepted": true,
"expected_output": "RBRBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'RBRRRR'",
"expected_accepted": true,
"expected_output": "RBRRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BRRR' → output: 'RBRBRRR'",
"expected_accepted": true,
"expected_output": "RBRBRRR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'RRRR' → output: 'RBRRRRR'",
"expected_accepted": true,
"expected_output": "RBRRRRR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBBRRBRB' → mutated: 'BBBRRRRR' → output: 'RBRBBBRRRRR'",
"expected_accepted": true,
"expected_output": "RBRBBBRRRRR",
"input": "BBBRRBRB"
},
{
"check_output": true,
"description": "Input 'RBBBRBBBBRBB' → mutated: 'RRBBRRBBBRRB' → output: 'RBRRRBBRRBBBRRB'",
"expected_accepted": true,
"expected_output": "RBRRRBBRRBBBRRB",
"input": "RBBBRBBBBRBB"
}
] |
manufactoria
|
hard
|
fd10261d-cccc-43e2-9239-ef26e380fe96
|
prepend_sequence
|
Prepend RBR after Replace patterns RB with RR
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns RB with BR, then put 'BBBR' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'BBBR'",
"expected_accepted": true,
"expected_output": "BBBR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'BBBRR'",
"expected_accepted": true,
"expected_output": "BBBRR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'BR' → output: 'BBBRBR'",
"expected_accepted": true,
"expected_output": "BBBRBR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'BBBRBBR'",
"expected_accepted": true,
"expected_output": "BBBRBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'BRR' → output: 'BBBRBRR'",
"expected_accepted": true,
"expected_output": "BBBRBRR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RBR' → output: 'BBBRRBR'",
"expected_accepted": true,
"expected_output": "BBBRRBR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'BBBRB'",
"expected_accepted": true,
"expected_output": "BBBRB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'BBBRRR'",
"expected_accepted": true,
"expected_output": "BBBRRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'BBBRBR'",
"expected_accepted": true,
"expected_output": "BBBRBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BBR' → output: 'BBBRBBR'",
"expected_accepted": true,
"expected_output": "BBBRBBR",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'BBBRBB'",
"expected_accepted": true,
"expected_output": "BBBRBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BBRR' → output: 'BBBRBBRR'",
"expected_accepted": true,
"expected_output": "BBBRBBRR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'BBBRBBB'",
"expected_accepted": true,
"expected_output": "BBBRBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'BBBRRRR'",
"expected_accepted": true,
"expected_output": "BBBRRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'BRBR' → output: 'BBBRBRBR'",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'RRBBRBBB' → mutated: 'RBRBBRBB' → output: 'BBBRRBRBBRBB'",
"expected_accepted": true,
"expected_output": "BBBRRBRBBRBB",
"input": "RRBBRBBB"
},
{
"check_output": true,
"description": "Input 'BBRRBRRBBBRR' → mutated: 'BBRBRRBRBBRR' → output: 'BBBRBBRBRRBRBBRR'",
"expected_accepted": true,
"expected_output": "BBBRBBRBRRBRBBRR",
"input": "BBRRBRRBBBRR"
}
] |
manufactoria
|
hard
|
d3a216c5-e8c0-4d02-b040-78d921c033b0
|
prepend_sequence
|
Prepend BBBR after Replace patterns RB with BR
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns BB with RB, then put 'BRBB' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'BRBB'",
"expected_accepted": true,
"expected_output": "BRBB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'BRBBR'",
"expected_accepted": true,
"expected_output": "BRBBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'RB' → output: 'BRBBRB'",
"expected_accepted": true,
"expected_output": "BRBBRB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'RBR' → output: 'BRBBRBR'",
"expected_accepted": true,
"expected_output": "BRBBRBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'RBR' → output: 'BRBBRBR'",
"expected_accepted": true,
"expected_output": "BRBBRBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RRB' → output: 'BRBBRRB'",
"expected_accepted": true,
"expected_output": "BRBBRRB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'BRBBB'",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'BRBBRR'",
"expected_accepted": true,
"expected_output": "BRBBRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'BRBBBR'",
"expected_accepted": true,
"expected_output": "BRBBBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BRB' → output: 'BRBBBRB'",
"expected_accepted": true,
"expected_output": "BRBBBRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'RB' → output: 'BRBBRB'",
"expected_accepted": true,
"expected_output": "BRBBRB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'RRRB' → mutated: 'RRRB' → output: 'BRBBRRRB'",
"expected_accepted": true,
"expected_output": "BRBBRRRB",
"input": "RRRB"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'RBB' → output: 'BRBBRBB'",
"expected_accepted": true,
"expected_output": "BRBBRBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'BRBBRRR'",
"expected_accepted": true,
"expected_output": "BRBBRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BRBR' → output: 'BRBBBRBR'",
"expected_accepted": true,
"expected_output": "BRBBBRBR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'RBRB' → output: 'BRBBRBRB'",
"expected_accepted": true,
"expected_output": "BRBBRBRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'RBBRBRRB' → mutated: 'RRBRBRRB' → output: 'BRBBRRBRBRRB'",
"expected_accepted": true,
"expected_output": "BRBBRRBRBRRB",
"input": "RBBRBRRB"
},
{
"check_output": true,
"description": "Input 'RBBRBRBRBRBR' → mutated: 'RRBRBRBRBRBR' → output: 'BRBBRRBRBRBRBRBR'",
"expected_accepted": true,
"expected_output": "BRBBRRBRBRBRBRBR",
"input": "RBBRBRBRBRBR"
}
] |
manufactoria
|
hard
|
cd60fdcd-f94a-43fc-83c4-c6ae96f71818
|
prepend_sequence
|
Prepend BRBB after Replace patterns BB with RB
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns RR with R, then put 'RBBB' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'RBBB'",
"expected_accepted": true,
"expected_output": "RBBB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'RBBBR'",
"expected_accepted": true,
"expected_output": "RBBBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'RB' → output: 'RBBBRB'",
"expected_accepted": true,
"expected_output": "RBBBRB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BBR' → output: 'RBBBBBR'",
"expected_accepted": true,
"expected_output": "RBBBBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'RBR' → output: 'RBBBRBR'",
"expected_accepted": true,
"expected_output": "RBBBRBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RB' → output: 'RBBBRB'",
"expected_accepted": true,
"expected_output": "RBBBRB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'RBBBB'",
"expected_accepted": true,
"expected_output": "RBBBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'R' → output: 'RBBBR'",
"expected_accepted": true,
"expected_output": "RBBBR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'BR' → output: 'RBBBBR'",
"expected_accepted": true,
"expected_output": "RBBBBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'BRB' → output: 'RBBBBRB'",
"expected_accepted": true,
"expected_output": "RBBBBRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'RBBBBB'",
"expected_accepted": true,
"expected_output": "RBBBBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBBR' → mutated: 'BBBR' → output: 'RBBBBBBR'",
"expected_accepted": true,
"expected_output": "RBBBBBBR",
"input": "BBBR"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'RBBBBBB'",
"expected_accepted": true,
"expected_output": "RBBBBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RR' → output: 'RBBBRR'",
"expected_accepted": true,
"expected_output": "RBBBRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'BRBR' → output: 'RBBBBRBR'",
"expected_accepted": true,
"expected_output": "RBBBBRBR",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'RBRB' → output: 'RBBBRBRB'",
"expected_accepted": true,
"expected_output": "RBBBRBRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBRRRBBB' → mutated: 'BBRRBBB' → output: 'RBBBBBRRBBB'",
"expected_accepted": true,
"expected_output": "RBBBBBRRBBB",
"input": "BBRRRBBB"
},
{
"check_output": true,
"description": "Input 'BRBBBBRBRRBR' → mutated: 'BRBBBBRBRBR' → output: 'RBBBBRBBBBRBRBR'",
"expected_accepted": true,
"expected_output": "RBBBBRBBBBRBRBR",
"input": "BRBBBBRBRRBR"
}
] |
manufactoria
|
hard
|
e382f9e2-519a-4ae3-9e26-b7f6cad09f93
|
prepend_sequence
|
Prepend RBBB after Replace patterns RR with R
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nReplace patterns BR with RB, then put 'R' at the beginning of the tape. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' → mutated: '' → output: 'R'",
"expected_accepted": true,
"expected_output": "R",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' → mutated: 'R' → output: 'RR'",
"expected_accepted": true,
"expected_output": "RR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' → mutated: 'RB' → output: 'RRB'",
"expected_accepted": true,
"expected_output": "RRB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' → mutated: 'BRB' → output: 'RBRB'",
"expected_accepted": true,
"expected_output": "RBRB",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' → mutated: 'RRB' → output: 'RRRB'",
"expected_accepted": true,
"expected_output": "RRRB",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' → mutated: 'RRB' → output: 'RRRB'",
"expected_accepted": true,
"expected_output": "RRRB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' → mutated: 'B' → output: 'RB'",
"expected_accepted": true,
"expected_output": "RB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' → mutated: 'RR' → output: 'RRR'",
"expected_accepted": true,
"expected_output": "RRR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' → mutated: 'RB' → output: 'RRB'",
"expected_accepted": true,
"expected_output": "RRB",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' → mutated: 'RBB' → output: 'RRBB'",
"expected_accepted": true,
"expected_output": "RRBB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' → mutated: 'BB' → output: 'RBB'",
"expected_accepted": true,
"expected_output": "RBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBBB' → mutated: 'BBBB' → output: 'RBBBB'",
"expected_accepted": true,
"expected_output": "RBBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBB' → mutated: 'BBB' → output: 'RBBB'",
"expected_accepted": true,
"expected_output": "RBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'RRR' → mutated: 'RRR' → output: 'RRRR'",
"expected_accepted": true,
"expected_output": "RRRR",
"input": "RRR"
},
{
"check_output": true,
"description": "Input 'BRBR' → mutated: 'RBRB' → output: 'RRBRB'",
"expected_accepted": true,
"expected_output": "RRBRB",
"input": "BRBR"
},
{
"check_output": true,
"description": "Input 'RBRB' → mutated: 'RRBB' → output: 'RRRBB'",
"expected_accepted": true,
"expected_output": "RRRBB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'RRBBBBRB' → mutated: 'RRBBBRBB' → output: 'RRRBBBRBB'",
"expected_accepted": true,
"expected_output": "RRRBBBRBB",
"input": "RRBBBBRB"
},
{
"check_output": true,
"description": "Input 'RRRBBBRRRBRB' → mutated: 'RRRBBRBRRRBB' → output: 'RRRRBBRBRRRBB'",
"expected_accepted": true,
"expected_output": "RRRRBBRBRRRBB",
"input": "RRRBBBRRRBRB"
}
] |
manufactoria
|
hard
|
21327bdf-7d3d-4ef0-8263-6a14f0db7c96
|
prepend_sequence
|
Prepend R after Replace patterns BR with RB
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.