messages listlengths 1 1 | ground_truth stringclasses 14 values | dataset stringclasses 1 value |
|---|---|---|
[
{
"content": "In a 39x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 35), 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, 12)... | 5 | MATH |
[
{
"content": "In a 33x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 37), 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, 16)... | 6 | MATH |
[
{
"content": "In a 32x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 32), 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, 19)... | 8 | MATH |
[
{
"content": "In a 33x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 34), 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, 32),... | 11 | MATH |
[
{
"content": "In a 39x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 34), 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, 12)... | 6 | MATH |
[
{
"content": "In a 39x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 30), 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 30x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 29), 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, 25)... | 8 | MATH |
[
{
"content": "In a 36x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 29), 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, 18)... | 6 | MATH |
[
{
"content": "In a 38x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 35), 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, 28)... | 5 | MATH |
[
{
"content": "In a 37x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 32), 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),... | 9 | MATH |
[
{
"content": "In a 36x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 37), 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, 25)... | 9 | MATH |
[
{
"content": "In a 33x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 30), 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, 24),... | 7 | MATH |
[
{
"content": "In a 38x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 32), 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, 0),... | 6 | MATH |
[
{
"content": "In a 39x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 36), 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: (28, 5),... | 6 | MATH |
[
{
"content": "In a 33x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 31), 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, 21)... | 8 | MATH |
[
{
"content": "In a 30x39 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 38), 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, 12),... | 9 | MATH |
[
{
"content": "In a 34x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 30), 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, 14),... | 9 | MATH |
[
{
"content": "In a 33x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 32), 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, 1),... | 7 | MATH |
[
{
"content": "In a 37x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 34), 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, 18)... | 6 | MATH |
[
{
"content": "In a 35x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 35), 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, 6),... | 7 | MATH |
[
{
"content": "In a 39x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 35), 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),... | 12 | MATH |
[
{
"content": "In a 35x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 37), 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: (34, 16)... | 9 | MATH |
[
{
"content": "In a 31x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 29), 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, 18)... | 8 | MATH |
[
{
"content": "In a 30x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 33), 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, 6),... | 7 | MATH |
[
{
"content": "In a 36x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 31), 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, 25)... | 8 | MATH |
[
{
"content": "In a 38x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 29), 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, 27)... | 8 | MATH |
[
{
"content": "In a 31x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 32), 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, 15)... | 3 | MATH |
[
{
"content": "In a 33x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 35), 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, 14)... | 4 | MATH |
[
{
"content": "In a 30x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 37), 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),... | 4 | MATH |
[
{
"content": "In a 31x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 29), 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)... | 6 | MATH |
[
{
"content": "In a 31x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 29), 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, 17)... | 8 | MATH |
[
{
"content": "In a 32x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 29), 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, 24),... | 8 | MATH |
[
{
"content": "In a 32x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 36), 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: (28, 14)... | 8 | MATH |
[
{
"content": "In a 38x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 29), 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, 20)... | 9 | MATH |
[
{
"content": "In a 31x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 36), 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, 5), ... | 9 | MATH |
[
{
"content": "In a 37x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 29), 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)... | 6 | MATH |
[
{
"content": "In a 35x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 34), 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, 2), ... | 5 | MATH |
[
{
"content": "In a 34x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 36), 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, 26)... | 9 | MATH |
[
{
"content": "In a 33x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 36), 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, 8),... | 11 | MATH |
[
{
"content": "In a 37x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 32), 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: (25, 2),... | 13 | MATH |
[
{
"content": "In a 30x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 33), 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, 9), ... | 11 | MATH |
[
{
"content": "In a 32x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 36), 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, 24),... | 6 | MATH |
[
{
"content": "In a 35x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 31), 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, 14)... | 10 | MATH |
[
{
"content": "In a 34x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 31), 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, 25),... | 9 | MATH |
[
{
"content": "In a 37x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 33), 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, 16),... | 6 | MATH |
[
{
"content": "In a 37x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 36), 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, 36)... | 7 | MATH |
[
{
"content": "In a 35x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 30), 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, 24)... | 11 | MATH |
[
{
"content": "In a 36x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 34), 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),... | 5 | MATH |
[
{
"content": "In a 34x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 34), 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, 10)... | 8 | MATH |
[
{
"content": "In a 37x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 35), 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, 8),... | 9 | MATH |
[
{
"content": "In a 35x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 30), 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, 4),... | 10 | MATH |
[
{
"content": "In a 34x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 29), 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),... | 5 | MATH |
[
{
"content": "In a 38x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 35), 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, 27),... | 11 | MATH |
[
{
"content": "In a 38x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 35), 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, 27)... | 7 | MATH |
[
{
"content": "In a 34x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 34), 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, 32),... | 7 | MATH |
[
{
"content": "In a 31x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 35), 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, 31)... | 9 | MATH |
[
{
"content": "In a 31x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 29), 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, 0), ... | 7 | MATH |
[
{
"content": "In a 38x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 32), 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)... | 9 | MATH |
[
{
"content": "In a 36x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 31), 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, 29)... | 8 | MATH |
[
{
"content": "In a 37x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 29), 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, 21)... | 8 | MATH |
[
{
"content": "In a 39x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 33), 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, 8), ... | 5 | MATH |
[
{
"content": "In a 32x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 29), 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, 19)... | 5 | MATH |
[
{
"content": "In a 33x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 33), 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, 20),... | 8 | MATH |
[
{
"content": "In a 31x39 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 38), 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), ... | 9 | MATH |
[
{
"content": "In a 33x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 32), 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, 6),... | 8 | MATH |
[
{
"content": "In a 32x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 29), 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)... | 8 | MATH |
[
{
"content": "In a 37x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 34), 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, 5), ... | 11 | MATH |
[
{
"content": "In a 39x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 31), 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, 13),... | 6 | MATH |
[
{
"content": "In a 36x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 35), 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, 24)... | 9 | MATH |
[
{
"content": "In a 36x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 31), 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, 15)... | 9 | MATH |
[
{
"content": "In a 38x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 30), 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, 0),... | 5 | MATH |
[
{
"content": "In a 38x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 37), 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, 32)... | 6 | MATH |
[
{
"content": "In a 30x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 30), 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, 7),... | 5 | MATH |
[
{
"content": "In a 35x39 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 38), 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, 19)... | 5 | MATH |
[
{
"content": "In a 36x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 33), 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, 32)... | 6 | MATH |
[
{
"content": "In a 32x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 35), 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, 7), ... | 6 | MATH |
[
{
"content": "In a 34x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (33, 35), 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, 25)... | 9 | MATH |
[
{
"content": "In a 37x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (36, 29), 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: (34, 14)... | 7 | MATH |
[
{
"content": "In a 38x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 33), 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),... | 7 | MATH |
[
{
"content": "In a 38x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 30), 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, 27)... | 7 | MATH |
[
{
"content": "In a 30x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 33), 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, 25),... | 8 | MATH |
[
{
"content": "In a 30x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 34), 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, 30)... | 10 | MATH |
[
{
"content": "In a 39x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 32), 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, 4),... | 8 | MATH |
[
{
"content": "In a 35x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 32), 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, 2),... | 6 | MATH |
[
{
"content": "In a 38x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 30), 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),... | 7 | MATH |
[
{
"content": "In a 30x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (29, 37), 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: (28, 29)... | 10 | MATH |
[
{
"content": "In a 36x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 33), 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, 27),... | 7 | MATH |
[
{
"content": "In a 31x32 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 31), 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, 24),... | 5 | MATH |
[
{
"content": "In a 33x33 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (32, 32), 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: (29, 26)... | 7 | MATH |
[
{
"content": "In a 32x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 33), 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, 7),... | 6 | MATH |
[
{
"content": "In a 36x36 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 35), 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, 5),... | 7 | MATH |
[
{
"content": "In a 32x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (31, 30), 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, 9), ... | 6 | MATH |
[
{
"content": "In a 36x39 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (35, 38), 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, 6),... | 4 | MATH |
[
{
"content": "In a 31x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 36), 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, 9), ... | 6 | MATH |
[
{
"content": "In a 38x37 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 36), 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, 20),... | 9 | MATH |
[
{
"content": "In a 38x35 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (37, 34), 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, 7),... | 6 | MATH |
[
{
"content": "In a 31x30 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (30, 29), 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),... | 5 | MATH |
[
{
"content": "In a 35x31 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 30), 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, 3), ... | 4 | MATH |
[
{
"content": "In a 35x38 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (34, 37), 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 39x34 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (38, 33), 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, 18)... | 6 | MATH |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.