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