messages
listlengths
1
1
ground_truth
stringclasses
11 values
dataset
stringclasses
1 value
[ { "content": "In a 20x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 20), 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, 19)...
5
MATH
[ { "content": "In a 27x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 25), 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, 9),...
4
MATH
[ { "content": "In a 21x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 22), 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, 12)...
5
MATH
[ { "content": "In a 27x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 28), 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, 10),...
8
MATH
[ { "content": "In a 29x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 27), 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, 23),...
5
MATH
[ { "content": "In a 27x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 25), 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, 2), ...
4
MATH
[ { "content": "In a 29x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 25), 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, 24)...
5
MATH
[ { "content": "In a 22x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 19), 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, 17)...
6
MATH
[ { "content": "In a 28x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 20), 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, 5), ...
4
MATH
[ { "content": "In a 24x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 27), 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: (7, 23),...
7
MATH
[ { "content": "In a 29x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 25), 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, 1),...
7
MATH
[ { "content": "In a 20x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 27), 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, 25)...
5
MATH
[ { "content": "In a 21x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 25), 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, 11),...
3
MATH
[ { "content": "In a 25x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 28), 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: (7, 14),...
6
MATH
[ { "content": "In a 28x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 21), 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: (9, 2), ...
9
MATH
[ { "content": "In a 24x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 25), 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: (9, 8), ...
5
MATH
[ { "content": "In a 21x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 27), 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),...
4
MATH
[ { "content": "In a 20x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 25), 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, 20)...
4
MATH
[ { "content": "In a 22x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 19), 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, 2), ...
5
MATH
[ { "content": "In a 29x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 25), 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, 21)...
3
MATH
[ { "content": "In a 20x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 23), 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, 0), ...
6
MATH
[ { "content": "In a 20x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 27), 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: (10, 25)...
8
MATH
[ { "content": "In a 21x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 19), 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: (9, 9), ...
4
MATH
[ { "content": "In a 24x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 26), 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, 0),...
5
MATH
[ { "content": "In a 24x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 21), 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, 9),...
4
MATH
[ { "content": "In a 20x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 20), 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, 13),...
5
MATH
[ { "content": "In a 23x25 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 24), 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, 23),...
5
MATH
[ { "content": "In a 29x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 20), 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, 16),...
6
MATH
[ { "content": "In a 21x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 20), 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, 0),...
6
MATH
[ { "content": "In a 24x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 21), 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, 8),...
6
MATH
[ { "content": "In a 28x25 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 24), 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, 12)...
6
MATH
[ { "content": "In a 29x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 20), 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, 14)...
6
MATH
[ { "content": "In a 26x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 27), 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, 17)...
5
MATH
[ { "content": "In a 27x25 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 24), 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, 16),...
6
MATH
[ { "content": "In a 24x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 20), 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, 5),...
2
MATH
[ { "content": "In a 20x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 21), 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, 9),...
5
MATH
[ { "content": "In a 29x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 23), 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, 0), ...
5
MATH
[ { "content": "In a 27x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 28), 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, 25)...
3
MATH
[ { "content": "In a 21x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 27), 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, 10),...
6
MATH
[ { "content": "In a 28x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 27), 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: (24, 26)...
7
MATH
[ { "content": "In a 24x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 22), 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, 12)...
6
MATH
[ { "content": "In a 27x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 23), 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, 2),...
6
MATH
[ { "content": "In a 21x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 25), 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, 25),...
6
MATH
[ { "content": "In a 20x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 22), 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, 11),...
3
MATH
[ { "content": "In a 26x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 28), 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, 6),...
8
MATH
[ { "content": "In a 20x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 20), 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, 18),...
5
MATH
[ { "content": "In a 20x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 19), 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, 4), ...
6
MATH
[ { "content": "In a 23x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 27), 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),...
5
MATH
[ { "content": "In a 22x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 20), 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, 3),...
5
MATH
[ { "content": "In a 23x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 19), 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, 5), ...
4
MATH
[ { "content": "In a 26x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 21), 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, 18),...
6
MATH
[ { "content": "In a 22x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 27), 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: (10, 2),...
6
MATH
[ { "content": "In a 22x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 21), 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, 19),...
3
MATH
[ { "content": "In a 20x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 27), 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, 15)...
4
MATH
[ { "content": "In a 27x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 22), 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),...
5
MATH
[ { "content": "In a 25x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 23), 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, 16),...
8
MATH
[ { "content": "In a 22x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 19), 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, 12),...
6
MATH
[ { "content": "In a 23x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 22), 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, 5), ...
4
MATH
[ { "content": "In a 22x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 19), 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, 15),...
6
MATH
[ { "content": "In a 24x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 23), 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, 16)...
5
MATH
[ { "content": "In a 26x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 26), 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, 10)...
4
MATH
[ { "content": "In a 23x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 26), 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, 10)...
6
MATH
[ { "content": "In a 25x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 26), 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, 8),...
4
MATH
[ { "content": "In a 21x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 26), 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, 7),...
5
MATH
[ { "content": "In a 29x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 25), 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, 0), ...
7
MATH
[ { "content": "In a 21x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 28), 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, 28),...
4
MATH
[ { "content": "In a 27x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 20), 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, 10),...
5
MATH
[ { "content": "In a 21x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 20), 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, 10)...
5
MATH
[ { "content": "In a 23x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (22, 23), 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, 8),...
6
MATH
[ { "content": "In a 29x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (28, 28), 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, 6),...
6
MATH
[ { "content": "In a 25x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 19), 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, 6),...
4
MATH
[ { "content": "In a 22x25 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 24), 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, 3), ...
4
MATH
[ { "content": "In a 25x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 20), 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, 8),...
4
MATH
[ { "content": "In a 28x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 23), 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, 18)...
5
MATH
[ { "content": "In a 24x24 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 23), 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: (9, 5), ...
10
MATH
[ { "content": "In a 27x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 20), 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, 19),...
5
MATH
[ { "content": "In a 24x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 22), 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, 6),...
5
MATH
[ { "content": "In a 20x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 26), 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, 10)...
3
MATH
[ { "content": "In a 26x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 27), 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, 25),...
7
MATH
[ { "content": "In a 21x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 19), 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, 7),...
4
MATH
[ { "content": "In a 22x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 26), 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, 25),...
4
MATH
[ { "content": "In a 20x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (19, 21), 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, 20),...
3
MATH
[ { "content": "In a 21x25 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 24), 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, 11),...
7
MATH
[ { "content": "In a 22x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 27), 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: (9, 13),...
6
MATH
[ { "content": "In a 26x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 25), 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, 9),...
5
MATH
[ { "content": "In a 27x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 21), 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: (10, 3),...
4
MATH
[ { "content": "In a 24x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (23, 21), 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, 18)...
6
MATH
[ { "content": "In a 21x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 26), 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, 24),...
3
MATH
[ { "content": "In a 26x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 21), 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, 20),...
5
MATH
[ { "content": "In a 22x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 28), 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, 8),...
6
MATH
[ { "content": "In a 21x21 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 20), 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, 2),...
6
MATH
[ { "content": "In a 25x27 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 26), 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, 3),...
5
MATH
[ { "content": "In a 26x20 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 19), 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, 2),...
5
MATH
[ { "content": "In a 27x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 28), 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, 4),...
9
MATH
[ { "content": "In a 28x26 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (27, 25), 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, 5), ...
7
MATH
[ { "content": "In a 26x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (25, 27), 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, 1),...
4
MATH
[ { "content": "In a 25x28 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (24, 27), 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, 5),...
5
MATH
[ { "content": "In a 21x29 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (20, 28), 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: (9, 15),...
5
MATH
[ { "content": "In a 27x22 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (26, 21), 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, 20)...
9
MATH
[ { "content": "In a 22x23 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (21, 22), 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, 2),...
6
MATH