qa_type stringclasses 4
values | question_id int64 0 9 | question_description stringclasses 117
values | image imagewidth (px) 170 868 | plot_level stringclasses 3
values | qa_level stringclasses 3
values | question stringlengths 111 9.46k | answer stringclasses 25
values | options listlengths 3 10 | game_name stringclasses 29
values | game_type stringclasses 4
values |
|---|---|---|---|---|---|---|---|---|---|---|
Strategy Optimization | 3 | A move_effectiveness question about the current state of Klondike Solitaire | Easy | Hard |
The given image represents the interface of the game Klondike Solitaire. The user interface consists of a board with 52 playing cards divided into four distinct areas:
1. **Stock Pile (Draw Pile):** Initially composed of 24 face-down cards. The player can draw one card at a time to reveal its face.
2. **Waste Pile (... | 2 | [
"Move from Tab6 to Tab7",
"Move from Tab2 to Foundation 2",
"Move from Tab3 to Tab4",
"Move from Tab1 to Tab7",
"Move from Tab4 to Tab5",
"Move from Tab2 to Tab5",
"Move from Tab2 to Tab3",
"None of these moves are both valid and effective"
] | klondike | Pattern Recognition & Matching | |
Target Perception | 5 | Ask the available directions to move are currently | Easy | Easy | **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.
**Question:** Which directions ... | E | [
"A. down",
"B. right",
"C. up, down",
"D. up, right",
"E. left, right",
"F. up, dow, left",
"G. down, left, right",
"H. up, down, left, right"
] | maze | Strategy Planning | |
State Prediction | 3 | first_state_entry | Medium | Medium | Rules:
State 0, Symbol 0 -> Write 1, Move up, New State 0
State 0, Symbol 1 -> Write 3, Move up, New State 1
State 0, Symbol 2 -> Write 0, Move down, New State 1
State 0, Symbol 3 -> Write 2, Move down, New State 1
State 1, Symbol 0 -> Write 2, Move left, New State 0
State 1, Symbol 1 -> Write 0, Move down, New State 0... | 4 | [
"8",
"7",
"4",
"1",
"3",
"5",
"2",
"6"
] | 2d_turing_machine | Multi-step Reasoning | |
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? | Hard | Medium |
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 ... | 2 | [
"(4,0)",
"null",
"(0,5)",
"(2,0)",
"(5,1)",
"(2,3)",
"(3,2)",
"(7,4)"
] | star_battle | Multi-step Reasoning | |
Target Perception | 1 | A board_state question about the current state of Klondike Solitaire | Medium | Easy |
The given image represents the interface of the game Klondike Solitaire. The user interface consists of a board with 52 playing cards divided into four distinct areas:
1. **Stock Pile (Draw Pile):** Initially composed of 24 face-down cards. The player can draw one card at a time to reveal its face.
2. **Waste Pile (... | 5 | [
"Move from Tab4 to Tab6",
"Move from Tab4 to Foundation 4",
"Move from Tab4 to Tab2",
"Move from Waste Pile to Tab4",
"Move from Tab5 to Tab1",
"Move from Tab1 to Foundation 4",
"Move from Tab5 to Foundation 4",
"No possible moves from the options"
] | klondike | Pattern Recognition & Matching | |
Target Perception | 5 | Provide the higher level status of a coordinate: Is the coordinate legal? Does it contain a ball? Can the ball be taken? Can a ball be placed? | Easy | Medium | Pyramid Chess Rules:
0.Game Board:
The game board is square and comes in various sizes: 3x3, 4x4, or 5x5. On an nxn board, there are n levels (0 to n-1). At each level k, the x and y coordinates range from 0 to n-1-k, resulting in (n-k)**2 slots per level. The slots in the lower levels act as the base for the slots in ... | 5 | [
"The coordinate is out of bound",
"It contain a ball and the ball can't be taken",
"It contain a ball and can be taken",
"It doesn't contain a ball and the player can put a ball here this turn",
"It doesn't contain a ball and the player can't put a ball here this turn"
] | pyramidchess | 3D Spatial Perception & Reasoning | |
State Prediction | 5 | piece_placement | Medium | Hard | 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... | 1 | [
"(0,1) to (2,6)",
"(2,1) to (4,6)",
"(0,0) to (2,5)",
"(1,0) to (3,5)",
"(2,0) to (4,5)",
"(1,1) to (3,6)"
] | tengram | Pattern Recognition & Matching | |
State Prediction | 1 | Asking the number of moves to solve the puzzle | Medium | Hard | This game is called Chess Ranger. The rules are as follows:Pieces move like in standard chess.You can only perform capture moves.The king is allowed to be captured.The goal is to end up with a single piece remaining on the board.How many steps are needed to solve the puzzle?Choose from the following options:A.6,B.8,C.7... | G | [
"A.6",
"B.8",
"C.7",
"D.2",
"E.9",
"F.3",
"G.4",
"H.5"
] | chess_ranger | Strategy Planning | |
Target Perception | 4 | Asking a piece located at a specific square | Easy | Easy | What piece is at e3?Choose from the following options:A.Pawn,B.Rook,C.Knight,D.Bishop,E.Queen,F.King,G.No Piece | E | [
"A.Pawn",
"B.Rook",
"C.Knight",
"D.Bishop",
"E.Queen",
"F.King",
"G.No Piece"
] | chess_ranger | Strategy Planning | |
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. | Hard | Easy | 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... | 2 | [
"(Heart, 3)",
"(Heart, A)",
"(Heart, 2)",
"(Club, 3)",
"(Club, 1)",
"(Spade, K)",
"(Diamond, A)",
"(Spade, 5)"
] | freecell | Pattern Recognition & Matching | |
Target Perception | 1 | Check color state at position | Easy | Easy | This is a sudoku game in which the board is filled with a total number of colours equal to the length of the board's sides, and no rows, columns or squares are allowed to have duplicate colours.You should fill the empty cells on the board with following 4 colors: red, green, blue, magenta.In this Sudoku board, the row ... | D | [
"A.red",
"B.green",
"C.blue",
"D.magenta"
] | sudoku | Multi-step Reasoning | |
State Prediction | 4 | Predict cell reveal outcome | Easy | Hard | This is a Minesweeper game. The size of the chessboard is 4x4, and there are a total of 3 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | C | [
"A: The game will end because the cell contains a mine. ",
"B: The cell will reveal an empty area, and adjacent cells will also be revealed. ",
"C: The cell will reveal the number 1. ",
"D: The cell will reveal the number 0."
] | minesweeper | Multi-step Reasoning | |
Target Perception | 2 | Choose how the given 3D structure's projections match with the target projections. | Hard | Medium | 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) ... | 1 | [
"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"
] | 3d_reconstruction | 3D Spatial Perception & Reasoning | |
Target Perception | 1 | Choose the position that contains a voxel from the given options. | Hard | Easy | 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... | 4 | [
"(1,3,3)",
"(3,2,3)",
"(1,2,1)",
"(3,3,1)",
"(2,3,1)",
"(1,1,3)"
] | 3d_reconstruction | 3D Spatial Perception & Reasoning | |
Target Perception | 2 | gradient_pattern | Medium | Medium | 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 4?
Options:
1: transitioning from bl... | 5 | [
"transitioning from blue to pale bright orange",
"transitioning from vivid green to black",
"transitioning from bright red to vivid dark green",
"transitioning from vivid purple to light gray",
"transitioning from vivid purple to vivid bright purple",
"transitioning from bright orange to dark gray",
"tr... | hue | Pattern Recognition & Matching | |
State Prediction | 2 | Predict the cube state after performing specific moves | Easy | Medium | 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... | 1 | [
"blue",
"purple",
"brown",
"gray",
"magenta",
"yellow",
"pink",
"cyan"
] | rubiks_cube | 3D Spatial Perception & Reasoning | |
Strategy Optimization | 2 | Questions about the optimal strategy to take a move of the current player of the board. | Hard | Medium | 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 | [
"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)"
] | tictactoe | Strategy Planning | |
Target Perception | 0 | cell_letter | Medium | Easy | 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 2, column 5?
Options:
1: A
2: F
3: B
4: R
5: E
6: C
7: P
8: O | 2 | [
"A",
"F",
"B",
"R",
"E",
"C",
"P",
"O"
] | word_search | Multi-step Reasoning | |
State Prediction | 0 | color_matching | Medium | Hard | 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 D?
Options:
Colors are numbered from 1... | 3 | [
"1",
"2",
"3",
"4",
"5",
"6"
] | hue | Pattern Recognition & Matching | |
Strategy Optimization | 3 | Find the path to the goal | Easy | Medium | **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.
**Question:** Which sequence of... | A | [
"A. right, right, right, right, right, up, up, up, up",
"B. up, right, right, right, right, up, down, up, right, up",
"C. up, down, down, down, left, right, down, left, down, down",
"D. up, up, down, up, right, left, right, right, up, up",
"E. left, left, left, right, down, down, up, right, down, down"
] | maze | Strategy Planning | |
Strategy Optimization | 3 | A move_effectiveness question about the current state of Klondike Solitaire | Medium | Hard |
The given image represents the interface of the game Klondike Solitaire. The user interface consists of a board with 52 playing cards divided into four distinct areas:
1. **Stock Pile (Draw Pile):** Initially composed of 24 face-down cards. The player can draw one card at a time to reveal its face.
2. **Waste Pile (... | 5 | [
"Move from Tab4 to Tab7",
"Move from Tab4 to Tab5",
"Move from Tab2 to Tab6",
"Move from Tab3 to Tab6",
"Move from Tab1 to Foundation 2",
"Move from Tab1 to Tab7",
"Move from Tab2 to Tab5",
"None of these moves are both valid and effective"
] | klondike | Pattern Recognition & Matching | |
State Prediction | 3 | Which will happen until this process ends if the snake moves like this each step: | Hard | Hard | This is a Snake game. The yellow block is the head of the snake. The blue block is the body of the snake. The red block is the food. The coordinates (x, y) in the grid represent the matrix format, where x is the row index and y is the column index. The origin (0,0) is in the the upper left of the grid. You need to cont... | 0 | [
"The snake hits the bound of the grid.",
"The snake hits its body.",
"The snake reaches the food.",
"Nothing happens."
] | snake | Strategy Planning | |
State Prediction | 2 | Questions about predicting the number of live cells after 1 iteration | Easy | Medium | Conway's Game of Life is a cellular automaton where each cell in the grid can be either alive (black) or dead (white).
Each cell interacts with its eight neighbors, which are the cells that are horizontally, vertically, or diagonally adjacent. For a cell at position (r,c), its neighbors are:
- (r-1,c-1) (r-1,c) (r-... | B | [
"A: 8",
"B: 9",
"C: 1",
"D: 0",
"E: 7",
"F: 6",
"G: 4",
"H: 3"
] | lifegame | Multi-step Reasoning | |
State Prediction | 1 | head_state | Medium | Medium | Rules:
State 0, Symbol 0 -> Write 4, Move left, New State 1
State 0, Symbol 1 -> Write 3, Move up, New State 1
State 0, Symbol 2 -> Write 1, Move left, New State 1
State 0, Symbol 3 -> Write 0, Move up, New State 1
State 0, Symbol 4 -> Write 2, Move left, New State 0
State 1, Symbol 0 -> Write 0, Move down, New State 1... | 5 | [
"[0]",
"(2)",
"(4)",
"(0)",
"[3]",
"[2]",
"(3)",
"[4]"
] | 2d_turing_machine | Multi-step Reasoning | |
State Prediction | 3 | Simulate clear operation | Easy | Medium |
# **Game Overview**
Jewel2 is a strategic puzzle game played on a grid. Your primary objective is to eliminate elements by forming horizontal or vertical lines of three or more identical items. Successfully eliminating elements increases your score and clears space on the board for new elements to appear.
# **Element... | B | [
"A. Nothing will happen because the clear does not meet elimination conditions.",
"B. Trigger a special element, total cleared becomes 37.",
"C. Perform elimination, eliminate 1 elements, total cleared becomes 38.",
"D. Perform elimination, eliminate 1 elements, total cleared becomes 37.E. Perform elimination... | jewel2 | Pattern Recognition & Matching | |
Target Perception | 3 | Check cell state | Hard | Easy | This is a Minesweeper game. The size of the chessboard is 6x6, and there are a total of 8 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | A | [
"A. It is revealed and shows a number. ",
"B. It is flagged as mine. ",
"C. It is still hidden. ",
"D. It is revealed and shows no more information."
] | minesweeper | Multi-step Reasoning | |
Target Perception | 2 | Ask the position of goal within the maze. | Medium | Easy | **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.
**Question:** Which of the foll... | E | [
"A. (3, 10)",
"B. (4, 9)",
"C. (3, 8)",
"D. (2, 9)",
"E. (3, 9)"
] | maze | Strategy Planning | |
Target Perception | 5 | Find the points the given player has got within the given Nine-grid. | Medium | Medium | 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 | [
"14",
"10",
"7",
"8",
"9",
"6",
"4",
"0"
] | ultra_tictactoe | Strategy Planning | |
State Prediction | 4 | Predict cell reveal outcome | Hard | Hard | This is a Minesweeper game. The size of the chessboard is 6x6, and there are a total of 8 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | D | [
"A: The game will end because the cell contains a mine. ",
"B: The cell will reveal an empty area, and adjacent cells will also be revealed. ",
"C: The cell will reveal the number 8. ",
"D: The cell will reveal the number 2."
] | minesweeper | Multi-step Reasoning | |
State Prediction | 3 | main_path | Medium | Medium | 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
Which ... | 4 | [
"1, 2",
"None",
"1, 2, 3",
"2, 3",
"1",
"1, 3",
"3",
"2"
] | 3d_maze | 3D Spatial Perception & Reasoning | |
Target Perception | 5 | Provide the higher level status of a coordinate: Is the coordinate legal? Does it contain a ball? Can the ball be taken? Can a ball be placed? | Medium | Medium | Pyramid Chess Rules:
0.Game Board:
The game board is square and comes in various sizes: 3x3, 4x4, or 5x5. On an nxn board, there are n levels (0 to n-1). At each level k, the x and y coordinates range from 0 to n-1-k, resulting in (n-k)**2 slots per level. The slots in the lower levels act as the base for the slots in ... | 1 | [
"The coordinate is out of bound",
"It contain a ball and the ball can't be taken",
"It contain a ball and can be taken",
"It doesn't contain a ball and the player can put a ball here this turn",
"It doesn't contain a ball and the player can't put a ball here this turn"
] | pyramidchess | 3D Spatial Perception & Reasoning | |
Target Perception | 1 | Ask the number of enemies in a column | Hard | Easy | 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 | [
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10"
] | space_invaders | Strategy Planning | |
Target Perception | 0 | cell_letter | Easy | Easy | 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 4, column 1?
Options:
1: I
2: H
3: R
4: A
5: X
6: V
7: G
8: S | 8 | [
"I",
"H",
"R",
"A",
"X",
"V",
"G",
"S"
] | word_search | Multi-step Reasoning | |
Target Perception | 1 | Find which player marked the cell at a given coordinate. | Medium | Easy | 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 | [
"First Player",
"Second Player",
"Not Marked"
] | ultra_tictactoe | Strategy Planning | |
State Prediction | 2 | Given the current game state, identify which of the following moves is valid according to FreeCell rules. | Easy | Medium | In this FreeCell game:
we have 8 cascade piles at sum, and their indexes are [0, 1, 2, 3, 4, 5, 6, 7]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 must be moved according to specific rules:
1. Cards in casc... | 2 | [
"Move (Club,2) from FreeCell 3 to Cascade 7",
"Move (Heart,2) from Cascade 4 to FreeCell 2",
"Move (Club,6) from FreeCell 1 to FreeCell 1",
"Move (Club,6) from Cascade 5 to FreeCell 0"
] | freecell | Pattern Recognition & Matching | |
Strategy Optimization | 5 | Asking the next move that can lead to solving the puzzle | Medium | Hard | This game is called Chess Ranger. The rules are as follows:Pieces move like in standard chess.You can only perform capture moves.The king is allowed to be captured.The goal is to end up with a single piece remaining on the board.The possible first step to be tried is the following 4 steps: 1.move Queen in f4 to capture... | B | [
"A.2",
"B.1",
"C.4",
"D.3",
"E.234",
"F.14",
"G.123",
"H.None"
] | chess_ranger | Strategy Planning | |
Target Perception | 5 | Find the points the given player has got within the given Nine-grid. | Medium | Medium | 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 | [
"9",
"1",
"4",
"10",
"15",
"12",
"3",
"11"
] | ultra_tictactoe | Strategy Planning | |
State Prediction | 5 | piece_placement | Hard | Hard | 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... | 5 | [
"(0,4) to (4,5)",
"(0,1) to (4,2)",
"(1,2) to (5,3)",
"(3,1) to (7,2)",
"(5,0) to (9,1)",
"(1,1) to (5,2)",
"(1,5) to (5,6)",
"(2,4) to (6,5)"
] | tengram | Pattern Recognition & Matching | |
Target Perception | 0 | cell_letter | Medium | Easy | 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 4, column 1?
Options:
1: D
2: U
3: C
4: O
5: N
6: J
7: I
8: V | 1 | [
"D",
"U",
"C",
"O",
"N",
"J",
"I",
"V"
] | word_search | Multi-step Reasoning | |
Target Perception | 3 | piece_area | Hard | Medium | 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. A piece's area is the number of cells it contains.
Question:
What is the area (number of cells) of Piece 6?
Options:
1... | 4 | [
"3",
"4",
"5",
"6",
"7",
"8",
"9",
"10"
] | tengram | Pattern Recognition & Matching | |
State Prediction | 4 | Predict card move result | Medium | Medium |
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 | [
"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 | Pattern Recognition & Matching | |
State Prediction | 1 | Asking the number of moves to solve the puzzle | Medium | Hard | This game is called Chess Ranger. The rules are as follows:Pieces move like in standard chess.You can only perform capture moves.The king is allowed to be captured.The goal is to end up with a single piece remaining on the board.How many steps are needed to solve the puzzle?Choose from the following options:A.7,B.6,C.8... | H | [
"A.7",
"B.6",
"C.8",
"D.3",
"E.2",
"F.5",
"G.9",
"H.4"
] | chess_ranger | Strategy Planning | |
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? | Medium | Medium |
We have a 6*6 grid.The grid is divided into 6 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 ... | 1 | [
"(1,3)",
"(1,0)",
"(3,1)",
"(0,3)",
"(4,4)",
"(4,5)",
"(0,4)",
"(5,5)"
] | star_battle | Multi-step Reasoning | |
Target Perception | 3 | Find the number of marked middle cells in the image. | Medium | Easy | 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... | 6 | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | ultra_tictactoe | Strategy Planning | |
State Prediction | 3 | Simulate clear operation | Medium | Medium |
# **Game Overview**
Jewel2 is a strategic puzzle game played on a grid. Your primary objective is to eliminate elements by forming horizontal or vertical lines of three or more identical items. Successfully eliminating elements increases your score and clears space on the board for new elements to appear.
# **Element... | B | [
"A. Nothing will happen because the clear does not meet elimination conditions.",
"B. Trigger a special element, total cleared becomes 77.",
"C. Perform elimination, eliminate 2 elements, total cleared becomes 73.",
"D. Perform elimination, eliminate 1 elements, total cleared becomes 69.E. Perform elimination... | jewel2 | Pattern Recognition & Matching | |
Target Perception | 5 | Count specific colors on a face | Hard | Easy | 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... | 2 | [
"7",
"2",
"5",
"4",
"3",
"1",
"6",
"0"
] | rubiks_cube | 3D Spatial Perception & Reasoning | |
State Prediction | 4 | Predict card move result | Easy | Medium |
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... | A | [
"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 | Pattern Recognition & Matching | |
State Prediction | 0 | position | Medium | Medium | Rules:
State 0, Symbol 0 -> Write 0, Move up, New State 1
State 0, Symbol 1 -> Write 0, Move left, New State 1
State 0, Symbol 2 -> Write 1, Move down, New State 0
State 0, Symbol 3 -> Write 1, Move right, New State 1
State 1, Symbol 0 -> Write 2, Move right, New State 0
State 1, Symbol 1 -> Write 2, Move up, New State... | 5 | [
"(3, 0)",
"(2, 2)",
"(1, 2)",
"(4, 0)",
"(2, 1)",
"(0, 2)",
"(4, 2)",
"(0, 1)"
] | 2d_turing_machine | Multi-step Reasoning | |
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. | Hard | Hard | 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 | [
"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)"
] | tictactoe | Strategy Planning | |
State Prediction | 1 | sequence_finding | Easy | Medium | 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... | 2 | [
"Start -> 3 -> 1 -> 2 -> Goal",
"Start -> 2 -> 3 -> 1 -> Goal",
"Start -> 3 -> 2 -> 1 -> Goal",
"Start -> 2 -> 1 -> 3 -> Goal",
"Start -> 1 -> 2 -> 3 -> Goal",
"Start -> 1 -> 3 -> 2 -> Goal"
] | 3d_maze | 3D Spatial Perception & Reasoning | |
Strategy Optimization | 3 | Determine the minimum number of moves needed to solve the puzzle | Hard | Hard | 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 minimum number of moves needed to solve this puzzle?
Options:
[1] 11
[... | 7 | [
"11",
"16",
"12",
"6",
"8",
"7",
"9",
"10"
] | sokoban | Strategy Planning | |
Target Perception | 2 | Given the coordinate of last step, find the number of possible coordinates of next step. | Medium | Easy | 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... | 7 | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | ultra_tictactoe | Strategy Planning | |
State Prediction | 2 | Given the current game state, identify which of the following moves is valid according to FreeCell rules. | Easy | Medium | In this FreeCell game:
we have 8 cascade piles at sum, and their indexes are [0, 1, 2, 3, 4, 5, 6, 7]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 must be moved according to specific rules:
1. Cards in casc... | 3 | [
"Move (Club,1) from FreeCell 0 to FreeCell 2",
"Move (Club,6) from FreeCell 3 to Cascade 4",
"Move (Diamond,9) from Cascade 6 to FreeCell 2",
"Move (Club,10) from Cascade 1 to FreeCell 3"
] | freecell | Pattern Recognition & Matching | |
Target Perception | 2 | Identify the closest ghost | Hard | Easy |
# Game Overview
Pac-Man is a maze arcade game where the player controls Pac-Man to eat as many beans as possible while avoiding ghosts. If a ghost catches Pac-Man, the game ends.
# Basic Elements
- **Pac-Man**: The yellow circular character that the player controls
- **Beans**: Yellow dots that Pac-Man can eat to sco... | B. Blinky is closer to Pac-Man | [
"A. Pinky is closer to Pac-Man",
"B. Blinky is closer to Pac-Man",
"C. Both ghosts are equidistant from Pac-Man"
] | pacman | Strategy Planning | |
State Prediction | 2 | Given a sequence of moves, predict the final position of the box | Medium | Medium | 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... | 1 | [
"(3, 3)",
"(6, 1)",
"(4, 1)",
"(1, 3)",
"(3, 1)",
"(5, 5)",
"(5, 1)",
"(4, 6)"
] | sokoban | Strategy Planning | |
Target Perception | 2 | height_comparison | Easy | Easy | 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... | 1 | [
"2 < 1 < 3",
"2 < 1 = 3",
"3 < 1 = 2",
"1 = 2 < 3",
"1 < 2 < 3",
"3 < 2 < 1",
"3 < 1 < 2",
"2 < 3 < 1"
] | 3d_maze | 3D Spatial Perception & Reasoning | |
State Prediction | 6 | The position after moving. | Easy | Medium | **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.
**Question:** What are the coor... | B | [
"A. (3, 4)",
"B. (2, 5)",
"C. (3, 5)",
"D. (4, 5)",
"E. (3, 6)"
] | maze | Strategy Planning | |
State Prediction | 0 | color_matching | Easy | Hard | 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 C?
Options:
Colors are numbered from 1... | 5 | [
"1",
"2",
"3",
"4",
"5",
"6"
] | hue | Pattern Recognition & Matching | |
Target Perception | 1 | Find which player marked the cell at a given coordinate. | Hard | Easy | 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 | [
"First Player",
"Second Player",
"Not Marked"
] | ultra_tictactoe | Strategy Planning | |
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. | Easy | Hard | In this FreeCell game:
we have 8 cascade piles, and their indexes are [0, 1, 2, 3, 4, 5, 6, 7]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... | 6 | [
"(Heart, 9)",
"(Heart, 6)",
"(Club, 9)",
"(Heart, 1)",
"(Club, 2)",
"(Diamond, K)",
"(Spade, 7)",
"(Club, 1)"
] | freecell | Pattern Recognition & Matching | |
Strategy Optimization | 3 | A move_effectiveness question about the current state of Klondike Solitaire | Hard | Hard |
The given image represents the interface of the game Klondike Solitaire. The user interface consists of a board with 52 playing cards divided into four distinct areas:
1. **Stock Pile (Draw Pile):** Initially composed of 24 face-down cards. The player can draw one card at a time to reveal its face.
2. **Waste Pile (... | 3 | [
"Move from Tab5 to Tab7",
"Move from Tab6 to Tab7",
"Move from Tab2 to Foundation 1",
"Move from Tab3 to Tab6",
"Move from Tab2 to Tab3",
"Move from Tab5 to Tab6",
"Move from Tab1 to Tab5",
"None of these moves are both valid and effective"
] | klondike | Pattern Recognition & Matching | |
Target Perception | 1 | Ask to recognize the sceneries in the scene. | Hard | Easy | You are provided with a game interface that mimics "Minecraft", where all objects are composed of equal-sized cubes. Players build and explore in this world. They have numerous blocks and can place them following the basic placement rules of "Minecraft." In simple terms, players can place blocks around their current po... | 6 | [
"River, Ladder, Brick, Diamond Ore, Tree",
"Gold Ore, Tree, River, Diamond Ore, Ladder",
"Tree, Gold Ore, Lava, River, Brick",
"Lava, Diamond Ore, Pumpkin, River, TNT",
"River, Ladder, Lava, TNT, Tree",
"Pumpkin, Brick, Ladder, Gold Ore, River",
"Pumpkin, Gold Ore, Lava, Brick, River",
"Tree, Diamond ... | minecraft | 3D Spatial Perception & Reasoning | |
Strategy Optimization | 5 | Determine optimal move | Medium | Hard | This is a Minesweeper game. The size of the chessboard is 5x5, and there are a total of 5 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | E | [
"A. Flag this cell as a mine. ",
"B. Reveal this cell. ",
"C. Analyze adjacent cells for potential mines according to the number on it. ",
"D. Skip this move and wait for more information. ",
"E. This cell has already been revealed, and no further action is required. ",
"F. This cell has already been flag... | minesweeper | Multi-step Reasoning | |
Target Perception | 2 | Choose how the given 3D structure's projections match with the target projections. | Hard | Medium | 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 | [
"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"
] | 3d_reconstruction | 3D Spatial Perception & Reasoning | |
Target Perception | 2 | Given current state and an index of a region.You should idectify which cell provided in the options belongs the region. | Hard | Easy |
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 ... | 8 | [
"(4,6)",
"(0,6)",
"(7,1)",
"(7,0)",
"(6,1)",
"(6,0)",
"(3,2)",
"(7,5)"
] | star_battle | Multi-step Reasoning | |
Target Perception | 4 | piece_adjacency | Medium | Medium | 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 2?
Options:
1: 0
2: 2
3: 4
4: 1
5: 5
6: 7
7: 3
8: 6 | 7 | [
"0",
"2",
"4",
"1",
"5",
"7",
"3",
"6"
] | tengram | Pattern Recognition & Matching | |
State Prediction | 1 | head_state | Easy | Medium | Rules:
State 0, Symbol 0 -> Write 4, Move up, New State 1
State 0, Symbol 1 -> Write 1, Move down, New State 0
State 0, Symbol 2 -> Write 4, Move left, New State 1
State 0, Symbol 3 -> Write 3, Move down, New State 1
State 0, Symbol 4 -> Write 3, Move right, New State 1
State 1, Symbol 0 -> Write 0, Move left, New Stat... | 8 | [
"[2]",
"(1)",
"(2)",
"[1]",
"(3)",
"[3]",
"(0)",
"[0]"
] | 2d_turing_machine | Multi-step Reasoning | |
Target Perception | 0 | cell_letter | Medium | Easy | 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 1, column 4?
Options:
1: Y
2: P
3: E
4: T
5: M
6: R
7: K
8: Z | 4 | [
"Y",
"P",
"E",
"T",
"M",
"R",
"K",
"Z"
] | word_search | Multi-step Reasoning | |
State Prediction | 0 | path_finding | Medium | Hard | 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... | 3 | [
"1-right-forward, 2-left-forward, 3-left-forward, 4-left-forward",
"1-right-forward, 2-right-forward, 3-left-forward, 4-left-forward",
"1-right-forward, 2-right-forward, 3-up, 4-up",
"1-right-forward, 2-left-forward, 3-up, 4-left-forward",
"1-left-forward, 2-left-forward, 3-up, 4-left-forward",
"1-left-fo... | 3d_maze | 3D Spatial Perception & Reasoning | |
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. | Hard | Easy |
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 | [
"(1,4)",
"(1,5)",
"(7,2)",
"(0,5)",
"(1,2)",
"(7,4)",
"(2,4)",
"(4,4)"
] | star_battle | Multi-step Reasoning | |
Target Perception | 1 | letter_count | Medium | Medium | Rules:
1. The grid contains uppercase letters.
2. Count all occurrences of the specified letter.
Question:
How many times does the letter 'N' appear in the grid?
Options:
1: 3
2: 1
3: 6
4: 13
5: 0
6: 8
7: 4
8: 2 | 2 | [
"3",
"1",
"6",
"13",
"0",
"8",
"4",
"2"
] | word_search | Multi-step Reasoning | |
Target Perception | 4 | The color of the marble that the frog hits if it shoots at 179 degrees. | Medium | Medium | 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 ... | green | [
"red",
"yellow",
"blue",
"green",
"none"
] | zuma | Pattern Recognition & Matching | |
State Prediction | 6 | The position after moving. | Medium | Medium | **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.
**Question:** What are the coor... | D | [
"A. (5, 9)",
"B. (4, 8)",
"C. (4, 9)",
"D. (3, 9)",
"E. (4, 10)"
] | maze | Strategy Planning | |
Target Perception | 3 | Check cell state | Easy | Easy | This is a Minesweeper game. The size of the chessboard is 4x4, and there are a total of 3 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | A | [
"A. It is revealed and shows a number. ",
"B. It is flagged as mine. ",
"C. It is still hidden. ",
"D. It is revealed and shows no more information."
] | minesweeper | Multi-step Reasoning | |
Target Perception | 4 | Identify the current position of the player on the board | Medium | Easy | 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 current position of the player (row, column)?
Options:
[1] (3, 3)
[2] (... | 2 | [
"(3, 3)",
"(6, 1)",
"(3, 6)",
"(4, 5)",
"(4, 1)",
"(2, 2)",
"(6, 2)",
"(2, 6)"
] | sokoban | Strategy Planning | |
State Prediction | 3 | Which will happen until this process ends if the snake moves like this each step: | Easy | Hard | This is a Snake game. The yellow block is the head of the snake. The blue block is the body of the snake. The red block is the food. The coordinates (x, y) in the grid represent the matrix format, where x is the row index and y is the column index. The origin (0,0) is in the the upper left of the grid. You need to cont... | 3 | [
"The snake hits the bound of the grid.",
"The snake hits its body.",
"The snake reaches the food.",
"Nothing happens."
] | snake | Strategy Planning | |
Target Perception | 2 | Choose how the given 3D structure's projections match with the target projections. | Medium | Medium | 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 | [
"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"
] | 3d_reconstruction | 3D Spatial Perception & Reasoning | |
Target Perception | 8 | which of the following positions contains a tree? | Medium | Easy | 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... | 3 | [
"[7, 0]",
"[0, 2]",
"[9, 0]",
"[2, 8]",
"[9, 2]",
"[2, 1]",
"[5, 9]",
"[6, 6]"
] | tents | Multi-step Reasoning | |
State Prediction | 2 | Given the current game state, identify which of the following moves is valid according to FreeCell rules. | Medium | Medium | 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 must be moved according to specific rules:
1. Cards in cascade pi... | 1 | [
"Move (Spade,1) from Cascade 5 to Foundation Diamond",
"Move (Club,2) from FreeCell 0 to FreeCell 2",
"Move (Heart,2) from FreeCell 3 to Cascade 5",
"Move (Club,6) from FreeCell 0 to Foundation Diamond"
] | freecell | Pattern Recognition & Matching | |
Target Perception | 1 | Find the type of the block in a given coordinate. | Easy | Easy | 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 | [
"Non-type",
"Click",
"Reverse",
"Snake Head",
"Snake Body",
"Snake Tail"
] | rhythm_game | Strategy Planning | |
Strategy Optimization | 5 | Determine optimal move | Hard | Hard | This is a Minesweeper game. The size of the chessboard is 6x6, and there are a total of 8 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | C | [
"A. Flag this cell as a mine. ",
"B. Reveal this cell. ",
"C. Analyze adjacent cells for potential mines according to the number on it. ",
"D. Skip this move and wait for more information. ",
"E. This cell has already been revealed, and no further action is required. ",
"F. This cell has already been flag... | minesweeper | Multi-step Reasoning | |
State Prediction | 5 | Multi-step deductive reasoning with constraints analysis | Medium | Hard | This is a sudoku game in which the board is filled with a total number of colours equal to the length of the board's sides, and no rows, columns or squares are allowed to have duplicate colours.You should fill the empty cells on the board with following 9 colors:red, green, blue, magenta, yellow, aqua, gray, purple, fo... | I | [
"A.red",
"B.green",
"C.blue",
"D.magenta",
"E.yellow",
"F.aqua",
"G.gray",
"H.purple",
"I.forest green"
] | sudoku | Multi-step Reasoning | |
State Prediction | 1 | sequence_finding | Easy | Medium | 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... | 2 | [
"Start -> 1 -> 3 -> 2 -> Goal",
"Start -> 2 -> 3 -> 1 -> Goal",
"Start -> 3 -> 2 -> 1 -> Goal",
"Start -> 3 -> 1 -> 2 -> Goal",
"Start -> 1 -> 2 -> 3 -> Goal",
"Start -> 2 -> 1 -> 3 -> Goal"
] | 3d_maze | 3D Spatial Perception & Reasoning | |
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. | Easy | Hard | 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 | [
"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)"
] | tictactoe | Strategy Planning | |
State Prediction | 1 | Asking the number of moves to solve the puzzle | Medium | Hard | This game is called Chess Ranger. The rules are as follows:Pieces move like in standard chess.You can only perform capture moves.The king is allowed to be captured.The goal is to end up with a single piece remaining on the board.How many steps are needed to solve the puzzle?Choose from the following options:A.5,B.4,C.9... | B | [
"A.5",
"B.4",
"C.9",
"D.3",
"E.8",
"F.2",
"G.6",
"H.7"
] | chess_ranger | Strategy Planning | |
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. | Hard | Hard | 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 | [
"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)"
] | tictactoe | Strategy Planning | |
State Prediction | 2 | Given the current game state, identify which of the following moves is valid according to FreeCell rules. | Medium | Medium | 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 must be moved according to specific rules:
1. Cards in cascade pi... | 4 | [
"Move (Diamond,5) from Cascade 2 to FreeCell 2",
"Move (Club,10) from FreeCell 0 to Foundation Spade",
"Move (Diamond,12) from FreeCell 0 to FreeCell 0",
"Move (Spade,8) from Cascade 2 to FreeCell 2"
] | freecell | Pattern Recognition & Matching | |
Strategy Optimization | 6 | Find the optimal sequence of moves to reach a specific position | Hard | Hard | 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 the boxes as walls,What is the shortest sequence of moves for human to move h... | 1 | [
"Up → Up → Up → Up → Up → Up → Up → Right → Right → Right → Right",
"Up → Up → Left → Up → Up → Up → Right → Right → Right → Right → Left",
"Up → Up → Left → Up → Up → Up → Right → Right → Right → Right → Right",
"Up → Down → Up → Down → Up → Up → Up → Right → Up → Right → Left",
"Left → Right → Left → Left... | sokoban | Strategy Planning | |
Target Perception | 5 | Count specific colors on a face | Hard | Easy | 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 | [
"3",
"2",
"9",
"5",
"4",
"8",
"6",
"7"
] | rubiks_cube | 3D Spatial Perception & Reasoning | |
Target Perception | 1 | Questions about the current state of a specific block of the board. | Hard | Easy | 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 | [
"A.red",
"B.blue",
"C.white"
] | tictactoe | Strategy Planning | |
Target Perception | 3 | Check cell state | Medium | Easy | This is a Minesweeper game. The size of the chessboard is 5x5, and there are a total of 5 mines hidden on the board.
The numbers on the board indicate how many mines are adjacent to that cell, including diagonals. Cells marked with "F" (flagged) are identified as potential locations of mines based on logical deduction... | B | [
"A. It is revealed and shows a number. ",
"B. It is flagged as mine. ",
"C. It is still hidden. ",
"D. It is revealed and shows no more information."
] | minesweeper | Multi-step Reasoning | |
State Prediction | 1 | Given a sequence of player moves, predict the final position of the player | Medium | Medium | 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.If the player makes these moves: Down → Right → Down → Down → Left → Left → Down → ... | 4 | [
"(1, 2)",
"(2, 6)",
"(6, 2)",
"(6, 1)",
"(4, 5)",
"(3, 1)",
"(6, 4)",
"(1, 3)"
] | sokoban | Strategy Planning | |
State Prediction | 3 | Questions about counting state changes of specific cells over iterations | Medium | Medium | Conway's Game of Life is a cellular automaton where each cell in the grid can be either alive (black) or dead (white).
Each cell interacts with its eight neighbors, which are the cells that are horizontally, vertically, or diagonally adjacent. For a cell at position (r,c), its neighbors are:
- (r-1,c-1) (r-1,c) (r-... | A | [
"A: Initially: dead → Step 1: alive → Step 2: alive → Step 3: dead",
"B: Initially: dead → Step 1: dead → Step 2: dead → Step 3: alive",
"C: Initially: dead → Step 1: dead → Step 2: alive → Step 3: dead",
"D: Initially: dead → Step 1: alive → Step 2: alive → Step 3: alive",
"E: Initially: alive → Step 1: al... | lifegame | Multi-step Reasoning | |
Target Perception | 2 | Given the coordinate of last step, find the number of possible coordinates of next step. | Hard | Easy | 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 | [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8",
"9"
] | ultra_tictactoe | Strategy Planning | |
Target Perception | 4 | Identify the current position of the player on the board | Medium | Easy | 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 current position of the player (row, column)?
Options:
[1] (1, 2)
[2] (... | 4 | [
"(1, 2)",
"(6, 1)",
"(1, 5)",
"(3, 3)",
"(6, 3)",
"(3, 6)",
"(6, 6)",
"(2, 5)"
] | sokoban | Strategy Planning | |
Target Perception | 0 | Choose a random coordinate and ask what status is the cooradinate | Hard | Easy | Pyramid Chess Rules:
0.Game Board:
The game board is square and comes in various sizes: 3x3, 4x4, or 5x5. On an nxn board, there are n levels (0 to n-1). At each level k, the x and y coordinates range from 0 to n-1-k, resulting in (n-k)**2 slots per level. The slots in the lower levels act as the base for the slots in ... | 3 | [
"PLAYER_0",
"PLAYER_1",
"Empty",
"Index out of bound"
] | pyramidchess | 3D Spatial Perception & Reasoning | |
Target Perception | 4 | Identify the current position of the player on the board | Medium | Easy | 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 current position of the player (row, column)?
Options:
[1] (1, 1)
[2] (... | 3 | [
"(1, 1)",
"(2, 5)",
"(1, 3)",
"(6, 4)",
"(2, 6)",
"(6, 6)",
"(3, 6)",
"(6, 3)"
] | sokoban | Strategy Planning | |
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. | Easy | Easy | In this FreeCell game:
we have 8 cascade piles at sum, and their indexes are [0, 1, 2, 3, 4, 5, 6, 7]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 mov... | 5 | [
"(Heart, A)",
"(Spade, J)",
"(Heart, J)",
"(Spade, 4)",
"(Spade, 8)",
"(Club, Q)",
"(Club, A)",
"(Spade, 1)"
] | freecell | Pattern Recognition & Matching | |
State Prediction | 0 | position | Hard | Medium | Rules:
State 0, Symbol 0 -> Write 1, Move up, New State 0
State 0, Symbol 1 -> Write 1, Move down, New State 0
State 0, Symbol 2 -> Write 1, Move up, New State 2
State 1, Symbol 0 -> Write 2, Move up, New State 0
State 1, Symbol 1 -> Write 2, Move right, New State 0
State 1, Symbol 2 -> Write 2, Move right, New State 0... | 1 | [
"(4, 2)",
"(3, 4)",
"(3, 3)",
"(4, 1)",
"(3, 0)",
"(0, 2)",
"(1, 2)",
"(0, 0)"
] | 2d_turing_machine | Multi-step Reasoning | |
State Prediction | 1 | Select a coordinate and determine whether a ball can be placed at this coordinate. If so, what would happen after the place of the ball. | Easy | Medium | Pyramid Chess Rules:
0.Game Board:
The game board is square and comes in various sizes: 3x3, 4x4, or 5x5. On an nxn board, there are n levels (0 to n-1). At each level k, the x and y coordinates range from 0 to n-1-k, resulting in (n-k)**2 slots per level. The slots in the lower levels act as the base for the slots in ... | 3 | [
"Can place and no balls taken",
"Can place and then balls can be taken",
"Cannot place, position already occupied",
"Cannot place, ball not ready below"
] | pyramidchess | 3D Spatial Perception & Reasoning |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.