The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed
Error code: DatasetGenerationError
Exception: ArrowInvalid
Message: JSON parse error: Invalid value. in row 0
Traceback: Traceback (most recent call last):
File "/usr/local/lib/python3.12/site-packages/datasets/packaged_modules/json/json.py", line 174, in _generate_tables
df = pandas_read_json(f)
^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/packaged_modules/json/json.py", line 38, in pandas_read_json
return pd.read_json(path_or_buf, **kwargs)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/pandas/io/json/_json.py", line 791, in read_json
json_reader = JsonReader(
^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/pandas/io/json/_json.py", line 905, in __init__
self.data = self._preprocess_data(data)
^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/pandas/io/json/_json.py", line 917, in _preprocess_data
data = data.read()
^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/utils/file_utils.py", line 813, in read_with_retries
out = read(*args, **kwargs)
^^^^^^^^^^^^^^^^^^^^^
File "<frozen codecs>", line 322, in decode
UnicodeDecodeError: 'utf-8' codec can't decode byte 0x89 in position 0: invalid start byte
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1815, in _prepare_split_single
for _, table in generator:
^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/packaged_modules/json/json.py", line 177, in _generate_tables
raise e
File "/usr/local/lib/python3.12/site-packages/datasets/packaged_modules/json/json.py", line 151, in _generate_tables
pa_table = paj.read_json(
^^^^^^^^^^^^^^
File "pyarrow/_json.pyx", line 342, in pyarrow._json.read_json
File "pyarrow/error.pxi", line 155, in pyarrow.lib.pyarrow_internal_check_status
File "pyarrow/error.pxi", line 92, in pyarrow.lib.check_status
pyarrow.lib.ArrowInvalid: JSON parse error: Invalid value. in row 0
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1339, in compute_config_parquet_and_info_response
parquet_operations = convert_to_parquet(builder)
^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 972, in convert_to_parquet
builder.download_and_prepare(
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 894, in download_and_prepare
self._download_and_prepare(
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 970, in _download_and_prepare
self._prepare_split(split_generator, **prepare_split_kwargs)
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1702, in _prepare_split
for job_id, done, content in self._prepare_split_single(
^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1858, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
data_id string | qa_type string | question_id int64 | question_description string | state string | plot_level string | qa_level string | options list | query string | solution string | images list | Options null |
|---|---|---|---|---|---|---|---|---|---|---|---|
free_cell-specified_card-Medium-00252 | Target Perception | 1 | Given a particular game state, the puzzle will present a question about which card is at a specific position in one of the cascade piles.Your task is to indentify the card in the options. | states/state_analysis_Medium_00252.json | Medium | Easy | [
"(Heart, Q)",
"(Heart, 6)",
"(Diamond, K)",
"(Heart, 2)",
"(Spade, 5)",
"(Spade, 6)",
"(Club, 7)",
"(Heart, 7)"
] | In this FreeCell game:
we have 6 cascade piles at sum, and their indexes are [0, 1, 2, 3, 4, 5]We have 4 freecell on the left top, and their indexes are 0,1,2,3.We have 4 foundation piles on the right top, and their indexes are 0,1,2,3.In FreeCell, cards can be moved according to specific rules: A card can be moved to ... | 8 | [
"RL_5k_games_images/freecell/state_analysis_Medium_00252.png"
] | null |
maze_00141_06 | State Prediction | 6 | The position after moving. | states/state_00141.json | Easy | Medium | [
"A. (4, 6)",
"B. (5, 7)",
"C. (5, 5)",
"D. (5, 6)",
"E. (6, 6)"
] | **Rules:**
1. This is a maze mini-game.The player needs to navigate around obstacles to reach the destination and achieve victory.
2. The red circle represents the player, the green block is the goal and the blue blocks are obstacles.
3. The player can only move within the white blocks.
4. The coordinates are given in ... | B | [
"RL_5k_games_images/maze/image_00141.png"
] | null |
ultra_tictactoe-data-00626-04377 | Target Perception | 2 | Given the coordinate of last step, find the number of possible coordinates of next step. | states/board_00626.json | Hard | Easy | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 4 | [
"RL_5k_games_images/ultra_tictactoe/board_00626.png"
] | null |
star-battle-valid_cell-Hard-00213 | State Prediction | 4 | Based on the current puzzle state, your task is to identify which of the following cells provided by the options can a star be placed in? | states/board_state_analysis_Hard_213.json | Hard | Medium | [
"(3,2)",
"(2,0)",
"(0,7)",
"(1,4)",
"(5,5)",
"(4,6)",
"(5,3)",
"(4,0)"
] |
We have a 8*8 grid.The grid is divided into 8 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 7 | [
"RL_5k_games_images/star-battle/board_state_analysis_Hard_213.png"
] | null |
word-mcq-03471 | Target Perception | 0 | cell_letter | states/word-mcq-03471.json | Easy | Easy | [
"F",
"G",
"T",
"W",
"K",
"S",
"Y",
"L"
] | Rules:
1. The grid contains uppercase letters.
2. Row and column indexes begin from 1 at the top-left corner.
Question:
What letter is at row 3, column 5?
Options:
1: F
2: G
3: T
4: W
5: K
6: S
7: Y
8: L | 5 | [
"RL_5k_games_images/word_search/word-mcq-03471.png"
] | null |
spider_solitaire-train-00057-0 | Target Perception | 0 | Remaining deals in the stockpile | states/board_00057.json | Easy | Easy | null |
Spider Solitaire
# OBJECTIVE
Spider is played with eight decks of 13 spade cards each, totaling 104 unique cards. The goal is to arrange all cards in a King-to-Ace sequence in the same suit and move them to the foundation piles. Once all sequences are moved to the foundations, the game is won.
# SETUP
The game featu... | 2 | [
"RL_5k_games_images/spider_solitaire/board_00057.png"
] | null |
zuma-fill-01714 | State Prediction | 5 | The state of the plot if the frog shoots at -172 degrees. | states/0343.json | Hard | Hard | null | This is a Zuma game. You need to control a frog to shoot colored marbles from its mouth toward a winding track of approaching marbles. Your goal is to clear all marbles before they reach the black hole at the end of the track. The marbles roll steadily along the track, and the player must fire marbles to create groups ... | The marble stayed on the track. | [
"RL_5k_games_images/zuma/0343.png"
] | null |
ultra_tictactoe-data-00131-00911 | Target Perception | 1 | Find which player marked the cell at a given coordinate. | states/board_00131.json | Easy | Easy | [
"First Player",
"Second Player",
"Not Marked"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 2 | [
"RL_5k_games_images/ultra_tictactoe/board_00131.png"
] | null |
path-mcq-01261-path_finding | State Prediction | 0 | path_finding | states/path-mcq-01261.json | Medium | Hard | [
"1-up, 2-right-forward, 3-up, 4-left-forward",
"1-right-forward, 2-right-forward, 3-up, 4-left-forward",
"1-up, 2-left-forward, 3-right-forward, 4-left-forward",
"1-right-forward, 2-left-forward, 3-right-forward, 4-left-forward",
"1-right-forward, 2-left-forward, 3-up, 4-left-forward",
"1-up, 2-left-forwa... | Rules:
1. Player can only walk on top of cubes
2. Player can climb ladders if they can reach the cube under the ladder
3. From a ladder, player can reach the top of the last cube with the ladder
4. Blue cube is start position, red cube is goal position
5. Numbered cubes are branch points where player must choose a path... | 8 | [
"RL_5k_games_images/3d_maze/path-mcq-01261.png"
] | null |
space_invaders-fill-01144 | State Prediction | 7 | Ask the points gained by continually shooting where the ship is with the enemies keeping on moving | states/space_invaders_00128.json | Medium | Hard | null | The given image represents a simplified interface of the game Space Invaders. The enemy area is implicitly divided into a grid of cells, with the row and column numbers shown on the left and top sides of the grid respectively which you should strictly follow. Each cell is either empty or occupied by an incoming enemy w... | 20 | [
"RL_5k_games_images/space_invaders/space_invaders_00128.png"
] | null |
rubiks_cube-data-00639-00005 | Target Perception | 5 | Count specific colors on a face | states/cube_00639.json | Easy | Easy | [
"6",
"7",
"1",
"5",
"9",
"2",
"8",
"0"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 5 | [
"RL_5k_games_images/rubiks_cube/cube_00639.png"
] | null |
turing-machine-train-00365 | State Prediction | 0 | position | states/00365.json | Medium | Medium | [
"(1, 0)",
"(4, 0)",
"(0, 2)",
"(3, 2)",
"(1, 1)",
"(1, 2)",
"(2, 1)",
"(3, 1)"
] | Rules:
State 0, Symbol 0 -> Write 2, Move down, New State 1
State 0, Symbol 1 -> Write 3, Move down, New State 1
State 0, Symbol 2 -> Write 2, Move right, New State 2
State 0, Symbol 3 -> Write 1, Move left, New State 3
State 0, Symbol 4 -> Write 2, Move right, New State 3
State 1, Symbol 0 -> Write 1, Move left, New S... | 7 | [
"RL_5k_games_images/2d_turing_machine/00365.png"
] | null |
tengram-mcq-00211-piece_count | Target Perception | 1 | piece_count | states/tengram-mcq-00211.json | Medium | Easy | [
"2",
"0",
"5",
"1",
"7",
"3",
"4",
"6"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
4. Some pieces have been removed and are shown below the main board.
Question:
How many pieces are currently on the main b... | 6 | [
"RL_5k_games_images/tengram/tengram-mcq-00211.png"
] | null |
tetris-00231-empty-cells | Target Perception | 0 | empty cells in row | states/tetris-00231.json | Easy | Easy | null | Rules:
1. The image shows a standard Tetris grid with 8 rows and 8 columns.
2. The top row of the grid is labeled as Row 0 according to the coordinates.
3. Row coordinates increment from top to bottom in the grid from 0 to 7.
4. In the image, empty cells are painted white and a cell is painted grey if in previous moves... | 4 | [
"RL_5k_games_images/tetris/tetris-00231.png"
] | null |
sokoban-data-00717-00005 | Target Perception | 5 | Calculate the Manhattan distance between a box and its target | states/board_00717.json | Easy | Easy | [
"2",
"5",
"8",
"9",
"1",
"3",
"6",
"7"
] | This is a Sokoban puzzle where black figure is player, green X is target, brown box with X is box to push, brown tiles are walls, and light brown areas are movable spaces.The coordinates (x, y) in this puzzle represent the matrix format.What is the Manhattan distance between the box and the target?
Options:
[1] 2
[2] 5... | 5 | [
"RL_5k_games_images/sokoban/board_00717.png"
] | null |
color-mcq-03909-color_description | Target Perception | 1 | color_description | states/color-mcq-03909.json | Medium | Easy | [
"yellow",
"pale bright indigo",
"pale dark blue",
"vivid yellow",
"vivid bright cyan",
"red",
"dark yellow",
"purple"
] | Rules:
1. Colors change gradually along rows or columns.
2. A gradient transitions between two colors.
3. Each row or column can have its own independent gradient pattern.
4. Row and column indexes begin from 1 at the top-left corner.
Question:
What color is the cell at row 3, column 4?
Options:
1: yellow
2: pale br... | 1 | [
"RL_5k_games_images/hue/color-mcq-03909.png"
] | null |
ultra_tictactoe-data-00708-04954 | Target Perception | 5 | Find the points the given player has got within the given Nine-grid. | states/board_00708.json | Hard | Medium | [
"0",
"2",
"4",
"3",
"6",
"9",
"1",
"5"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 1 | [
"RL_5k_games_images/ultra_tictactoe/board_00708.png"
] | null |
space_invaders-mcq-00196 | State Prediction | 7 | Ask the points gained by continually shooting where the ship is with the enemies keeping on moving | states/space_invaders_00022.json | Easy | Hard | [
"20",
"30",
"40",
"50",
"60",
"70",
"80",
"90"
] | The given image represents a simplified interface of the game Space Invaders. The enemy area is implicitly divided into a grid of cells, with the row and column numbers shown on the left and top sides of the grid respectively which you should strictly follow. Each cell is either empty or occupied by an incoming enemy w... | 1 | [
"RL_5k_games_images/space_invaders/space_invaders_00022.png"
] | null |
word-mcq-00196 | Target Perception | 2 | word_direction | states/word-mcq-00196.json | Hard | Medium | [
"down",
"left",
"diagonal-left-down",
"right",
"diagonal-right-up",
"up",
"diagonal-right-down",
"diagonal-left-up"
] | Rules:
1. This is a word search game. Words can be placed in different directions: right, down, diagonal, up, or left.
2. Starting from position (row 6, column 3), in which direction can you find the word 'JUGGLE'?
Options:
1: down
2: left
3: diagonal-left-down
4: right
5: diagonal-right-up
6: up
7: diagonal-right-dow... | 6 | [
"RL_5k_games_images/word_search/word-mcq-00196.png"
] | null |
color-mcq-01704-color_description | Target Perception | 1 | color_description | states/color-mcq-01704.json | Hard | Easy | [
"yellow",
"vivid indigo",
"bright red",
"pale orange",
"vivid green",
"green",
"vivid bright blue",
"blue"
] | Rules:
1. Colors change gradually along rows or columns.
2. A gradient transitions between two colors.
3. Each row or column can have its own independent gradient pattern.
4. Row and column indexes begin from 1 at the top-left corner.
Question:
What color is the cell at row 4, column 6?
Options:
1: yellow
2: vivid i... | 4 | [
"RL_5k_games_images/hue/color-mcq-01704.png"
] | null |
word-mcq-02513 | TransitionPath | 3 | find_word_location | states/word-mcq-02513.json | Medium | Hard | [
"Row 7, Column 7, Direction: up",
"Row 4, Column 2, Direction: right",
"Row 6, Column 5, Direction: down",
"Row 7, Column 7, Direction: right",
"Row 6, Column 5, Direction: up",
"Row 4, Column 4, Direction: down",
"Row 4, Column 6, Direction: left",
"Row 4, Column 6, Direction: up"
] | Rules:
1. This is a word search game. Words can be placed in different directions: right, down, diagonal-right-down, diagonal-right-up, diagonal-left-down, diagonal-left-up, up, or left.
2. Words read from start to end in the specified direction.
Question:
Find the word 'COPOLAR' in the grid. Where does it start and i... | 1 | [
"RL_5k_games_images/word_search/word-mcq-02513.png"
] | null |
free_cell-specified_card-Hard-00156 | Target Perception | 1 | Given a particular game state, the puzzle will present a question about which card is at a specific position in one of the cascade piles.Your task is to indentify the card in the options. | states/state_analysis_Hard_00156.json | Hard | Easy | [
"(Diamond, 7)",
"(Spade, Q)",
"(Club, A)",
"(Heart, 4)",
"(Spade, 7)",
"(Heart, 5)",
"(Heart, 6)",
"(Diamond, 3)"
] | In this FreeCell game:
we have 4 cascade piles at sum, and their indexes are [0, 1, 2, 3]We have 4 freecell on the left top, and their indexes are 0,1,2,3.We have 4 foundation piles on the right top, and their indexes are 0,1,2,3.In FreeCell, cards can be moved according to specific rules: A card can be moved to a free... | 8 | [
"RL_5k_games_images/freecell/state_analysis_Hard_00156.png"
] | null |
spider_solitaire-train-00366-6 | State Prediction | 4 | Predict card move result | states/board_00366.json | Hard | Medium | [
"A. The move will be successful, and the cards will be in descending order, following the rules of movement.",
"B. The move cannot be made because this card is face-down and its value is unknown.",
"C. The move cannot be made because there is a card above it, and that card does not form a descending order with ... |
Spider Solitaire
# OBJECTIVE
Spider is played with eight decks of 13 spade cards each, totaling 104 unique cards. The goal is to arrange all cards in a King-to-Ace sequence in the same suit and move them to the foundation piles. Once all sequences are moved to the foundations, the game is won.
# SETUP
The game featu... | C | [
"RL_5k_games_images/spider_solitaire/board_00366.png"
] | null |
color-mcq-02239-color_description | Target Perception | 1 | color_description | states/color-mcq-02239.json | Hard | Easy | [
"pale bright red",
"bright green",
"bright purple",
"cyan",
"green",
"vivid bright indigo",
"vivid bright cyan",
"red"
] | Rules:
1. Colors change gradually along rows or columns.
2. A gradient transitions between two colors.
3. Each row or column can have its own independent gradient pattern.
4. Row and column indexes begin from 1 at the top-left corner.
Question:
What color is the cell at row 2, column 7?
Options:
1: pale bright red
2... | 8 | [
"RL_5k_games_images/hue/color-mcq-02239.png"
] | null |
ultra_tictactoe-data-00555-03882 | Target Perception | 4 | Find the number of pieces in the image. | states/board_00555.json | Hard | Medium | [
"69",
"61",
"49",
"57",
"46",
"64",
"53",
"76"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 2 | [
"RL_5k_games_images/ultra_tictactoe/board_00555.png"
] | null |
langton-mcq-04156 | Target Perception | 1 | Identify the current position and direction of the ant | states/board_1386.json | Hard | Easy | [
"Position (6, 7), facing right",
"Position (7, 10), facing right",
"Position (2, 5), facing up",
"Position (0, 5), facing up",
"Position (10, 12), facing up",
"Position (6, 2), facing down",
"Position (9, 12), facing right",
"Position (7, 8), facing left"
] | In Langton's Ant, we have a grid where each cell is either white or black. A red arrow represents an ant, showing its current position and direction. The ant follows these simple rules:
1. If the ant is on a white cell, it turns right 90 degrees, changes the cell to black, and moves forward one step
2. If the ant is on... | A | [
"RL_5k_games_images/langton_ant/board_1386.png"
] | null |
tengram-mcq-00617-piece_count | Target Perception | 1 | piece_count | states/tengram-mcq-00617.json | Medium | Easy | [
"3",
"7",
"5",
"4",
"6",
"1",
"0",
"2"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
4. Some pieces have been removed and are shown below the main board.
Question:
How many pieces are currently on the main b... | 6 | [
"RL_5k_games_images/tengram/tengram-mcq-00617.png"
] | null |
reconstruction_02541 | State Prediction | 3 | Predict the projection matrix after adding specified voxels to the current structure. | states/reconstruction_02541.json | Easy | Medium | null | You are in the middle of a 3D reconstruction puzzle.
The current structure has some initial voxels, and your goal is to complete it.
Game Rules:
1. Goal: Reconstruct a 3D structure by adding voxels to match given projections.
2. Grid Space: The game is played on a 3x3x3 cube grid.
3. Coordinates: Position (x,y,z) rang... | [[0, 0, 0], [1, 0, 0], [1, 0, 0]] | [
"RL_5k_games_images/3dreconstruction/reconstruction_02541.png"
] | null |
rhythm_game-data-00098-00686 | Strategy Optimization | 7 | Find choosing which column to click can get the highest score when it takes 1 second to reverse the grid. | states/board_00098.json | Easy | Hard | [
"1",
"2",
"3",
"4"
] | Now I'll give you a picture, which shows a screenshot of a rhythm game, in which there are operation blocks of various colors. In this game, the operation blocks will fall at a speed of 1 cell/second. At the same time, you can select a column to place your finger (you cannot move your finger after selecting it), and cl... | 3 | [
"RL_5k_games_images/rhythm_game/board_00098.png"
] | null |
rubiks_cube-data-00398-00005 | Target Perception | 5 | Count specific colors on a face | states/cube_00398.json | Hard | Easy | [
"2",
"4",
"8",
"6",
"7",
"9",
"5",
"0"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 6 | [
"RL_5k_games_images/rubiks_cube/cube_00398.png"
] | null |
tetris-03317-max-rows | Strategy Optimization | 3 | maximum rows to be cleared | states/tetris-03317.json | Medium | Hard | null | Rules:
1. The image shows a standard Tetris grid with 12 rows and 12 columns.
2. The number and categories of actions done to the falling tetromino are not restricted, which means you can perform unlimited rotations and translations (moving left, right, or down) to position the tetromino as needed.
3. Only consider ro... | 1 | [
"RL_5k_games_images/tetris/tetris-03317.png"
] | null |
zuma-fill-03229 | State Prediction | 5 | The state of the plot if the frog shoots at -76 degrees. | states/0646.json | Hard | Hard | null | This is a Zuma game. You need to control a frog to shoot colored marbles from its mouth toward a winding track of approaching marbles. Your goal is to clear all marbles before they reach the black hole at the end of the track. The marbles roll steadily along the track, and the player must fire marbles to create groups ... | The marble stayed on the track. | [
"RL_5k_games_images/zuma/0646.png"
] | null |
rubiks_cube-data-00680-00002 | State Prediction | 2 | Predict the cube state after performing specific moves | states/cube_00680.json | Hard | Medium | [
"blue",
"black",
"orange",
"pink",
"magenta",
"gray",
"white",
"yellow"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 3 | [
"RL_5k_games_images/rubiks_cube/cube_00680.png"
] | null |
star-battle-star_of_region-Easy-00346 | Target Perception | 3 | Given current state and a region,Your task is to indentify which cell provided by options belongs to this region and has been placed a star. | states/board_state_analysis_Easy_346.json | Easy | Easy | [
"(1,4)",
"(0,3)",
"(1,3)",
"(2,2)",
"(2,1)",
"(0,4)",
"(0,1)",
"null"
] |
We have a 5*5 grid.The grid is divided into 5 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 8 | [
"RL_5k_games_images/star-battle/board_state_analysis_Easy_346.png"
] | null |
tetris-01160-max-rows | Strategy Optimization | 3 | maximum rows to be cleared | states/tetris-01160.json | Easy | Hard | null | Rules:
1. The image shows a standard Tetris grid with 8 rows and 8 columns.
2. The number and categories of actions done to the falling tetromino are not restricted, which means you can perform unlimited rotations and translations (moving left, right, or down) to position the tetromino as needed.
3. Only consider rows... | 1 | [
"RL_5k_games_images/tetris/tetris-01160.png"
] | null |
word-mcq-03805 | Target Perception | 1 | letter_count | states/word-mcq-03805.json | Hard | Medium | [
"5",
"8",
"6",
"0",
"3",
"4",
"9",
"2"
] | Rules:
1. The grid contains uppercase letters.
2. Count all occurrences of the specified letter.
Question:
How many times does the letter 'F' appear in the grid?
Options:
1: 5
2: 8
3: 6
4: 0
5: 3
6: 4
7: 9
8: 2 | 8 | [
"RL_5k_games_images/word_search/word-mcq-03805.png"
] | null |
star-battle-star_of_region-Easy-00412 | Target Perception | 3 | Given current state and a region,Your task is to indentify which cell provided by options belongs to this region and has been placed a star. | states/board_state_analysis_Easy_412.json | Easy | Easy | [
"(2,3)",
"(4,4)",
"(2,4)",
"(3,3)",
"(0,0)",
"(3,4)",
"(3,2)",
"(1,4)"
] |
We have a 5*5 grid.The grid is divided into 5 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 6 | [
"RL_5k_games_images/star-battle/board_state_analysis_Easy_412.png"
] | null |
tictactoe-mcq-640-ActionOutcome | Strategy Optimization | 3 | Questions about the outcome to take a specific move of the current player of the board, and the optimal strategy to take a move of the opponent player after the specific move. | states/board_640.json | Easy | Hard | [
"A.None",
"B.(0, 0)",
"C.(0, 1)",
"D.(0, 2)",
"E.(1, 0)",
"F.(1, 1)",
"G.(1, 2)",
"H.(2, 0) or (2, 1) or (2, 2)"
] | Principles: Tic-Tac-Toe is a classic two-player game played on a 3x3 grid, (row, col) from (0, 0) to (2, 2). Players take turns marking a space in the grid, one using **O** (the red block) and the other using **X** (the blue block). In each game, player **O** starts first. The objective is to be the first to get three ... | C | [
"RL_5k_games_images/tictactoe/board_640.png"
] | null |
reconstruction_00634 | Target Perception | 0 | Count the total number of voxels in the given 3D structure. | states/reconstruction_00634.json | Hard | Easy | null | This is a state in a 3D reconstruction game.
Given:
- A 3x3x3 grid structure containing voxels
- A image containing the voxel structure and its target projections (possibly not the projections of the given structure)
(Note: The projections shown in the image are not relevant for this question)
Game Rules:
1. Grid S... | 10 | [
"RL_5k_games_images/3dreconstruction/reconstruction_00634.png"
] | null |
turing-machine-train-03918 | State Prediction | 3 | first_state_entry | states/03918.json | Medium | Medium | [
"2",
"8",
"1",
"4",
"7",
"6",
"5",
"3"
] | Rules:
State 0, Symbol 0 -> Write 0, Move right, New State 0
State 0, Symbol 1 -> Write 2, Move up, New State 1
State 0, Symbol 2 -> Write 2, Move left, New State 1
State 1, Symbol 0 -> Write 0, Move down, New State 1
State 1, Symbol 1 -> Write 0, Move right, New State 0
State 1, Symbol 2 -> Write 0, Move up, New State... | 3 | [
"RL_5k_games_images/2d_turing_machine/03918.png"
] | null |
star-battle-cells_of_region-Easy-00231 | Target Perception | 2 | Given current state and an index of a region.You should idectify which cell provided in the options belongs the region. | states/board_state_analysis_Easy_231.json | Easy | Easy | [
"(0,0)",
"(2,1)",
"(1,3)",
"(4,2)",
"(1,2)",
"(3,2)",
"(3,4)",
"(0,1)"
] |
We have a 5*5 grid.The grid is divided into 5 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 4 | [
"RL_5k_games_images/star-battle/board_state_analysis_Easy_231.png"
] | null |
rubiks_cube-data-00480-00005 | Target Perception | 5 | Count specific colors on a face | states/cube_00480.json | Easy | Easy | [
"5",
"2",
"6",
"9",
"7",
"3",
"4",
"8"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 3 | [
"RL_5k_games_images/rubiks_cube/cube_00480.png"
] | null |
rubiks_cube-data-00446-00005 | Target Perception | 5 | Count specific colors on a face | states/cube_00446.json | Hard | Easy | [
"4",
"1",
"5",
"3",
"6",
"7",
"2",
"0"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 4 | [
"RL_5k_games_images/rubiks_cube/cube_00446.png"
] | null |
word-mcq-01542 | Target Perception | 0 | cell_letter | states/word-mcq-01542.json | Hard | Easy | [
"K",
"W",
"J",
"O",
"I",
"N",
"S",
"U"
] | Rules:
1. The grid contains uppercase letters.
2. Row and column indexes begin from 1 at the top-left corner.
Question:
What letter is at row 3, column 6?
Options:
1: K
2: W
3: J
4: O
5: I
6: N
7: S
8: U | 5 | [
"RL_5k_games_images/word_search/word-mcq-01542.png"
] | null |
turing-machine-train-04197 | State Prediction | 3 | first_state_entry | states/04197.json | Hard | Medium | [
"8",
"4",
"2",
"7",
"5",
"3",
"1",
"6"
] | Rules:
State 0, Symbol 0 -> Write 0, Move left, New State 1
State 0, Symbol 1 -> Write 1, Move up, New State 0
State 0, Symbol 2 -> Write 2, Move down, New State 0
State 1, Symbol 0 -> Write 0, Move up, New State 0
State 1, Symbol 1 -> Write 2, Move right, New State 0
State 1, Symbol 2 -> Write 0, Move right, New State... | 7 | [
"RL_5k_games_images/2d_turing_machine/04197.png"
] | null |
maze_00362_03 | Strategy Optimization | 3 | Find the path to the goal | states/state_00362.json | Medium | Medium | [
"A. right, left, down, up, up, right, left, left, up, down, up, left, down, right, up, up, up, left, down, up, right, right, right, left, left, right",
"B. left, right, down, left, down, left, left, up, right, right, up, down, right, left, right, up, down, left, down, left, down, up, left, down, right, up",
"C.... | **Rules:**
1. This is a maze mini-game.The player needs to navigate around obstacles to reach the destination and achieve victory.
2. The red circle represents the player, the green block is the goal and the blue blocks are obstacles.
3. The player can only move within the white blocks.
4. The coordinates are given in ... | D | [
"RL_5k_games_images/maze/image_00362.png"
] | null |
star-battle-last_star-Easy-00308 | State Prediction | 1 | We have a 5x5 grid. The grid is divided into 5 regions.
The current grid already has 4 stars placed.
Your task is to find the location of the final star to complete the puzzle. | states/board_last_star_Easy_00308.json | Easy | Hard | null |
We have a 5x5 grid. The grid is divided into 5 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink
Region with index 1 has the color of powder blue
Region with index 2 has the color of light green
Region with index 3 has the color of peach
Region with index 4 h... | (0, 3) | [
"RL_5k_games_images/star-battle/board_last_star_Easy_00308.png"
] | null |
langton-mcq-02303 | State Prediction | 2 | Predict the ant's position and direction after several steps | states/board_768.json | Medium | Medium | [
"Position (4, 0), facing right",
"Position (0, 2), facing right",
"Position (8, 6), facing left",
"Position (1, 6), facing right",
"Position (1, 5), facing left",
"Position (1, 5), facing up",
"Position (5, 3), facing left",
"Position (8, 5), facing left"
] | In Langton's Ant, we have a grid where each cell is either white or black. A red arrow represents an ant, showing its current position and direction. The ant follows these simple rules:
1. If the ant is on a white cell, it turns right 90 degrees, changes the cell to black, and moves forward one step
2. If the ant is on... | H | [
"RL_5k_games_images/langton_ant/board_768.png"
] | null |
star-battle-valid_cell-Hard-00242 | State Prediction | 4 | Based on the current puzzle state, your task is to identify which of the following cells provided by the options can a star be placed in? | states/board_state_analysis_Hard_242.json | Hard | Medium | [
"(0,7)",
"(4,7)",
"(1,3)",
"(2,4)",
"(7,1)",
"(6,3)",
"null",
"(3,2)"
] |
We have a 8*8 grid.The grid is divided into 8 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 7 | [
"RL_5k_games_images/star-battle/board_state_analysis_Hard_242.png"
] | null |
rhythm_game-data-00629-04397 | Target Perception | 1 | Find the type of the block in a given coordinate. | states/board_00629.json | Hard | Easy | [
"Non-type",
"Click",
"Reverse",
"Snake Head",
"Snake Body",
"Snake Tail"
] | Now I'll give you a picture, which shows a screenshot of a rhythm game, in which there are operation blocks of various colors. In this game, the operation blocks will fall at a speed of 1 cell/second. At the same time, you can select a column to place your finger (you cannot move your finger after selecting it), and cl... | 2 | [
"RL_5k_games_images/rhythm_game/board_00629.png"
] | null |
tictactoe-mcq-1215-ActionOutcome | Strategy Optimization | 3 | Questions about the outcome to take a specific move of the current player of the board, and the optimal strategy to take a move of the opponent player after the specific move. | states/board_1215.json | Hard | Hard | [
"A.None",
"B.(0, 0)",
"C.(0, 1)",
"D.(0, 2)",
"E.(1, 0)",
"F.(1, 1)",
"G.(1, 2)",
"H.(2, 0) or (2, 1) or (2, 2)"
] | Principles: Tic-Tac-Toe is a classic two-player game played on a 3x3 grid, (row, col) from (0, 0) to (2, 2). Players take turns marking a space in the grid, one using **O** (the red block) and the other using **X** (the blue block). In each game, player **O** starts first. The objective is to be the first to get three ... | C | [
"RL_5k_games_images/tictactoe/board_1215.png"
] | null |
reconstruction_02049 | Target Perception | 2 | Choose how the given 3D structure's projections match with the target projections. | states/reconstruction_02049.json | Medium | Medium | [
"Neither Y-Z projection nor X-Z projection matches the target",
"Only Y-Z projection matches the target",
"Only X-Z projection matches the target",
"Both Y-Z and X-Z projections match the target"
] | This is a state in a 3D reconstruction game.
Given:
- A 3x3x3 grid structure containing voxels
- A image containing the voxel structure and its target projections (possibly not the projections of the given structure)
Game Rules:
1. Grid Space: The game is played on a 3x3x3 cube grid.
2. Coordinates: Position (x,y,z) ... | 4 | [
"RL_5k_games_images/3dreconstruction/reconstruction_02049.png"
] | null |
star-battle-cells_of_region-Hard-00370 | Target Perception | 2 | Given current state and an index of a region.You should idectify which cell provided in the options belongs the region. | states/board_state_analysis_Hard_370.json | Hard | Easy | [
"(0,3)",
"(1,2)",
"(7,3)",
"(0,2)",
"(1,3)",
"(0,1)",
"(5,6)",
"(1,5)"
] |
We have a 8*8 grid.The grid is divided into 8 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 3 | [
"RL_5k_games_images/star-battle/board_state_analysis_Hard_370.png"
] | null |
spider_solitaire-train-00415-6 | State Prediction | 4 | Predict card move result | states/board_00415.json | Hard | Medium | [
"A. The move will be successful, and the cards will be in descending order, following the rules of movement.",
"B. The move cannot be made because this card is face-down and its value is unknown.",
"C. The move cannot be made because there is a card above it, and that card does not form a descending order with ... |
Spider Solitaire
# OBJECTIVE
Spider is played with eight decks of 13 spade cards each, totaling 104 unique cards. The goal is to arrange all cards in a King-to-Ace sequence in the same suit and move them to the foundation piles. Once all sequences are moved to the foundations, the game is won.
# SETUP
The game featu... | D | [
"RL_5k_games_images/spider_solitaire/board_00415.png"
] | null |
tents-new-tent-mcq-00133-which-position-is-valid | State Prediction | 9 | which of the following positions is available to place a new tent? | states/00133.json | Easy | Medium | [
"[3, 6]",
"[6, 6]",
"[0, 5]",
"[6, 1]",
"[4, 5]",
"[2, 3]",
"[4, 3]",
"[0, 2]"
] | This is a Tents puzzle. In this game, you will start with a grid that only marks the positions of the trees, the number of tents that should be in each row, and the number of tents that should be in each column. Your goal is to place the tents step by step on the grid according to the following rules until there are no... | 2 | [
"RL_5k_games_images/tents/00133.png"
] | null |
color-mcq-00463-gradient_pattern | Target Perception | 2 | gradient_pattern | states/color-mcq-00463.json | Easy | Medium | [
"transitioning from cyan to vivid bright purple",
"transitioning from yellow to pale bright purple",
"transitioning from red to light gray",
"transitioning from pale bright yellow to vivid blue",
"transitioning from bright indigo to dark gray",
"transitioning from dark cyan to light gray",
"transitionin... | Rules:
1. Colors change gradually along rows or columns.
2. A gradient transitions between two colors.
3. Each row or column can have its own independent gradient pattern.
4. Row and column indexes begin from 1 at the top-left corner.
Question:
What is the gradient pattern in row 1?
Options:
1: transitioning from cy... | 6 | [
"RL_5k_games_images/hue/color-mcq-00463.png"
] | null |
tengram-mcq-00833-adjacency | Target Perception | 4 | piece_adjacency | states/tengram-mcq-00833.json | Medium | Medium | [
"2",
"1",
"5",
"6",
"3",
"7",
"4",
"0"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
Question:
How many different pieces are adjacent to Piece 1?
Options:
1: 2
2: 1
3: 5
4: 6
5: 3
6: 7
7: 4
8: 0 | 5 | [
"RL_5k_games_images/tengram/tengram-mcq-00833.png"
] | null |
spider_solitaire-train-00344-9 | Strategy Optimization | 6 | Optimal card move selection | states/board_00344.json | Hard | Hard | [
"A. We should move the 4-th card of pile 0 to pile 8.",
"B. We should move the 1-th card of pile 3 to pile 5.",
"C. We should move the 5-th card of pile 7 to pile 5.",
"D. We should move the 1-th card of pile 5 to pile 5.",
"E. We should move the top 5-th card of pile 0 to pile 3.",
"F. We should move the... |
Spider Solitaire
# OBJECTIVE
Spider is played with eight decks of 13 spade cards each, totaling 104 unique cards. The goal is to arrange all cards in a King-to-Ace sequence in the same suit and move them to the foundation piles. Once all sequences are moved to the foundations, the game is won.
# SETUP
The game featu... | E | [
"RL_5k_games_images/spider_solitaire/board_00344.png"
] | null |
ultra_tictactoe-data-00186-01299 | Target Perception | 4 | Find the number of pieces in the image. | states/board_00186.json | Easy | Medium | [
"7",
"32",
"18",
"30",
"19",
"20",
"13",
"33"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 5 | [
"RL_5k_games_images/ultra_tictactoe/board_00186.png"
] | null |
spider_solitaire-train-00109-7 | State Prediction | 4 | Predict card move result | states/board_00109.json | Easy | Medium | [
"A. The move will be successful, and the cards will be in descending order, following the rules of movement.",
"B. The move cannot be made because this card is face-down and its value is unknown.",
"C. The move cannot be made because there is a card above it, and that card does not form a descending order with ... |
Spider Solitaire
# OBJECTIVE
Spider is played with eight decks of 13 spade cards each, totaling 104 unique cards. The goal is to arrange all cards in a King-to-Ace sequence in the same suit and move them to the foundation piles. Once all sequences are moved to the foundations, the game is won.
# SETUP
The game featu... | C | [
"RL_5k_games_images/spider_solitaire/board_00109.png"
] | null |
langton-fill-01185 | State Prediction | 3 | Count how many times a specific cell changes its color | states/board_395.json | Easy | Hard | null | In Langton's Ant, we have a grid where each cell is either white or black. A red arrow represents an ant, showing its current position and direction. The ant follows these simple rules:
1. If the ant is on a white cell, it turns right 90 degrees, changes the cell to black, and moves forward one step
2. If the ant is on... | 1 | [
"RL_5k_games_images/langton_ant/board_395.png"
] | null |
ultra_tictactoe-data-00101-00704 | Target Perception | 4 | Find the number of pieces in the image. | states/board_00101.json | Easy | Medium | [
"17",
"11",
"10",
"20",
"23",
"6",
"21",
"19"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 3 | [
"RL_5k_games_images/ultra_tictactoe/board_00101.png"
] | null |
tengram-mcq-02341-placement | State Prediction | 5 | piece_placement | states/tengram-mcq-02341.json | Easy | Hard | [
"(2,0) to (3,3)",
"(0,0) to (1,3)",
"(1,0) to (2,3)"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
4. Two adjacent pieces have been removed from the board.
5. A valid placement is one where both pieces fit into the hole wi... | 2 | [
"RL_5k_games_images/tengram/tengram-mcq-02341.png"
] | null |
path-mcq-01838 | State Prediction | 1 | sequence_finding | states/path-mcq-01838.json | Easy | Medium | [
"Start -> 3 -> 1 -> 2 -> 4 -> Goal",
"Start -> 2 -> 1 -> 3 -> 4 -> Goal",
"Start -> 3 -> 2 -> 4 -> 1 -> Goal",
"Start -> 3 -> 2 -> 1 -> 4 -> Goal",
"Start -> 1 -> 4 -> 3 -> 2 -> Goal",
"Start -> 3 -> 1 -> 4 -> 2 -> Goal"
] | Rules:
1. Player can only walk on top of cubes
2. Player can climb ladders if they can reach the cube under the ladder
3. From a ladder, player can reach the top of the last cube with the ladder
4. Blue cube is start position, red cube is goal position
5. Green cubes are numbered checkpoints
What is the correct sequen... | 6 | [
"RL_5k_games_images/3d_maze/path-mcq-01838.png"
] | null |
star-battle-valid_cell-Hard-00183 | State Prediction | 4 | Based on the current puzzle state, your task is to identify which of the following cells provided by the options can a star be placed in? | states/board_state_analysis_Hard_183.json | Hard | Medium | [
"(2,5)",
"(2,1)",
"(6,4)",
"(1,7)",
"(2,0)",
"(0,4)",
"(2,6)",
"(4,3)"
] |
We have a 8*8 grid.The grid is divided into 8 regions.
Cells with the same color belong to the same region.
Region with index 0 has the color of light pink.
Region with index 1 has the color of powder blue.
Region with index 2 has the color of light green.
Region with index 3 has the color of peach.
Region with index ... | 7 | [
"RL_5k_games_images/star-battle/board_state_analysis_Hard_183.png"
] | null |
tetris-01118-onestep-outcome | State Prediction | 2 | timesteps_until_collision | states/tetris-01118.json | Easy | Medium | null | Rules:
1. The image shows a standard Tetris grid with 8 rows and 8 columns.
2. The first number in a cell coordinate represents the row, and the second number represents the column.3. The action done to the falling tetromino is randomly selected between moved to left / right.
4. The active tetromino falls one row ever... | -1 | [
"RL_5k_games_images/tetris/tetris-01118.png"
] | null |
tengram-mcq-04467-piece_count | Target Perception | 1 | piece_count | states/tengram-mcq-04467.json | Hard | Easy | [
"4",
"0",
"6",
"1",
"7",
"5",
"2",
"3"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
4. Some pieces have been removed and are shown below the main board.
Question:
How many pieces are currently on the main b... | 7 | [
"RL_5k_games_images/tengram/tengram-mcq-04467.png"
] | null |
path-mcq-01258 | State Prediction | 1 | sequence_finding | states/path-mcq-01258.json | Easy | Medium | [
"Start -> 4 -> 1 -> 3 -> 2 -> Goal",
"Start -> 1 -> 2 -> 4 -> 3 -> Goal",
"Start -> 4 -> 2 -> 3 -> 1 -> Goal",
"Start -> 3 -> 1 -> 2 -> 4 -> Goal",
"Start -> 1 -> 4 -> 3 -> 2 -> Goal",
"Start -> 3 -> 2 -> 4 -> 1 -> Goal"
] | Rules:
1. Player can only walk on top of cubes
2. Player can climb ladders if they can reach the cube under the ladder
3. From a ladder, player can reach the top of the last cube with the ladder
4. Blue cube is start position, red cube is goal position
5. Green cubes are numbered checkpoints
What is the correct sequen... | 6 | [
"RL_5k_games_images/3d_maze/path-mcq-01258.png"
] | null |
tents-mcq-00300-which-position-has-tree | Target Perception | 8 | which of the following positions contains a tree? | states/00300.json | Medium | Easy | [
"[6, 8]",
"[8, 6]",
"[1, 0]",
"[9, 5]",
"[3, 2]",
"[4, 4]",
"[6, 4]",
"[5, 9]"
] | This is a Tents puzzle. In this game, you will start with a grid that only marks the positions of the trees, the number of tents that should be in each row, and the number of tents that should be in each column. Your goal is to place the tents step by step on the grid according to the following rules until there are no... | 5 | [
"RL_5k_games_images/tents/00300.png"
] | null |
zuma-mcq-01603 | Target Perception | 4 | The color of the marble that the frog hits if it shoots at 15 degrees. | states/0321.json | Medium | Medium | [
"red",
"yellow",
"blue",
"green",
"none"
] | This is a Zuma game. You need to control a frog to shoot colored marbles from its mouth toward a winding track of approaching marbles. Your goal is to clear all marbles before they reach the black hole at the end of the track. The marbles roll steadily along the track, and the player must fire marbles to create groups ... | yellow | [
"RL_5k_games_images/zuma/0321.png"
] | null |
rubiks_cube-data-00348-00003 | State Prediction | 3 | Find the sequence of moves between two cube states | states/cube_00348.json | Easy | Hard | [
"5",
"6",
"1",
"3",
"8",
"9",
"4",
"10"
] | Rules: As shown in the figure, the Rubik's cube consists of both 3D views and an unfolded view. The 3D views show the cube from two angles: left-tilted 30 degrees looking down, and right-tilted ,30 degrees looking up. The cube has six faces: Upper (U), Down (D), Left (L), Right (R), Front (F), and Back (B). Each face c... | 3 | [
"RL_5k_games_images/rubiks_cube/cube_00348.png"
] | null |
path-mcq-03531 | Target Perception | 2 | height_comparison | states/path-mcq-03531.json | Easy | Easy | [
"3 < 2 < 1",
"2 < 1 < 3",
"1 = 2 < 3",
"1 < 2 = 3",
"2 = 3 < 1",
"3 < 1 < 2",
"3 < 1 = 2",
"1 < 3 < 2"
] | Rules:
1. Player can only walk on top of cubes
2. Player can climb ladders if they can reach the cube under the ladder
3. From a ladder, player can reach the top of the last cube with the ladder
4. Blue cube is start position, red cube is goal position
5. Green cubes are numbered points (1, 2, and 3)
What is the corre... | 7 | [
"RL_5k_games_images/3d_maze/path-mcq-03531.png"
] | null |
tengram-mcq-04371-placement | State Prediction | 5 | piece_placement | states/tengram-mcq-04371.json | Hard | Hard | [
"(0,4) to (6,6)",
"(0,6) to (6,8)",
"(2,5) to (8,7)",
"(2,1) to (8,3)",
"(0,1) to (6,3)",
"(2,2) to (8,4)",
"(0,5) to (6,7)",
"(1,6) to (7,8)"
] | Rules:
1. Each numbered region represents a piece on the board.
2. Pieces are considered adjacent if they share at least one edge.
3. Pieces that only touch at corners are not considered adjacent.
4. Two adjacent pieces have been removed from the board.
5. A valid placement is one where both pieces fit into the hole wi... | 8 | [
"RL_5k_games_images/tengram/tengram-mcq-04371.png"
] | null |
langton-mcq-04244 | State Prediction | 2 | Predict the ant's position and direction after several steps | states/board_1415.json | Hard | Medium | [
"Position (11, 8), facing right",
"Position (6, 5), facing down",
"Position (3, 3), facing down",
"Position (9, 1), facing up",
"Position (6, 9), facing left",
"Position (6, 0), facing down",
"Position (4, 7), facing right",
"Position (11, 8), facing left"
] | In Langton's Ant, we have a grid where each cell is either white or black. A red arrow represents an ant, showing its current position and direction. The ant follows these simple rules:
1. If the ant is on a white cell, it turns right 90 degrees, changes the cell to black, and moves forward one step
2. If the ant is on... | C | [
"RL_5k_games_images/langton_ant/board_1415.png"
] | null |
reconstruction_04224 | Strategy Optimization | 5 | Find the minimum number of additional voxels needed to match both target projections. | states/reconstruction_04224.json | Easy | Hard | null | You are in the middle of a 3D reconstruction puzzle.
The current structure has some initial voxels, and your goal is to complete it as the game rules.
Game Rules:
1. Goal: Reconstruct a 3D structure by adding voxels to match given projections.
2. Grid Space: The game is played on a 3x3x3 cube grid.
3. Coordinates: Pos... | 3 | [
"RL_5k_games_images/3dreconstruction/reconstruction_04224.png"
] | null |
ultra_tictactoe-data-00021-00141 | Target Perception | 1 | Find which player marked the cell at a given coordinate. | states/board_00021.json | Easy | Easy | [
"First Player",
"Second Player",
"Not Marked"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 1 | [
"RL_5k_games_images/ultra_tictactoe/board_00021.png"
] | null |
space_invaders-fill-00658 | Target Perception | 1 | Ask the number of enemies in a column | states/space_invaders_00074.json | Easy | Easy | null | The given image represents a simplified interface of the game Space Invaders. The enemy area is implicitly divided into a grid of cells, with the row and column numbers shown on the left and top sides of the grid respectively which you should strictly follow. Each cell is either empty or occupied by an incoming enemy w... | 1 | [
"RL_5k_games_images/space_invaders/space_invaders_00074.png"
] | null |
tetris-03118-onestep-outcome | State Prediction | 2 | timesteps_until_collision | states/tetris-03118.json | Medium | Medium | null | Rules:
1. The image shows a standard Tetris grid with 12 rows and 12 columns.
2. The first number in a cell coordinate represents the row, and the second number represents the column.3. The action done to the falling tetromino is randomly selected between moved to left / right.
4. The active tetromino falls one row ev... | 1 | [
"RL_5k_games_images/tetris/tetris-03118.png"
] | null |
tictactoe-mcq-1114-StrategyOptimization | Strategy Optimization | 2 | Questions about the optimal strategy to take a move of the current player of the board. | states/board_1114.json | Hard | Medium | [
"A.None",
"B.(0, 0)",
"C.(0, 1)",
"D.(0, 2)",
"E.(1, 0)",
"F.(1, 1)",
"G.(1, 2)",
"H.(2, 0) or (2, 1) or (2, 2)"
] | Principles: Tic-Tac-Toe is a classic two-player game played on a 3x3 grid, (row, col) from (0, 0) to (2, 2). Players take turns marking a space in the grid, one using **O** (the red block) and the other using **X** (the blue block). In each game, player **O** starts first. The objective is to be the first to get three ... | A | [
"RL_5k_games_images/tictactoe/board_1114.png"
] | null |
sokoban-data-00567-00002 | State Prediction | 2 | Given a sequence of moves, predict the final position of the box | states/board_00567.json | Easy | Medium | [
"(1, 2)",
"(3, 3)",
"(3, 2)",
"(2, 2)",
"(3, 1)",
"(2, 3)",
"(2, 1)",
"(1, 3)"
] | This is a Sokoban puzzle where black figure is player, green X is target, brown box with X is box to push, brown tiles are walls, and light brown areas are movable spaces.The coordinates (x, y) in this puzzle represent the matrix format.Treat boxes as objects that can move by themselves, and treat people as floor (mova... | 5 | [
"RL_5k_games_images/sokoban/board_00567.png"
] | null |
turing-machine-train-02108 | State Prediction | 1 | head_state | states/02108.json | Hard | Medium | [
"[0]",
"(1)",
"[2]",
"[1]",
"(0)",
"(2)"
] | Rules:
State 0, Symbol 0 -> Write 1, Move right, New State 1
State 0, Symbol 1 -> Write 1, Move down, New State 1
State 0, Symbol 2 -> Write 1, Move up, New State 0
State 1, Symbol 0 -> Write 0, Move down, New State 1
State 1, Symbol 1 -> Write 2, Move left, New State 1
State 1, Symbol 2 -> Write 0, Move up, New State ... | 1 | [
"RL_5k_games_images/2d_turing_machine/02108.png"
] | null |
ultra_tictactoe-data-00095-00660 | Target Perception | 2 | Given the coordinate of last step, find the number of possible coordinates of next step. | states/board_00095.json | Easy | Easy | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | Now I'll give you a picture, which shows a screenshot of Ultra TicTacToe. The introduction of Ultra TicTacToe is as follows:
1. Board and coordinate representation: In this game, the board is divided into 9 3*3 squares(called Nine-grids). At the same time, we use $(i, j, row, col)$ to represent the coordinates of a cel... | 8 | [
"RL_5k_games_images/ultra_tictactoe/board_00095.png"
] | null |
tents-fill-00075-missing-tents-in-grid | Target Perception | 4 | how many tents are still missing in the entire grid? | states/00075.json | Easy | Medium | null | This is a Tents puzzle. In this game, you will start with a grid that only marks the positions of the trees, the number of tents that should be in each row, and the number of tents that should be in each column. Your goal is to place the tents step by step on the grid according to the following rules until there are no... | 2 | [
"RL_5k_games_images/tents/00075.png"
] | null |
free_cell-specified_card-Medium-00235 | Target Perception | 1 | Given a particular game state, the puzzle will present a question about which card is at a specific position in one of the cascade piles.Your task is to indentify the card in the options. | states/state_analysis_Medium_00235.json | Medium | Easy | [
"(Heart, 8)",
"(Spade, 7)",
"(Club, Q)",
"(Diamond, 6)",
"(Diamond, Q)",
"(Spade, Q)",
"(Club, K)",
"(Diamond, 2)"
] | In this FreeCell game:
we have 6 cascade piles at sum, and their indexes are [0, 1, 2, 3, 4, 5]We have 4 freecell on the left top, and their indexes are 0,1,2,3.We have 4 foundation piles on the right top, and their indexes are 0,1,2,3.In FreeCell, cards can be moved according to specific rules: A card can be moved to ... | 4 | [
"RL_5k_games_images/freecell/state_analysis_Medium_00235.png"
] | null |
word-mcq-01432 | Target Perception | 1 | letter_count | states/word-mcq-01432.json | Hard | Medium | [
"2",
"3",
"7",
"16",
"5",
"0",
"4",
"1"
] | Rules:
1. The grid contains uppercase letters.
2. Count all occurrences of the specified letter.
Question:
How many times does the letter 'R' appear in the grid?
Options:
1: 2
2: 3
3: 7
4: 16
5: 5
6: 0
7: 4
8: 1 | 8 | [
"RL_5k_games_images/word_search/word-mcq-01432.png"
] | null |
color-mcq-04537-color_matching | State Prediction | 0 | color_matching | states/color-mcq-04537.json | Hard | Hard | [
"1",
"2",
"3",
"4",
"5",
"6"
] | Rules:
1. Colors change gradually along rows or columns.
2. A gradient transitions between two colors.
3. Each row or column can have its own independent gradient pattern.
4. Row and column indexes begin from 1 at the top-left corner.
Question:
Which color should be put in cell F?
Options:
Colors are numbered from 1... | 5 | [
"RL_5k_games_images/hue/color-mcq-04537.png"
] | null |
space_invaders-mcq-00128 | Target Perception | 2 | Ask the number of enemies in a row | states/space_invaders_00015.json | Easy | Easy | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
] | The given image represents a simplified interface of the game Space Invaders. The enemy area is implicitly divided into a grid of cells, with the row and column numbers shown on the left and top sides of the grid respectively which you should strictly follow. Each cell is either empty or occupied by an incoming enemy w... | 3 | [
"RL_5k_games_images/space_invaders/space_invaders_00015.png"
] | null |
maze_00590_04 | Strategy Optimization | 4 | Count how many turns it takes to reach the finish. | states/state_00590.json | Hard | Hard | null | **Rules:**
1. This is a maze mini-game.The player needs to navigate around obstacles to reach the destination and achieve victory.
2. The red circle represents the player, the green block is the goal and the blue blocks are obstacles.
3. The player can only move within the white blocks.
4. The coordinates are given in ... | 14 | [
"RL_5k_games_images/maze/image_00590.png"
] | null |
free_cell-card_after_move-Hard-00471 | State Prediction | 3 | Given a particular game state,a selected move and a selected cascade pile, the puzzle will present a question about which card is at the top of the cascade pile.
Your task is to indentify the card in the options. | states/state_analysis_Hard_00471.json | Hard | Hard | [
"(Club, 1)",
"(Diamond, 5)",
"(Club, 4)",
"(Diamond, A)",
"(Spade, 5)",
"(Heart, 8)",
"(Spade, A)",
"(Heart, 7)"
] | In this FreeCell game:
we have 4 cascade piles, and their indexes are [0, 1, 2, 3]We have 4 freecell on the left top, and their indexes are 0,1,2,3.We have 4 foundation piles on the right top, and their indexes are 0,1,2,3.In FreeCell, cards can be moved according to specific rules: A card can be moved to a free cell i... | 7 | [
"RL_5k_games_images/freecell/state_analysis_Hard_00471.png"
] | null |
tents-fill-00037-missing-tents-in-column | Target Perception | 3 | how many tents are still missing in a randomly selected column? | states/00037.json | Easy | Easy | null | This is a Tents puzzle. In this game, you will start with a grid that only marks the positions of the trees, the number of tents that should be in each row, and the number of tents that should be in each column. Your goal is to place the tents step by step on the grid according to the following rules until there are no... | 0 | [
"RL_5k_games_images/tents/00037.png"
] | null |
word-mcq-00059 | Target Perception | 1 | letter_count | states/word-mcq-00059.json | Easy | Medium | [
"10",
"0",
"1",
"2",
"8",
"7",
"5",
"4"
] | Rules:
1. The grid contains uppercase letters.
2. Count all occurrences of the specified letter.
Question:
How many times does the letter 'F' appear in the grid?
Options:
1: 10
2: 0
3: 1
4: 2
5: 8
6: 7
7: 5
8: 4 | 4 | [
"RL_5k_games_images/word_search/word-mcq-00059.png"
] | null |
space_invaders-fill-01768 | Target Perception | 1 | Ask the number of enemies in a column | states/space_invaders_00198.json | Medium | Easy | null | The given image represents a simplified interface of the game Space Invaders. The enemy area is implicitly divided into a grid of cells, with the row and column numbers shown on the left and top sides of the grid respectively which you should strictly follow. Each cell is either empty or occupied by an incoming enemy w... | 2 | [
"RL_5k_games_images/space_invaders/space_invaders_00198.png"
] | null |
turing-machine-train-01233 | State Prediction | 0 | position | states/01233.json | Easy | Medium | [
"(2, 2)",
"(0, 0)",
"(1, 2)",
"(0, 2)",
"(1, 0)",
"(2, 0)",
"(2, 1)",
"(0, 1)"
] | Rules:
State 0, Symbol 0 -> Write 2, Move up, New State 2
State 0, Symbol 1 -> Write 0, Move down, New State 2
State 0, Symbol 2 -> Write 2, Move up, New State 2
State 1, Symbol 0 -> Write 2, Move down, New State 2
State 1, Symbol 1 -> Write 0, Move up, New State 0
State 1, Symbol 2 -> Write 0, Move right, New State 1
... | 8 | [
"RL_5k_games_images/2d_turing_machine/01233.png"
] | null |
rhythm_game-data-00243-01696 | Target Perception | 2 | Find the percentage of cells with blocks, retaining 3 significant figures. | states/board_00243.json | Medium | Easy | null | Now I'll give you a picture, which shows a screenshot of a rhythm game, in which there are operation blocks of various colors. In this game, the operation blocks will fall at a speed of 1 cell/second. At the same time, you can select a column to place your finger (you cannot move your finger after selecting it), and cl... | 0.778 | [
"RL_5k_games_images/rhythm_game/board_00243.png"
] | null |
reconstruction_03385 | State Prediction | 4 | Choose the correct sequence of voxel additions that will make the structure match the target projection(s) while following game rules. | states/reconstruction_03385.json | Easy | Hard | [
"Add voxels at positions: [(1, 3, 2)]",
"Add voxels at positions: [(1, 2, 2), (1, 3, 2), (2, 3, 1)]",
"Add voxels at positions: [(1, 1, 1), (1, 2, 2), (2, 2, 1), (2, 3, 1)]",
"Add voxels at positions: [(1, 1, 1), (2, 1, 1), (3, 1, 1)]",
"Add voxels at positions: [(1, 1, 1), (1, 2, 2)]",
"Add voxels at pos... | You are in the middle of a 3D reconstruction puzzle.
The current structure has some initial voxels, and your goal is to complete it as the game rules.
Game Rules:
1. Goal: Reconstruct a 3D structure by adding voxels to match given projections.
2. Grid Space: The game is played on a 3x3x3 cube grid.
3. Coordinates: Pos... | 4 | [
"RL_5k_games_images/3dreconstruction/reconstruction_03385.png"
] | null |
tictactoe-mcq-1534-StrategyOptimization | Strategy Optimization | 2 | Questions about the optimal strategy to take a move of the current player of the board. | states/board_1534.json | Hard | Medium | [
"A.None",
"B.(0, 0)",
"C.(0, 1)",
"D.(0, 2)",
"E.(1, 0)",
"F.(1, 1)",
"G.(1, 2)",
"H.(2, 0) or (2, 1) or (2, 2)"
] | Principles: Tic-Tac-Toe is a classic two-player game played on a 3x3 grid, (row, col) from (0, 0) to (2, 2). Players take turns marking a space in the grid, one using **O** (the red block) and the other using **X** (the blue block). In each game, player **O** starts first. The objective is to be the first to get three ... | B | [
"RL_5k_games_images/tictactoe/board_1534.png"
] | null |
reconstruction_03481 | State Prediction | 4 | Choose the correct sequence of voxel additions that will make the structure match the target projection(s) while following game rules. | states/reconstruction_03481.json | Easy | Hard | [
"Add voxels at positions: [(1, 1, 3)]",
"Add voxels at positions: [(1, 1, 1)]",
"Add voxels at positions: [(2, 1, 2), (2, 2, 1), (3, 1, 2), (3, 2, 1)]",
"Add voxels at positions: [(2, 2, 1)]",
"Add voxels at positions: [(3, 2, 1)]",
"Add voxels at positions: [(1, 1, 1), (2, 1, 2), (2, 2, 1), (3, 1, 2), (3... | You are in the middle of a 3D reconstruction puzzle.
The current structure has some initial voxels, and your goal is to complete it as the game rules.
Game Rules:
1. Goal: Reconstruct a 3D structure by adding voxels to match given projections.
2. Grid Space: The game is played on a 3x3x3 cube grid.
3. Coordinates: Pos... | 7 | [
"RL_5k_games_images/3dreconstruction/reconstruction_03481.png"
] | null |
rhythm_game-data-00678-04745 | Strategy Optimization | 6 | Find choosing which column to click can get the highest score. | states/board_00678.json | Hard | Hard | [
"1",
"2",
"3",
"4",
"5",
"6"
] | Now I'll give you a picture, which shows a screenshot of a rhythm game, in which there are operation blocks of various colors. In this game, the operation blocks will fall at a speed of 1 cell/second. At the same time, you can select a column to place your finger (you cannot move your finger after selecting it), and cl... | 5 | [
"RL_5k_games_images/rhythm_game/board_00678.png"
] | null |
turing-machine-train-00560 | State Prediction | 0 | position | states/00560.json | Medium | Medium | [
"(4, 0)",
"(2, 2)",
"(2, 1)",
"(1, 2)",
"(3, 2)",
"(3, 1)",
"(1, 1)",
"(0, 0)"
] | Rules:
State 0, Symbol 0 -> Write 2, Move up, New State 1
State 0, Symbol 1 -> Write 2, Move down, New State 0
State 0, Symbol 2 -> Write 2, Move left, New State 0
State 1, Symbol 0 -> Write 2, Move down, New State 0
State 1, Symbol 1 -> Write 1, Move up, New State 0
State 1, Symbol 2 -> Write 0, Move right, New State ... | 7 | [
"RL_5k_games_images/2d_turing_machine/00560.png"
] | null |
langton-mcq-02548 | Target Perception | 1 | Identify the current position and direction of the ant | states/board_850.json | Medium | Easy | [
"Position (2, 8), facing right",
"Position (2, 8), facing left",
"Position (0, 0), facing right",
"Position (1, 6), facing down",
"Position (7, 1), facing down",
"Position (0, 4), facing down",
"Position (7, 6), facing down",
"Position (0, 6), facing left"
] | In Langton's Ant, we have a grid where each cell is either white or black. A red arrow represents an ant, showing its current position and direction. The ant follows these simple rules:
1. If the ant is on a white cell, it turns right 90 degrees, changes the cell to black, and moves forward one step
2. If the ant is on... | G | [
"RL_5k_games_images/langton_ant/board_850.png"
] | null |
End of preview.