image imagewidth (px) 512 3.18k | question stringlengths 124 1.08k | options sequencelengths 2 4 | answer stringlengths 1 9 | solution stringlengths 73 6.18k |
|---|---|---|---|---|
The image shows the calendar of a month of a particular non-leap year. Which day of the week was on September 5 of that year? | [
"Tuesday",
"Sunday",
"Monday",
"Wednesday"
] | Sunday | {'image_year': 2590, 'image_month': [12, 'December'], 'query_year': 2590, 'query_month': [9, 'September'], 'query_day': 5} | |
The image shows the calendar of a month of a particular non-leap year. Which day of the week was on November 2 of that year? | [
"Saturday",
"Thursday",
"Monday",
"Friday"
] | Saturday | {'image_year': 2622, 'image_month': [9, 'September'], 'query_year': 2622, 'query_month': [11, 'November'], 'query_day': 2} | |
A checker game is being played on a grid of 4 squares with 2 green and 1 red checkers. Initially, the checkers are arranged as shown in the starting configuration with the 3 checkers occupying 3 squares and one unoccupied square. Green checkers only move rightward and red checkers only move leftward. Every move is eith... | [
"2",
"4",
"5",
"3"
] | 5 | {'start_position': 'GG_R', 'end_position': 'R_GG', 'green_checkers': 2, 'red_checkers': 1, 'moves': ['GG_R', 'G_GR', 'GRG_', 'GR_G', '_RGG', 'R_GG']} | |
Sarah came to an event 2 hours 25 minutes ago. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What was the time when Sarah came to the event? | [
"9:13",
"10:39",
"8:36",
"4:03"
] | 8:36 | {'current_hour': 11, 'current_minute': 1, 'subtract_hour': 2, 'subtract_minute': 25} | |
A storekeeper is a puzzle in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an 6 x 6 grid of characters grid where each element is a wall, floor, or box. Your task is to move the box to the end flag under the following rules:
1. The box can be mov... | [
"1",
"4",
"5",
"2"
] | 4 | {'ids': {'empty': '.', 'brick': '#', 'box': 'B', 'person': 'S', 'target': 'T'}, 'timestep': {'grid_0': [['#', '#', '#', '#', '#', '#'], ['#', '#', '.', '.', '.', '#'], ['#', '.', 'B', '.', '.', '#'], ['#', 'S', '.', '#', '.', '#'], ['#', '.', '.', '.', 'T', '#'], ['#', '#', '#', '#', '#', '#']], 'grid_1': [['#', '#', '... | |
The board shown in the image is a sliding puzzle of 4 * 4 tile dimensions. It has 15 numbered tiles and one unoccupied (open) position. Tiles in the same row or column of the open position can be moved by sliding them horizontally or vertically, respectively. All tiles always stay and move inside the red boundary wall,... | [
"23",
"10",
"40",
"17"
] | 23 | {'starting_grid': [[10, 14, 3, 1], [5, 4, 2, 12], [9, 11, 13, 7], [8, 0, 6, 15]], 'total_moves': 3, 'path_track': {'left, right, left': [[10, 14, 3, 1], [5, 4, 2, 12], [9, 11, 13, 7], [0, 8, 6, 15]], 'left, right, right': [[10, 14, 3, 1], [5, 4, 2, 12], [9, 11, 13, 7], [8, 6, 0, 15]], 'left, right, up': [[10, 14, 3, 1]... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"6",
"3",
"5",
"1"
] | 1 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 0, 0], [1, 2, 1], [0, 0, 0]], 'minute_1': [[0, 0, 0], [2, 2, 2], [0, 0, 0]]}} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"0",
"1",
"8",
"6"
] | 1 | {'start_state': [['yellow', 'blue', 'yellow'], ['blue', 'blue'], ['yellow', 'blue', 'yellow']], 'moves': ['left', 'left'], 'state_after_moves': [[['blue', 'blue', 'yellow'], ['blue', 'blue'], ['blue', 'blue', 'yellow']], [['yellow', 'blue', 'yellow'], ['yellow', 'blue'], ['yellow', 'blue', 'yellow']]], 'final_state': [... | |
The image shows the calendar of a month of a particular non-leap year. Which day of the week was on January 10 of that year? | [
"Sunday",
"Wednesday",
"Thursday",
"Friday"
] | Wednesday | {'image_year': 2525, 'image_month': [4, 'April'], 'query_year': 2525, 'query_month': [1, 'January'], 'query_day': 10} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"8",
"5",
"0",
"1"
] | 1 | {'start_state': [['yellow', 'yellow', 'yellow'], ['yellow', 'yellow'], ['yellow', 'yellow', 'yellow']], 'moves': ['right', 'right'], 'state_after_moves': [[['yellow', 'yellow', 'blue'], ['yellow', 'blue'], ['yellow', 'yellow', 'blue']], [['yellow', 'yellow', 'yellow'], ['yellow', 'blue'], ['yellow', 'yellow', 'yellow']... | |
A 3 * 3 Rubik's Cube has six different coloured panels: red, green, blue, yellow, orange, and grey. The initial state of the cube in terms of the different colour positions in its six faces is shown in the image. To represent the movements of the cube we use six letters: U for Up, D for Down, L for Left, R for Right, F... | [
"0",
"2",
"4",
"5"
] | 2 | {'moves': 'U2 F3', 'query_face': 'right', 'query_colour': 'blue', 'start_position': {'left': [['red', 'grey', 'orange'], ['yellow', 'blue', 'red'], ['blue', 'green', 'grey']], 'right': [['green', 'grey', 'blue'], ['blue', 'green', 'yellow'], ['orange', 'blue', 'yellow']], 'down': [['yellow', 'red', 'blue'], ['orange', ... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"4",
"2",
"3",
"5"
] | 2 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 1, 0], [2, 1, 0], [0, 0, 0]], 'minute_1': [[0, 1, 0], [2, 2, 0], [0, 0, 0]], 'minute_2': [[0, 2, 0], [2, 2, 0], [0, 0, 0]]}} | |
The checkerboard shown in the image was originally of 8 * 6 in dimension having a total of 48 squares. It uses two colours of squares, one light yellow and one dark yellow, in a chequered pattern. Two of the squares have been removed from the board in the position of the white coloured cells, as shown in the image. You... | [
"Yes",
"No"
] | No | {'board': [[[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 1.0, 1.0], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702]], [[1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235]], [[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1... | |
You are given an incomplete map of a country having 15 different regions. The objective is to colour the regions of the map using only the four available colours: red, green, blue and yellow, such that no two adjacent regions have the same colour. Adjacent regions are defined as two regions that share a common boundary... | [
"4",
"2",
"1",
"3"
] | 4 | {'polygon_vertices': {'1': [[0.28309, 0.53419], [0.11076, 1.0], [0.0, 1.0], [0.0, 0.42264], [0.24203, 0.50918], [0.2808, 0.52947]], '2': [[0.81655, 0.98995], [0.82695, 0.87051], [0.92988, 0.74109], [1.0, 0.75424], [1.0, 0.90131]], '3': [[0.61832, 0.64358], [0.81645, 0.41358], [0.8425, 0.66388], [0.69657, 0.74761]], '4'... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"6",
"1",
"3",
"4"
] | 6 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 1, 1], [1, 0, 2], [1, 1, 0]], 'minute_1': [[1, 1, 2], [1, 0, 2], [1, 1, 0]], 'minute_2': [[1, 2, 2], [1, 0, 2], [1, 1, 0]], 'minute_3': [[2, 2, 2], [1, 0, 2], [1, 1, 0]], 'minute_4': [[2, 2, 2], [2, 0, 2], [1, 1, 0]], 'minute_5': [[2, 2, 2], [... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"3",
"2",
"1",
"6"
] | 2 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 2, 1], [1, 1, 1], [0, 1, 0]], 'minute_1': [[0, 2, 2], [1, 2, 1], [0, 1, 0]], 'minute_2': [[0, 2, 2], [2, 2, 2], [0, 2, 0]]}} | |
You are playing a Tower of Hanoi game with 3 rods and 5 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"3",
"1",
"6",
"2"
] | 2 | {'start_position': [[3], [2], [5, 4, 1]], 'end_position': [[3, 2, 1], [], [5, 4]], 'moves': [{'position': [[3], [2], [5, 4, 1]], 'num_moves': 0}, {'position': [[3, 2], [], [5, 4, 1]], 'num_moves': 1}, {'position': [[3, 2, 1], [], [5, 4]], 'num_moves': 2}]} | |
Consider a sliding block puzzle of grid size 5 * 4 units. It has 9 wooden blocks of varying sizes: one 2 * 2, four 1 * 2, two 2 * 1, and two 1 * 1. The gird also has two empty 1 * 1 spaces. The blocks cannot be removed from the grid, and may only be slid horizontally and vertically within its boundary. A move is define... | [
"6",
"4",
"3",
"5"
] | 5 | {'start_position': '2233\n6114\n6115\n7880\n7099', 'end_position': '2233\n1104\n1105\n6788\n6799', 'moves': ['2233\n6114\n6115\n7880\n7099', '2233\n6114\n6115\n7088\n7099', '2233\n6114\n6115\n0788\n0799', '2233\n0114\n6115\n6788\n0799', '2233\n0114\n0115\n6788\n6799', '2233\n1104\n1105\n6788\n6799']} | |
A checker game is being played on a grid of 8 squares with 5 green and 2 red checkers. Initially, the checkers are arranged as shown in the starting configuration with the 7 checkers occupying 7 squares and one unoccupied square. Green checkers only move rightward and red checkers only move leftward. Every move is eith... | [
"1",
"5",
"2",
"4"
] | 1 | {'start_position': 'GGRG_GRG', 'end_position': 'GGRGRG_G', 'green_checkers': 5, 'red_checkers': 2, 'moves': ['GGRG_GRG', 'GGRGRG_G']} | |
A checker game is being played on a grid of 7 squares with 4 green and 2 red checkers. Initially, the checkers are arranged as shown in the starting configuration with the 6 checkers occupying 6 squares and one unoccupied square. Green checkers only move rightward and red checkers only move leftward. Every move is eith... | [
"41",
"32",
"14",
"38"
] | 14 | {'start_position': 'GGGG_RR', 'end_position': 'RR_GGGG', 'green_checkers': 4, 'red_checkers': 2, 'moves': ['GGGG_RR', 'GGG_GRR', 'GGGRG_R', 'GGGRGR_', 'GGGR_RG', 'GG_RGRG', 'G_GRGRG', 'GRG_GRG', 'GRGRG_G', 'GRGR_GG', 'GR_RGGG', '_RGRGGG', 'R_GRGGG', 'RRG_GGG', 'RR_GGGG']} | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"1",
"4",
"2",
"6"
] | 1 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 2, 1], [0, 1, 0], [0, 0, 0]], 'minute_1': [[2, 2, 2], [0, 2, 0], [0, 0, 0]]}} | |
This is maze having 9 * 13 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"42",
"24",
"35",
"27"
] | 27 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1], [1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0... | |
Alice has 14 segments of chains of different lengths as shown in the image. The total length of all the segments combined is 39 pieces. She has a saw machine with which a closed piece can be cut opened. She also has a welding machine with which an open piece can be closed. Each cut takes 3 minutes and each welding take... | [
"25",
"30",
"39",
"4"
] | 39 | {'steps': [[2, 1, 3, 4, 2, 2], [3, 0, 3, 4, 2, 2], [4, 1, 2, 4, 2, 2], [5, 0, 2, 4, 2, 2], [6, 1, 1, 4, 2, 2], [7, 0, 1, 4, 2, 2], [8, 1, 0, 4, 2, 2], [9, 0, 0, 4, 2, 2]], 'cuts': 7, 'joins': 9, 'each_cut_time': 3, 'each_join_time': 2, 'total_time': 39} | |
A storekeeper is a puzzle in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an 6 x 6 grid of characters grid where each element is a wall, floor, or box. Your task is to move the box to the end flag under the following rules:
1. The box can be mov... | [
"3",
"1",
"4",
"2"
] | 4 | {'ids': {'empty': '.', 'brick': '#', 'box': 'B', 'person': 'S', 'target': 'T'}, 'timestep': {'grid_0': [['#', '#', '#', '#', '#', '#'], ['#', 'T', '.', '.', '.', '#'], ['#', '.', '.', '.', '#', '#'], ['#', '#', '.', 'B', 'S', '#'], ['#', '.', '.', '.', '#', '#'], ['#', '#', '#', '#', '#', '#']], 'grid_1': [['#', '#', '... | |
Alice has 14 segments of chains of different lengths as shown in the image. The total length of all the segments combined is 30 pieces. She has a saw machine with which a closed piece can be cut opened. She also has a welding machine with which an open piece can be closed. Each cut takes 5 minutes and each welding take... | [
"60",
"14",
"13",
"54"
] | 60 | {'steps': [[4, 2, 2, 4, 2, 0], [5, 1, 2, 4, 2, 0], [6, 0, 2, 4, 2, 0], [7, 1, 1, 4, 2, 0], [8, 0, 1, 4, 2, 0]], 'cuts': 4, 'joins': 8, 'each_cut_time': 5, 'each_join_time': 5, 'total_time': 60} | |
A storekeeper is a puzzle in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an 6 x 6 grid of characters grid where each element is a wall, floor, or box. Your task is to move the box to the end flag under the following rules:
1. The box can be mov... | [
"4",
"2",
"5",
"1"
] | 4 | {'ids': {'empty': '.', 'brick': '#', 'box': 'B', 'person': 'S', 'target': 'T'}, 'timestep': {'grid_0': [['#', '#', '#', '#', '#', '#'], ['#', 'T', '.', '#', '#', '#'], ['#', '.', '.', '.', '#', '#'], ['#', '.', '.', 'B', 'S', '#'], ['#', '.', '.', '#', '.', '#'], ['#', '#', '#', '#', '#', '#']], 'grid_1': [['#', '#', '... | |
The board shown in the image is a sliding puzzle of 5 * 5 tile dimensions. It has 24 numbered tiles and one unoccupied (open) position. Tiles in the same row or column of the open position can be moved by sliding them horizontally or vertically, respectively. All tiles always stay and move inside the red boundary wall,... | [
"13",
"12",
"24",
"1"
] | 12 | {'starting_grid': [[10, 12, 22, 24, 0], [15, 21, 7, 17, 4], [19, 6, 18, 1, 2], [5, 20, 13, 8, 11], [16, 14, 23, 9, 3]], 'total_moves': 3, 'path_track': {'left, left, left': [[10, 0, 12, 22, 24], [15, 21, 7, 17, 4], [19, 6, 18, 1, 2], [5, 20, 13, 8, 11], [16, 14, 23, 9, 3]], 'left, left, right': [[10, 12, 22, 0, 24], [1... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"3",
"4",
"6",
"1"
] | 4 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 1, 2], [1, 1, 1], [1, 0, 0]], 'minute_1': [[1, 2, 2], [1, 1, 2], [1, 0, 0]], 'minute_2': [[2, 2, 2], [1, 2, 2], [1, 0, 0]], 'minute_3': [[2, 2, 2], [2, 2, 2], [1, 0, 0]], 'minute_4': [[2, 2, 2], [2, 2, 2], [2, 0, 0]]}} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"5",
"8",
"6",
"2"
] | 5 | {'start_state': [['yellow', 'yellow', 'yellow'], ['yellow', 'yellow'], ['yellow', 'yellow', 'yellow']], 'moves': ['right', 'center', 'center'], 'state_after_moves': [[['yellow', 'yellow', 'blue'], ['yellow', 'blue'], ['yellow', 'yellow', 'blue']], [['yellow', 'blue', 'blue'], ['yellow', 'yellow'], ['yellow', 'blue', 'b... | |
Nicholas's event is going to start in 1 hour 13 minutes. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What will be the time when the event starts? | [
"2:32",
"6:39",
"0:37",
"1:47"
] | 0:37 | {'current_hour': 11, 'current_minute': 24, 'add_hour': 1, 'add_minute': 13} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"3",
"7",
"1",
"2"
] | 2 | {'start_state': [['blue', 'blue', 'blue'], ['blue', 'blue'], ['blue', 'blue', 'blue']], 'moves': ['left', 'center', 'center'], 'state_after_moves': [[['yellow', 'blue', 'blue'], ['yellow', 'blue'], ['yellow', 'blue', 'blue']], [['yellow', 'yellow', 'blue'], ['blue', 'blue'], ['yellow', 'yellow', 'blue']], [['yellow', '... | |
A 5 * 5 board consists of 25 different coloured tiles. A random state of the board is shown in (A). The ideal state of the board is shown in (B). A swap consists of selecting any two tiles on the board and switching their positions. What is the minimum number of swaps required to restore the ideal state of the board fr... | [
"2",
"5",
"9",
"7"
] | 7 | {'ideal_grid': [[[255, 111, 60], [255, 133, 60], [255, 155, 60], [255, 177, 60], [255, 201, 60]], [[207, 122, 95], [207, 144, 89], [207, 167, 84], [207, 190, 78], [207, 214, 72]], [[159, 133, 130], [159, 155, 118], [159, 179, 108], [159, 203, 96], [159, 227, 84]], [[111, 144, 165], [111, 166, 147], [111, 191, 132], [11... | |
This is maze having 13 * 13 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell ... | [
"27",
"43",
"47",
"31"
] | 27 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 0, 0, 0, 0, 0, 0... | |
Consider a sliding block puzzle of grid size 5 * 4 units. It has 9 wooden blocks of varying sizes: one 2 * 2, four 1 * 2, two 2 * 1, and two 1 * 1. The gird also has two empty 1 * 1 spaces. The blocks cannot be removed from the grid, and may only be slid horizontally and vertically within its boundary. A move is define... | [
"4",
"2",
"5",
"6"
] | 5 | {'start_position': '2233\n6110\n6114\n7880\n7995', 'end_position': '2233\n6114\n6115\n7088\n7099', 'moves': ['2233\n6110\n6114\n7880\n7995', '2233\n6110\n6114\n7885\n7990', '2233\n6110\n6114\n7885\n7099', '2233\n6114\n6110\n7885\n7099', '2233\n6114\n6115\n7880\n7099', '2233\n6114\n6115\n7088\n7099']} | |
The image shows the calendar of a month of a particular non-leap year. The next year was a non-leap year. Which day of the week was on July 26 of the next year? | [
"Saturday",
"Thursday",
"Friday",
"Monday"
] | Thursday | {'image_year': 1922, 'image_month': [5, 'May'], 'query_year': 1923, 'query_month': [7, 'July'], 'query_day': 26} | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"4",
"3",
"1",
"6"
] | 4 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 1, 0], [2, 0, 1], [1, 1, 1]], 'minute_1': [[2, 1, 0], [2, 0, 1], [2, 1, 1]], 'minute_2': [[2, 2, 0], [2, 0, 1], [2, 2, 1]], 'minute_3': [[2, 2, 0], [2, 0, 1], [2, 2, 2]], 'minute_4': [[2, 2, 0], [2, 0, 2], [2, 2, 2]]}} | |
Sarah's event is going to start in 53 minutes. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What will be the time when the event starts? | [
"8:18",
"4:26",
"3:15",
"5:17"
] | 3:15 | {'current_hour': 2, 'current_minute': 22, 'add_hour': 0, 'add_minute': 53} | |
The checkerboard shown in the image was originally of 8 * 7 in dimension having a total of 56 squares. It uses two colours of squares, one light yellow and one dark yellow, in a chequered pattern. Two of the squares have been removed from the board in the position of the white coloured cells, as shown in the image. You... | [
"No",
"Yes"
] | No | {'board': [[[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235]], [[1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 1.0, 1.0], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702]], [... | |
You are given a 9 * 9 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 9 chess queens on this board so that no two queens threaten each other; i.e. no two queens sh... | [
"5",
"4",
"8",
"6"
] | 4 | {'rows': 9, 'columns': 9, 'given_queen_positions': [[0, 2], [1, 4], [2, 6], [5, 1], [6, 7], [7, 5], [8, 8]], 'missing_queen_positions': [[3, 0], [4, 3]]} | |
Consider a sliding block puzzle of grid size 5 * 4 units. It has 9 wooden blocks of varying sizes: one 2 * 2, four 1 * 2, two 2 * 1, and two 1 * 1. The gird also has two empty 1 * 1 spaces. The blocks cannot be removed from the grid, and may only be slid horizontally and vertically within its boundary. A move is define... | [
"1",
"5",
"6",
"2"
] | 2 | {'start_position': '1122\n1133\n0405\n6788\n6799', 'end_position': '1122\n1133\n4050\n6788\n6799', 'moves': ['1122\n1133\n0405\n6788\n6799', '1122\n1133\n0450\n6788\n6799', '1122\n1133\n4050\n6788\n6799']} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"5",
"4",
"1",
"2"
] | 1 | {'start_state': [['blue', 'yellow', 'blue'], ['yellow', 'yellow'], ['blue', 'yellow', 'blue']], 'moves': ['right', 'center'], 'state_after_moves': [[['blue', 'yellow', 'yellow'], ['yellow', 'yellow'], ['blue', 'yellow', 'yellow']], [['blue', 'blue', 'yellow'], ['yellow', 'blue'], ['blue', 'yellow', 'blue']]], 'final_st... | |
The checkerboard shown in the image was originally of 7 * 9 in dimension having a total of 63 squares. It uses two colours of squares, one light yellow and one dark yellow, in a chequered pattern. One of the squares have been removed from the board in the position of the white coloured cell, as shown in the image. You ... | [
"Yes",
"No"
] | Yes | {'board': [[[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235]], [[1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702]... | |
This is maze having 11 * 9 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"5",
"2",
"1",
"3"
] | 5 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 1, 1, 0, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 0], [1, 1, 1, 1, 1, 1, 1... | |
The image shows the calendar of a month of a particular non-leap year. The previous year was a non-leap year. Which day of the week was on June 12 of the previous year? | [
"Sunday",
"Wednesday",
"Thursday",
"Saturday"
] | Saturday | {'image_year': 2338, 'image_month': [11, 'November'], 'query_year': 2337, 'query_month': [6, 'June'], 'query_day': 12} | |
You are given a 10 * 10 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 10 chess queens on this board so that no two queens threaten each other; i.e. no two queens... | [
"11",
"9",
"8",
"10"
] | 9 | {'rows': 10, 'columns': 10, 'given_queen_positions': [[1, 5], [2, 8], [3, 0], [4, 9], [5, 4], [6, 6], [7, 1], [9, 7]], 'missing_queen_positions': [[0, 2], [8, 3]]} | |
The toy shown in the figure has eight coloured disks on its front, and three holes on its top – left, right, and center – through which a ball bearing could be dropped. Each disk would display either a yellow or blue face. When a ball passes through a disc it tips the disk mechanism which flips the face color. The tipp... | [
"4",
"2",
"6",
"1"
] | 6 | {'start_state': [['blue', 'blue', 'blue'], ['blue', 'blue'], ['blue', 'blue', 'blue']], 'moves': ['left', 'left', 'left'], 'state_after_moves': [[['yellow', 'blue', 'blue'], ['yellow', 'blue'], ['yellow', 'blue', 'blue']], [['blue', 'blue', 'blue'], ['yellow', 'blue'], ['blue', 'blue', 'blue']], [['yellow', 'blue', 'bl... | |
This is maze having 11 * 9 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"1",
"2",
"4",
"5"
] | 5 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 0, 1, 1, 1], [1, 0, 0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1... | |
Alice has 12 segments of chains of different lengths as shown in the image. The total length of all the segments combined is 30 pieces. She has a saw machine with which a closed piece can be cut opened. She also has a welding machine with which an open piece can be closed. Each cut takes 4 minutes and each welding take... | [
"21",
"33",
"3",
"26"
] | 26 | {'steps': [[4, 0, 1, 4, 3, 0], [5, 1, 0, 4, 3, 0], [6, 0, 0, 4, 3, 0], [7, 0, 1, 3, 3, 0]], 'cuts': 3, 'joins': 7, 'each_cut_time': 4, 'each_join_time': 2, 'total_time': 26} | |
Hannah came to an event 3 hours 39 minutes ago. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What was the time when Hannah came to the event? | [
"2:47",
"10:56",
"9:16",
"10:37"
] | 10:56 | {'current_hour': 2, 'current_minute': 35, 'subtract_hour': 3, 'subtract_minute': 39} | |
A fortune wheel has 8 segments of different colour. The initial position of the wheel is shown in the figure. Each segment is associated with a prize as shown in the embedded text within the segment. The axis of rotation of the wheel passes through its center and is perpendicular to the surface of the wheel. You spin t... | [
"Money",
"Car",
"Vacation",
"Jewelry"
] | Money | {'angles': [45.0, 45.0, 45.0, 45.0, 45.0, 45.0, 45.0, 45.0], 'arrow_at': 315, 'effective_rotation': -198, 'direction': 'clockwise', 'original_colors': ['silver', 'yellow', 'orangered', 'lime', 'cyan', 'darkorange', 'blanchedalmond', 'magenta'], 'original_boundaries': [45.0, 90.0, 135.0, 180.0, 225.0, 270.0, 315.0, 360.... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"5",
"3",
"4",
"6"
] | 4 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 1, 0], [0, 1, 1], [2, 1, 0]], 'minute_1': [[1, 1, 0], [0, 1, 1], [2, 2, 0]], 'minute_2': [[1, 1, 0], [0, 2, 1], [2, 2, 0]], 'minute_3': [[1, 2, 0], [0, 2, 2], [2, 2, 0]], 'minute_4': [[2, 2, 0], [0, 2, 2], [2, 2, 0]]}} | |
You are playing a Tower of Hanoi game with 3 rods and 5 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"2",
"5",
"6",
"1"
] | 1 | {'start_position': [[5, 4, 1], [], [3, 2]], 'end_position': [[5, 4, 1], [2], [3]], 'moves': [{'position': [[5, 4, 1], [], [3, 2]], 'num_moves': 0}, {'position': [[5, 4, 1], [2], [3]], 'num_moves': 1}]} | |
You are playing a Tower of Hanoi game with 3 rods and 6 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"6",
"5",
"3",
"1"
] | 3 | {'start_position': [[4, 1], [3, 2], [6, 5]], 'end_position': [[4, 3], [], [6, 5, 2, 1]], 'moves': [{'position': [[4, 1], [3, 2], [6, 5]], 'num_moves': 0}, {'position': [[4, 1], [3], [6, 5, 2]], 'num_moves': 1}, {'position': [[4], [3], [6, 5, 2, 1]], 'num_moves': 2}, {'position': [[4, 3], [], [6, 5, 2, 1]], 'num_moves':... | |
You are playing a Tower of Hanoi game with 3 rods and 4 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"5",
"6",
"2",
"4"
] | 5 | {'start_position': [[4, 3], [], [2, 1]], 'end_position': [[], [3, 2, 1], [4]], 'moves': [{'position': [[4, 3], [], [2, 1]], 'num_moves': 0}, {'position': [[4], [3], [2, 1]], 'num_moves': 1}, {'position': [[4, 1], [3], [2]], 'num_moves': 2}, {'position': [[4, 1], [3, 2], []], 'num_moves': 3}, {'position': [[4], [3, 2, 1... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"5",
"4",
"3",
"6"
] | 4 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 1, 1], [1, 1, 0], [2, 1, 0]], 'minute_1': [[1, 1, 1], [2, 1, 0], [2, 2, 0]], 'minute_2': [[2, 1, 1], [2, 2, 0], [2, 2, 0]], 'minute_3': [[2, 2, 1], [2, 2, 0], [2, 2, 0]], 'minute_4': [[2, 2, 2], [2, 2, 0], [2, 2, 0]]}} | |
Elizabeth's event is going to start in 2 hours 39 minutes. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What will be the time when the event starts? | [
"9:27",
"10:02",
"6:09",
"3:47"
] | 10:02 | {'current_hour': 7, 'current_minute': 23, 'add_hour': 2, 'add_minute': 39} | |
A checker game is being played on a grid of 8 squares with 4 green and 3 red checkers. Initially, the checkers are arranged as shown in the starting configuration with the 7 checkers occupying 7 squares and one unoccupied square. Green checkers only move rightward and red checkers only move leftward. Every move is eith... | [
"1",
"0",
"4",
"3"
] | 3 | {'start_position': 'G_GRGRGR', 'end_position': 'GRGRGRG_', 'green_checkers': 4, 'red_checkers': 3, 'moves': ['G_GRGRGR', 'GRG_GRGR', 'GRGRG_GR', 'GRGRGRG_']} | |
You are given an incomplete map of a country having 19 different regions. The objective is to colour the regions of the map using only the four available colours: red, green, blue and yellow, such that no two adjacent regions have the same colour. Adjacent regions are defined as two regions that share a common boundary... | [
"7",
"4",
"5",
"9"
] | 4 | {'polygon_vertices': {'1': [[0.41219, 0.40897], [0.36574, 0.41999], [0.14233, 0.61547], [0.25075, 0.7056], [0.46405, 0.5481], [0.44037, 0.45036]], '2': [[0.86585, 0.67186], [1.0, 0.5651], [1.0, 0.84986], [0.85795, 0.77639]], '3': [[1.0, 0.42319], [0.95952, 0.39986], [0.71543, 0.18907], [0.69832, 0.1478], [0.75664, 0.0]... | |
You are playing a Tower of Hanoi game with 3 rods and 6 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"6",
"3",
"1",
"4"
] | 6 | {'start_position': [[], [3, 2], [6, 5, 4, 1]], 'end_position': [[4, 3], [], [6, 5, 2, 1]], 'moves': [{'position': [[], [3, 2], [6, 5, 4, 1]], 'num_moves': 0}, {'position': [[], [3, 2, 1], [6, 5, 4]], 'num_moves': 1}, {'position': [[4], [3, 2, 1], [6, 5]], 'num_moves': 2}, {'position': [[4, 1], [3, 2], [6, 5]], 'num_mov... | |
The board shown in the image is a sliding puzzle of 4 * 4 tile dimensions. It has 15 numbered tiles and one unoccupied (open) position. Tiles in the same row or column of the open position can be moved by sliding them horizontally or vertically, respectively. All tiles always stay and move inside the red boundary wall,... | [
"14",
"44",
"23",
"1"
] | 23 | {'starting_grid': [[4, 12, 11, 9], [13, 8, 1, 5], [2, 15, 3, 14], [7, 10, 6, 0]], 'total_moves': 2, 'path_track': {'left, left': [[4, 12, 11, 9], [13, 8, 1, 5], [2, 15, 3, 14], [7, 0, 10, 6]], 'left, right': [[4, 12, 11, 9], [13, 8, 1, 5], [2, 15, 3, 14], [7, 10, 6, 0]], 'left, up': [[4, 12, 11, 9], [13, 8, 1, 5], [2, ... | |
A 3 * 3 Rubik's Cube has six different coloured panels: red, green, blue, yellow, orange, and grey. The initial state of the cube in terms of the different colour positions in its six faces is shown in the image. To represent the movements of the cube we use six letters: U for Up, D for Down, L for Left, R for Right, F... | [
"2",
"5",
"8",
"3"
] | 5 | {'moves': 'D B2 D3', 'query_face': 'back', 'query_colour': 'green', 'start_position': {'left': [['yellow', 'yellow', 'yellow'], ['yellow', 'yellow', 'yellow'], ['yellow', 'yellow', 'yellow']], 'right': [['orange', 'orange', 'orange'], ['orange', 'orange', 'orange'], ['orange', 'orange', 'orange']], 'down': [['blue', 'b... | |
You are given an incomplete map of a country having 15 different regions. The objective is to colour the regions of the map using only the four available colours: red, green, blue and yellow, such that no two adjacent regions have the same colour. Adjacent regions are defined as two regions that share a common boundary... | [
"2",
"7",
"3",
"8"
] | 2 | {'polygon_vertices': {'1': [[0.53251, 0.09773], [0.45099, 0.3454], [0.51158, 0.35578], [0.62593, 0.27381], [0.59701, 0.05676]], '2': [[0.85844, 0.19219], [0.86972, 0.44671], [0.69837, 0.59519], [0.51158, 0.35578], [0.62593, 0.27381]], '3': [[0.59701, 0.05676], [0.62593, 0.27381], [0.85844, 0.19219], [1.0, 0.00663], [1.... | |
A storekeeper is a puzzle in which the player pushes boxes around in a warehouse trying to get them to target locations. The game is represented by an 6 x 6 grid of characters grid where each element is a wall, floor, or box. Your task is to move the box to the end flag under the following rules:
1. The box can be mov... | [
"4",
"2",
"3",
"1"
] | 3 | {'ids': {'empty': '.', 'brick': '#', 'box': 'B', 'person': 'S', 'target': 'T'}, 'timestep': {'grid_0': [['#', '#', '#', '#', '#', '#'], ['#', '#', '.', '#', 'T', '#'], ['#', '.', 'B', '.', '.', '#'], ['#', '.', '.', 'S', '.', '#'], ['#', '.', '.', '.', '.', '#'], ['#', '#', '#', '#', '#', '#']], 'grid_1': [['#', '#', '... | |
You are given an 8 * 8 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 8 chess queens on this board so that no two queens threaten each other; i.e. no two queens s... | [
"8",
"7",
"5",
"3"
] | 3 | {'rows': 8, 'columns': 8, 'given_queen_positions': [[0, 0], [1, 6], [2, 4], [3, 7], [4, 1], [7, 2]], 'missing_queen_positions': [[5, 3], [6, 5]]} | |
You are given an 8 * 8 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 8 chess queens on this board so that no two queens threaten each other; i.e. no two queens s... | [
"7",
"9",
"6",
"8"
] | 7 | {'rows': 8, 'columns': 8, 'given_queen_positions': [[1, 2], [2, 7], [3, 1], [4, 4], [5, 0], [7, 3]], 'missing_queen_positions': [[0, 6], [6, 5]]} | |
A fortune wheel has 8 segments of different colour. The initial position of the wheel is shown in the figure. Each segment is associated with a prize as shown in the embedded text within the segment. The axis of rotation of the wheel passes through its center and is perpendicular to the surface of the wheel. You spin t... | [
"Laptop",
"Chocolate",
"Ice Cream",
"Watch"
] | Watch | {'angles': [30, 30, 30, 45, 75, 90, 30, 30], 'arrow_at': 135, 'effective_rotation': 195, 'direction': 'counterclockwise', 'original_colors': ['magenta', 'forestgreen', 'darkorange', 'cyan', 'blanchedalmond', 'silver', 'yellow', 'royalblue'], 'original_boundaries': [45.0, 75.0, 105.0, 135.0, 180.0, 255.0, 345.0, 375.0],... | |
A 4 * 5 board consists of 20 different coloured tiles. A random state of the board is shown in (A). The ideal state of the board is shown in (B). A swap consists of selecting any two tiles on the board and switching their positions. What is the minimum number of swaps required to restore the ideal state of the board fr... | [
"3",
"4",
"5",
"1"
] | 4 | {'ideal_grid': [[[255, 105, 180], [255, 134, 181], [255, 163, 182], [255, 192, 183], [255, 221, 186]], [[206, 93, 152], [214, 116, 152], [222, 139, 152], [229, 163, 153], [238, 186, 154]], [[157, 81, 124], [173, 98, 123], [189, 115, 122], [203, 134, 123], [221, 151, 122]], [[108, 67, 94], [131, 79, 93], [154, 91, 92], ... | |
You are playing a Tower of Hanoi game with 3 rods and 4 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"5",
"4",
"2",
"6"
] | 2 | {'start_position': [[], [3, 2], [4, 1]], 'end_position': [[2, 1], [3], [4]], 'moves': [{'position': [[], [3, 2], [4, 1]], 'num_moves': 0}, {'position': [[2], [3], [4, 1]], 'num_moves': 1}, {'position': [[2, 1], [3], [4]], 'num_moves': 2}]} | |
Consider a sliding block puzzle of grid size 5 * 4 units. It has 9 wooden blocks of varying sizes: one 2 * 2, four 1 * 2, two 2 * 1, and two 1 * 1. The gird also has two empty 1 * 1 spaces. The blocks cannot be removed from the grid, and may only be slid horizontally and vertically within its boundary. A move is define... | [
"2",
"1",
"5",
"4"
] | 5 | {'start_position': '2233\n6114\n6115\n0788\n0799', 'end_position': '2233\n6110\n6114\n7885\n7990', 'moves': ['2233\n6114\n6115\n0788\n0799', '2233\n6114\n6115\n7088\n7099', '2233\n6114\n6115\n7880\n7099', '2233\n6114\n6110\n7885\n7099', '2233\n6110\n6114\n7885\n7099', '2233\n6110\n6114\n7885\n7990']} | |
You are given an 8 * 8 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 8 chess queens on this board so that no two queens threaten each other; i.e. no two queens s... | [
"12",
"10",
"7",
"3"
] | 10 | {'rows': 8, 'columns': 8, 'given_queen_positions': [[0, 5], [1, 2], [3, 1], [4, 3], [5, 7], [7, 4]], 'missing_queen_positions': [[2, 6], [6, 0]]} | |
You are given an 8 * 8 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 8 chess queens on this board so that no two queens threaten each other; i.e. no two queens s... | [
"13",
"8",
"5",
"4"
] | 8 | {'rows': 8, 'columns': 8, 'given_queen_positions': [[0, 1], [2, 7], [3, 2], [5, 3], [6, 6], [7, 4]], 'missing_queen_positions': [[1, 5], [4, 0]]} | |
You are given a 9 * 9 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 9 chess queens on this board so that no two queens threaten each other; i.e. no two queens sh... | [
"9",
"10",
"3",
"12"
] | 3 | {'rows': 9, 'columns': 9, 'given_queen_positions': [[0, 2], [1, 0], [3, 7], [5, 1], [6, 3], [7, 8], [8, 6]], 'missing_queen_positions': [[2, 5], [4, 4]]} | |
Consider a sliding block puzzle of grid size 5 * 4 units. It has 9 wooden blocks of varying sizes: one 2 * 2, four 1 * 2, two 2 * 1, and two 1 * 1. The gird also has two empty 1 * 1 spaces. The blocks cannot be removed from the grid, and may only be slid horizontally and vertically within its boundary. A move is define... | [
"2",
"1",
"5",
"4"
] | 4 | {'start_position': '0633\n0622\n7115\n7114\n8899', 'end_position': '6033\n6225\n7114\n7110\n8899', 'moves': ['0633\n0622\n7115\n7114\n8899', '6033\n6022\n7115\n7114\n8899', '6033\n6220\n7115\n7114\n8899', '6033\n6225\n7110\n7114\n8899', '6033\n6225\n7114\n7110\n8899']} | |
The checkerboard shown in the image was originally of 7 * 6 in dimension having a total of 42 squares. It uses two colours of squares, one light yellow and one dark yellow, in a chequered pattern. Two of the squares have been removed from the board in the position of the white coloured cells, as shown in the image. You... | [
"Yes",
"No"
] | No | {'board': [[[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702]], [[1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235], [1.0, 0.902, 0.702], [1.0, 0.7647, 0.2235]], [[1.0, 0.7647, 0.2235], [1.0, 0.902, 0.70... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"6",
"5",
"3",
"1"
] | 3 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 1, 1], [0, 1, 1], [1, 1, 2]], 'minute_1': [[0, 1, 1], [0, 1, 2], [1, 2, 2]], 'minute_2': [[0, 1, 2], [0, 2, 2], [2, 2, 2]], 'minute_3': [[0, 2, 2], [0, 2, 2], [2, 2, 2]]}} | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"2",
"6",
"5",
"1"
] | 2 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 1, 1], [1, 2, 1], [1, 1, 0]], 'minute_1': [[0, 2, 1], [2, 2, 2], [1, 2, 0]], 'minute_2': [[0, 2, 2], [2, 2, 2], [2, 2, 0]]}} | |
The board shown in the image is a sliding puzzle of 3 * 3 tile dimensions. It has 8 numbered tiles and one unoccupied (open) position. Tiles in the same row or column of the open position can be moved by sliding them horizontally or vertically, respectively. All tiles always stay and move inside the red boundary wall, ... | [
"17",
"6",
"30",
"40"
] | 17 | {'starting_grid': [[3, 8, 1], [2, 6, 0], [4, 5, 7]], 'total_moves': 4, 'path_track': {'left, left, right, left': [[3, 8, 1], [0, 2, 6], [4, 5, 7]], 'left, left, right, right': [[3, 8, 1], [2, 6, 0], [4, 5, 7]], 'left, left, right, up': [[3, 0, 1], [2, 8, 6], [4, 5, 7]], 'left, left, right, down': [[3, 8, 1], [2, 5, 6],... | |
This is maze having 11 * 9 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"45",
"22",
"31",
"37"
] | 37 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 1, 0, 1, 1, 1], [1, 0, 1, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1... | |
A fortune wheel has 8 segments of different colour. The initial position of the wheel is shown in the figure. Each segment is associated with a prize as shown in the embedded text within the segment. The axis of rotation of the wheel passes through its center and is perpendicular to the surface of the wheel. You spin t... | [
"Jewelry",
"Chocolate",
"Yacht",
"Pizza"
] | Jewelry | {'angles': [30, 30, 75, 60, 30, 60, 30, 45], 'arrow_at': 0, 'effective_rotation': -234, 'direction': 'clockwise', 'original_colors': ['cyan', 'silver', 'blanchedalmond', 'darkorange', 'lime', 'yellow', 'forestgreen', 'magenta'], 'original_boundaries': [45.0, 75.0, 105.0, 180.0, 240.0, 270.0, 330.0, 360.0], 'original_pr... | |
This is maze having 7 * 11 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"4",
"5",
"1",
"3"
] | 3 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]], 'optimal_path': [[1, 0], [1, 1], [2, 1], [3, 1], [4, 1], [5, 1],... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"5",
"2",
"4",
"3"
] | 3 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 0, 0], [1, 1, 0], [0, 2, 0]], 'minute_1': [[1, 0, 0], [1, 2, 0], [0, 2, 0]], 'minute_2': [[1, 0, 0], [2, 2, 0], [0, 2, 0]], 'minute_3': [[2, 0, 0], [2, 2, 0], [0, 2, 0]]}} | |
You are playing a Tower of Hanoi game with 3 rods and 3 disks of various diameters, which can slide onto any rod. You are given the starting and ending configuration of the game as shown in the top and the bottom of the image, respectively. The game has the following rules: i) Only one disk may be moved at a time; ii) ... | [
"5",
"1",
"3",
"6"
] | 1 | {'start_position': [[], [], [3, 2, 1]], 'end_position': [[1], [], [3, 2]], 'moves': [{'position': [[], [], [3, 2, 1]], 'num_moves': 0}, {'position': [[1], [], [3, 2]], 'num_moves': 1}]} | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"3",
"6",
"1",
"4"
] | 3 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[0, 2, 0], [1, 1, 1], [1, 0, 0]], 'minute_1': [[0, 2, 0], [1, 2, 1], [1, 0, 0]], 'minute_2': [[0, 2, 0], [2, 2, 2], [1, 0, 0]], 'minute_3': [[0, 2, 0], [2, 2, 2], [2, 0, 0]]}} | |
You are given 4 jugs of capacities 12, 7, 4, 2 litres. Initially, the amount of water that is contained in each jar is shown in the image. A single step of water pouring from one jug to another is constrained by the following rules: i) take a non-empty jug and pour water from it to another non-full jug until the first ... | [
"2",
"1",
"3",
"6"
] | 1 | {'num_jugs': 4, 'capacities': [12, 7, 4, 2], 'total_water': 18, 'start': [9, 5, 2, 2], 'end': [7, 5, 4, 2], 'steps': [[9, 5, 2, 2], [7, 5, 4, 2]], 'num_steps': 1} | |
A 1 * 5 board consists of 5 different coloured tiles. A random state of the board is shown in (A). The ideal state of the board is shown in (B). A swap consists of selecting any two tiles on the board and switching their positions. What is the minimum number of swaps required to restore the ideal state of the board fro... | [
"1",
"4",
"2",
"5"
] | 2 | {'ideal_grid': [[[255, 111, 60], [255, 133, 60], [255, 155, 60], [255, 177, 60], [255, 201, 60]]], 'shuffled_grid': [[[255, 201, 60], [255, 155, 60], [255, 133, 60], [255, 177, 60], [255, 111, 60]]], 'shuffled_order': [4, 2, 1, 3, 0], 'swaps': 2, 'in_position': 1, 'out_of_position': 4} | |
Alice has 9 segments of chains of different lengths as shown in the image. The total length of all the segments combined is 22 pieces. She has a saw machine with which a closed piece can be cut opened. She also has a welding machine with which an open piece can be closed. Each cut takes 4 minutes and each welding takes... | [
"29",
"27",
"48",
"21"
] | 29 | {'steps': [[4, 0, 1, 2, 0, 2], [5, 1, 0, 2, 0, 2]], 'cuts': 1, 'joins': 5, 'each_cut_time': 4, 'each_join_time': 5, 'total_time': 29} | |
A 5 * 4 board consists of 20 different coloured tiles. A random state of the board is shown in (A). The ideal state of the board is shown in (B). A swap consists of selecting any two tiles on the board and switching their positions. What is the minimum number of swaps required to restore the ideal state of the board fr... | [
"7",
"6",
"9",
"3"
] | 7 | {'ideal_grid': [[[255, 182, 0], [255, 156, 59], [255, 130, 118], [255, 102, 178]], [[242, 166, 22], [235, 142, 66], [227, 119, 112], [219, 94, 157]], [[229, 150, 44], [215, 128, 73], [199, 108, 106], [183, 86, 136]], [[216, 134, 66], [195, 114, 80], [171, 97, 100], [147, 78, 115]], [[203, 115, 88], [172, 99, 90], [141,... | |
A checker game is being played on a grid of 10 squares with 4 green and 5 red checkers. Initially, the checkers are arranged as shown in the starting configuration with the 9 checkers occupying 9 squares and one unoccupied square. Green checkers only move rightward and red checkers only move leftward. Every move is eit... | [
"2",
"5",
"3",
"0"
] | 3 | {'start_position': 'RRGRG_GRGR', 'end_position': 'RRGRGRGR_G', 'green_checkers': 4, 'red_checkers': 5, 'moves': ['RRGRG_GRGR', 'RRGRGRG_GR', 'RRGRGRGRG_', 'RRGRGRGR_G']} | |
You are given a 9 * 9 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 9 chess queens on this board so that no two queens threaten each other; i.e. no two queens sh... | [
"14",
"5",
"8",
"7"
] | 8 | {'rows': 9, 'columns': 9, 'given_queen_positions': [[0, 2], [1, 8], [2, 3], [4, 4], [6, 5], [7, 0], [8, 6]], 'missing_queen_positions': [[3, 7], [5, 1]]} | |
A 3 * 3 Rubik's Cube has six different coloured panels: red, green, blue, yellow, orange, and grey. The initial state of the cube in terms of the different colour positions in its six faces is shown in the image. To represent the movements of the cube we use six letters: U for Up, D for Down, L for Left, R for Right, F... | [
"4",
"0",
"7",
"2"
] | 2 | {'moves': 'F3', 'query_face': 'down', 'query_colour': 'yellow', 'start_position': {'left': [['grey', 'green', 'yellow'], ['blue', 'blue', 'red'], ['orange', 'green', 'red']], 'right': [['red', 'green', 'red'], ['blue', 'green', 'green'], ['yellow', 'yellow', 'orange']], 'down': [['orange', 'orange', 'grey'], ['red', 'o... | |
Jessica came to an event 32 minutes ago. The current time is shown on the clock. The clock is a standard analog clock without the seconds hand. What was the time when Jessica came to the event? | [
"8:20",
"10:31",
"2:30",
"2:02"
] | 2:02 | {'current_hour': 2, 'current_minute': 34, 'subtract_hour': 0, 'subtract_minute': 32} | |
This is maze having 11 * 9 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"5",
"21",
"35",
"6"
] | 21 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 0, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 0, 1, 0, 1], [1, 0, 1, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 1, 0, 0, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1... | |
You are given a 3 x 3 grid in which each cell can contain either no kiwi, one fresh kiwi, or one rotten kiwi. Every minute, any fresh kiwi that is 4-directionally adjacent to a rotten kiwi also becomes rotten. What is the minimum number of minutes that must elapse until no cell has a fresh kiwi? | [
"2",
"6",
"4",
"5"
] | 4 | {'ids': {'empty': 0, 'fresh': 1, 'rotten': 2}, 'timestep': {'minute_0': [[1, 0, 2], [1, 1, 1], [1, 0, 1]], 'minute_1': [[1, 0, 2], [1, 1, 2], [1, 0, 1]], 'minute_2': [[1, 0, 2], [1, 2, 2], [1, 0, 2]], 'minute_3': [[1, 0, 2], [2, 2, 2], [1, 0, 2]], 'minute_4': [[2, 0, 2], [2, 2, 2], [2, 0, 2]]}} | |
A 3 * 3 Rubik's Cube has six different coloured panels: red, green, blue, yellow, orange, and grey. The initial state of the cube in terms of the different colour positions in its six faces is shown in the image. To represent the movements of the cube we use six letters: U for Up, D for Down, L for Left, R for Right, F... | [
"9",
"7",
"5",
"3"
] | 5 | {'moves': 'D L3 F3', 'query_face': 'right', 'query_colour': 'grey', 'start_position': {'left': [['red', 'red', 'red'], ['red', 'red', 'red'], ['red', 'red', 'red']], 'right': [['grey', 'grey', 'grey'], ['grey', 'grey', 'grey'], ['grey', 'grey', 'grey']], 'down': [['orange', 'orange', 'orange'], ['orange', 'orange', 'or... | |
A 6 * 4 board consists of 24 different coloured tiles. A random state of the board is shown in (A). The ideal state of the board is shown in (B). A swap consists of selecting any two tiles on the board and switching their positions. What is the minimum number of swaps required to restore the ideal state of the board fr... | [
"1",
"2",
"5",
"3"
] | 3 | {'ideal_grid': [[[163, 173, 142], [193, 181, 142], [223, 189, 142], [255, 198, 142]], [[132, 161, 154], [156, 170, 149], [180, 179, 145], [205, 188, 140]], [[101, 149, 166], [119, 159, 156], [137, 169, 148], [155, 178, 138]], [[70, 137, 178], [82, 148, 163], [94, 159, 151], [105, 168, 136]], [[39, 125, 190], [45, 137, ... | |
This is maze having 9 * 7 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell of... | [
"2",
"1",
"4",
"5"
] | 2 | {'maze': [[1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 1, 1, 1], [1, 0, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 1], [1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1]], 'optimal_path': [[1, 0], [1, 1], [2, 1], [3, 1], [4, 1], [5, 1], [5, 2], [5, 3], [6, 3], [7, 3], [7, 4... | |
This is maze having 7 * 13 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell o... | [
"5",
"1",
"4",
"3"
] | 4 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]], 'optimal_path': [[1, 0... | |
A fortune wheel has 10 segments of different colour. The initial position of the wheel is shown in the figure. Each segment is associated with a prize as shown in the embedded text within the segment. The axis of rotation of the wheel passes through its center and is perpendicular to the surface of the wheel. You spin ... | [
"Pizza",
"Ice Cream",
"Jewelry",
"Camera"
] | Camera | {'angles': [20, 20, 30, 45, 30, 30, 20, 60, 45, 60], 'arrow_at': 45, 'effective_rotation': -288, 'direction': 'clockwise', 'original_colors': ['darkorange', 'blanchedalmond', 'cyan', 'orangered', 'royalblue', 'silver', 'lime', 'magenta', 'yellow', 'forestgreen'], 'original_boundaries': [45.0, 65.0, 85.0, 115.0, 160.0, ... | |
You are given a 10 * 10 chessboard. The Manhattan distance between two squares in a chessboard is equal to the minimal number of orthogonal King moves between these squares on the otherwise empty board. The objective is to place 10 chess queens on this board so that no two queens threaten each other; i.e. no two queens... | [
"11",
"9",
"3",
"13"
] | 9 | {'rows': 10, 'columns': 10, 'given_queen_positions': [[1, 4], [2, 6], [3, 0], [4, 9], [6, 8], [7, 2], [8, 7], [9, 3]], 'missing_queen_positions': [[0, 1], [5, 5]]} | |
This is maze having 7 * 9 cells. The empty cells are coloured white and the obstacle cells are coloured black. From an empty cell, you can only move up, down, left, or right to another adjacent empty cell. You cannot move diagonally between two empty cells and cannot step into a cell with an obstacle. The entry cell of... | [
"1",
"5",
"4",
"3"
] | 3 | {'maze': [[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 1, 0, 1, 1, 1], [1, 0, 1, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1]], 'optimal_path': [[1, 0], [1, 1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [2, 7], [3, 7], [3, 6], [... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3