Dataset Viewer
Auto-converted to Parquet Duplicate
messages
listlengths
1
1
ground_truth
stringclasses
15 values
dataset
stringclasses
1 value
[ { "content": "In a 45x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (2, 10),...
13
MATH
[ { "content": "In a 49x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (21, 17)...
10
MATH
[ { "content": "In a 47x49 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (46, 48), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (6, 44),...
5
MATH
[ { "content": "In a 45x49 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 48), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (5, 36),...
10
MATH
[ { "content": "In a 45x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (35, 14)...
10
MATH
[ { "content": "In a 45x45 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 44), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (1, 35),...
7
MATH
[ { "content": "In a 43x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (8, 21),...
7
MATH
[ { "content": "In a 49x45 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 44), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (1, 19),...
8
MATH
[ { "content": "In a 44x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (43, 32)...
9
MATH
[ { "content": "In a 48x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (13, 22)...
7
MATH
[ { "content": "In a 49x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (19, 37)...
5
MATH
[ { "content": "In a 46x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (45, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (18, 19)...
9
MATH
[ { "content": "In a 45x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (16, 7),...
5
MATH
[ { "content": "In a 47x46 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (46, 45), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (33, 35)...
8
MATH
[ { "content": "In a 45x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (17, 34)...
6
MATH
[ { "content": "In a 43x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (36, 19)...
8
MATH
[ { "content": "In a 41x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (33, 37)...
13
MATH
[ { "content": "In a 48x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (44, 13)...
9
MATH
[ { "content": "In a 48x44 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 43), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (32, 32)...
6
MATH
[ { "content": "In a 45x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (36, 8),...
5
MATH
[ { "content": "In a 41x46 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 45), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (30, 43)...
6
MATH
[ { "content": "In a 40x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (39, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (22, 28)...
5
MATH
[ { "content": "In a 49x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (48, 37)...
11
MATH
[ { "content": "In a 40x46 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (39, 45), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (30, 38)...
6
MATH
[ { "content": "In a 43x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (18, 8),...
6
MATH
[ { "content": "In a 48x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (41, 39)...
6
MATH
[ { "content": "In a 46x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (45, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (21, 38)...
7
MATH
[ { "content": "In a 45x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (12, 34)...
10
MATH
[ { "content": "In a 44x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (20, 14)...
9
MATH
[ { "content": "In a 48x45 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 44), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (31, 26)...
5
MATH
[ { "content": "In a 42x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (41, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (4, 15),...
7
MATH
[ { "content": "In a 49x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (23, 10)...
7
MATH
[ { "content": "In a 41x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (3, 22),...
5
MATH
[ { "content": "In a 41x49 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 48), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (15, 3),...
13
MATH
[ { "content": "In a 48x49 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 48), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (26, 27)...
8
MATH
[ { "content": "In a 48x45 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (47, 44), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (2, 26),...
9
MATH
[ { "content": "In a 41x44 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 43), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (11, 31)...
8
MATH
[ { "content": "In a 43x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (35, 39)...
8
MATH
[ { "content": "In a 43x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (14, 17)...
7
MATH
[ { "content": "In a 45x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (14, 29)...
7
MATH
[ { "content": "In a 49x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (48, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (37, 13)...
8
MATH
[ { "content": "In a 40x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (39, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (35, 33)...
8
MATH
[ { "content": "In a 44x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (40, 15)...
7
MATH
[ { "content": "In a 43x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (16, 27)...
10
MATH
[ { "content": "In a 47x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (46, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (40, 28)...
7
MATH
[ { "content": "In a 45x44 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 43), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (37, 7),...
8
MATH
[ { "content": "In a 44x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (41, 15)...
10
MATH
[ { "content": "In a 43x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (42, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (38, 11)...
11
MATH
[ { "content": "In a 42x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (41, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (12, 15)...
10
MATH
[ { "content": "In a 44x42 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 41), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (37, 0),...
12
MATH
[ { "content": "In a 46x47 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (45, 46), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (17, 20)...
5
MATH
[ { "content": "In a 40x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (39, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (31, 13)...
9
MATH
[ { "content": "In a 40x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (39, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (0, 15),...
8
MATH
[ { "content": "In a 44x44 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 43), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (33, 18)...
13
MATH
[ { "content": "In a 41x48 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 47), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (19, 30)...
6
MATH
[ { "content": "In a 46x43 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (45, 42), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (38, 4),...
4
MATH
[ { "content": "In a 41x49 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (40, 48), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (27, 45)...
13
MATH
[ { "content": "In a 45x40 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (44, 39), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (8, 2), ...
6
MATH
[ { "content": "In a 47x45 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (46, 44), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (8, 17),...
10
MATH
[ { "content": "In a 42x44 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (41, 43), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (23, 39)...
11
MATH
[ { "content": "In a 44x41 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (43, 40), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (23, 34)...
6
MATH
End of preview. Expand in Data Studio

No dataset card yet

Downloads last month
10