messages listlengths 1 1 | ground_truth stringclasses 8
values | dataset stringclasses 1
value |
|---|---|---|
[
{
"content": "In a 12x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 16), provided you can move right or up 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), ... | 4 | MATH |
[
{
"content": "In a 13x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 17), provided you can move right or up 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, 8), ... | 3 | MATH |
[
{
"content": "In a 19x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 10), provided you can move right or up 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), ... | 5 | MATH |
[
{
"content": "In a 12x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 17), provided you can move right or up 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, 10),... | 3 | MATH |
[
{
"content": "In a 10x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 17), provided you can move right or up 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, 8), (... | 6 | MATH |
[
{
"content": "In a 16x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 16), provided you can move right or up 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),... | 2 | MATH |
[
{
"content": "In a 11x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 15), provided you can move right or up 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, 13),... | 4 | MATH |
[
{
"content": "In a 16x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 14), provided you can move right or up 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), ... | 5 | MATH |
[
{
"content": "In a 15x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 15), provided you can move right or up 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, 15),... | 5 | MATH |
[
{
"content": "In a 11x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 11), provided you can move right or up 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, 9), ... | 4 | MATH |
[
{
"content": "In a 19x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 10), provided you can move right or up 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, 7),... | 4 | MATH |
[
{
"content": "In a 13x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 10), provided you can move right or up 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, 5),... | 3 | MATH |
[
{
"content": "In a 16x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 18), provided you can move right or up 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 17x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 18), provided you can move right or up 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 17x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 16), provided you can move right or up 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, 14),... | 5 | MATH |
[
{
"content": "In a 12x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 15), provided you can move right or up 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, 14),... | 6 | MATH |
[
{
"content": "In a 16x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 18), provided you can move right or up 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, 16),... | 3 | MATH |
[
{
"content": "In a 12x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 15), provided you can move right or up 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, 1), ... | 5 | MATH |
[
{
"content": "In a 13x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 14), provided you can move right or up 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, 8), ... | 3 | MATH |
[
{
"content": "In a 10x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 13), provided you can move right or up 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, 7), (... | 4 | MATH |
[
{
"content": "In a 14x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 13), provided you can move right or up 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, 10)... | 4 | MATH |
[
{
"content": "In a 18x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 14), provided you can move right or up 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),... | 5 | MATH |
[
{
"content": "In a 16x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 17), provided you can move right or up 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, 12),... | 5 | MATH |
[
{
"content": "In a 16x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 13), provided you can move right or up 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),... | 4 | MATH |
[
{
"content": "In a 18x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 10), provided you can move right or up 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, 9),... | 2 | MATH |
[
{
"content": "In a 14x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 14), provided you can move right or up 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, 8), ... | 5 | MATH |
[
{
"content": "In a 14x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 10), provided you can move right or up 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),... | 4 | MATH |
[
{
"content": "In a 19x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 10), provided you can move right or up 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, 6), ... | 4 | MATH |
[
{
"content": "In a 18x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 18), provided you can move right or up 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, 11),... | 5 | MATH |
[
{
"content": "In a 13x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 18), provided you can move right or up 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), ... | 3 | MATH |
[
{
"content": "In a 17x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 11), provided you can move right or up 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, 0), ... | 5 | MATH |
[
{
"content": "In a 13x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 17), provided you can move right or up 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, 17)... | 4 | MATH |
[
{
"content": "In a 16x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 11), provided you can move right or up 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),... | 3 | MATH |
[
{
"content": "In a 14x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 18), provided you can move right or up 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, 1),... | 5 | MATH |
[
{
"content": "In a 17x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 13), provided you can move right or up 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),... | 3 | MATH |
[
{
"content": "In a 13x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 15), provided you can move right or up 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, 1),... | 5 | MATH |
[
{
"content": "In a 17x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 10), provided you can move right or up 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, 8), ... | 4 | MATH |
[
{
"content": "In a 12x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 14), provided you can move right or up 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, 9), ... | 2 | MATH |
[
{
"content": "In a 12x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 10), provided you can move right or up 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, 3), ... | 3 | MATH |
[
{
"content": "In a 18x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 11), provided you can move right or up 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, 11),... | 5 | MATH |
[
{
"content": "In a 13x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 15), provided you can move right or up 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, 4), ... | 6 | MATH |
[
{
"content": "In a 12x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 13), provided you can move right or up 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),... | 4 | MATH |
[
{
"content": "In a 18x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 14), provided you can move right or up 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, 11)... | 4 | MATH |
[
{
"content": "In a 12x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 14), provided you can move right or up 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, 7),... | 5 | MATH |
[
{
"content": "In a 18x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 10), provided you can move right or up 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, 7), ... | 3 | MATH |
[
{
"content": "In a 18x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 18), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (4, 15),... | 5 | MATH |
[
{
"content": "In a 10x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 17), provided you can move right or up 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, 12), ... | 4 | MATH |
[
{
"content": "In a 13x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 16), provided you can move right or up 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, 6),... | 2 | MATH |
[
{
"content": "In a 12x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 9), provided you can move right or up 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, 7), (... | 4 | MATH |
[
{
"content": "In a 16x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 9), provided you can move right or up 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, 4), (... | 5 | MATH |
[
{
"content": "In a 18x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 13), provided you can move right or up 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, 12),... | 4 | MATH |
[
{
"content": "In a 16x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 11), provided you can move right or up 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, 6), ... | 3 | MATH |
[
{
"content": "In a 11x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 9), provided you can move right or up 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, 9), (... | 4 | MATH |
[
{
"content": "In a 19x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 11), provided you can move right or up 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, 7), ... | 4 | MATH |
[
{
"content": "In a 13x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 11), provided you can move right or up 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), ... | 3 | MATH |
[
{
"content": "In a 16x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 16), provided you can move right or up 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, 8), ... | 5 | MATH |
[
{
"content": "In a 16x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 16), provided you can move right or up 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), ... | 3 | MATH |
[
{
"content": "In a 12x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 15), provided you can move right or up 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, 10),... | 3 | MATH |
[
{
"content": "In a 14x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 16), provided you can move right or up 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), ... | 4 | MATH |
[
{
"content": "In a 12x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 9), provided you can move right or up 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, 0), (... | 6 | MATH |
[
{
"content": "In a 19x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 10), provided you can move right or up 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), ... | 4 | MATH |
[
{
"content": "In a 13x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 18), provided you can move right or up 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, 4),... | 4 | MATH |
[
{
"content": "In a 14x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 15), provided you can move right or up 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, 9), ... | 5 | MATH |
[
{
"content": "In a 15x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 12), provided you can move right or up 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, 0), ... | 4 | MATH |
[
{
"content": "In a 19x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 18), provided you can move right or up 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, 0),... | 4 | MATH |
[
{
"content": "In a 10x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 10), provided you can move right or up 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), (... | 3 | MATH |
[
{
"content": "In a 14x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 15), provided you can move right or up 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, 5),... | 5 | MATH |
[
{
"content": "In a 11x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 9), provided you can move right or up 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), (... | 4 | MATH |
[
{
"content": "In a 11x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 13), provided you can move right or up 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, 7),... | 6 | MATH |
[
{
"content": "In a 17x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 12), provided you can move right or up 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, 11),... | 4 | MATH |
[
{
"content": "In a 12x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (11, 12), provided you can move right or up 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, 7), ... | 7 | MATH |
[
{
"content": "In a 14x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 16), provided you can move right or up 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),... | 4 | MATH |
[
{
"content": "In a 11x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 12), provided you can move right or up 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, 1), ... | 3 | MATH |
[
{
"content": "In a 17x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 18), provided you can move right or up 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, 11),... | 6 | MATH |
[
{
"content": "In a 15x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 18), provided you can move right or up 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, 18),... | 3 | MATH |
[
{
"content": "In a 11x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 13), provided you can move right or up 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, 8), ... | 4 | MATH |
[
{
"content": "In a 19x19 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 18), provided you can move right or up 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, 12),... | 4 | MATH |
[
{
"content": "In a 14x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (13, 13), provided you can move right or up 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, 11),... | 3 | MATH |
[
{
"content": "In a 11x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 9), provided you can move right or up 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), (... | 2 | MATH |
[
{
"content": "In a 10x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 13), provided you can move right or up 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, 10), ... | 5 | MATH |
[
{
"content": "In a 10x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 9), provided you can move right or up 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), (3... | 3 | MATH |
[
{
"content": "In a 18x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 10), provided you can move right or up 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), ... | 4 | MATH |
[
{
"content": "In a 19x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 12), provided you can move right or up 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, 1),... | 4 | MATH |
[
{
"content": "In a 17x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 14), provided you can move right or up 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, 7),... | 5 | MATH |
[
{
"content": "In a 17x12 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (16, 11), provided you can move right or up 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), ... | 7 | MATH |
[
{
"content": "In a 13x10 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 9), provided you can move right or up 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, 6), (... | 6 | MATH |
[
{
"content": "In a 10x11 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (9, 10), provided you can move right or up 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 16x18 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 17), provided you can move right or up 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, 1),... | 2 | MATH |
[
{
"content": "In a 11x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 12), provided you can move right or up 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, 2), ... | 5 | MATH |
[
{
"content": "In a 13x15 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (12, 14), provided you can move right or up 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), ... | 3 | MATH |
[
{
"content": "In a 19x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (18, 13), provided you can move right or up 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, 4),... | 4 | MATH |
[
{
"content": "In a 15x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 15), provided you can move right or up 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, 7),... | 3 | MATH |
[
{
"content": "In a 16x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 12), provided you can move right or up 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), ... | 4 | MATH |
[
{
"content": "In a 15x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 16), provided you can move right or up 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, 0), ... | 4 | MATH |
[
{
"content": "In a 18x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 15), provided you can move right or up 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), ... | 5 | MATH |
[
{
"content": "In a 11x16 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (10, 15), provided you can move right or up 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, 11),... | 5 | MATH |
[
{
"content": "In a 15x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (14, 13), provided you can move right or up 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),... | 4 | MATH |
[
{
"content": "In a 16x13 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 12), provided you can move right or up 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, 8), ... | 6 | MATH |
[
{
"content": "In a 16x17 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (15, 16), provided you can move right or up 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, 7),... | 5 | MATH |
[
{
"content": "In a 18x14 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (17, 13), provided you can move right or up 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), ... | 3 | MATH |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.