messages listlengths 1 1 | ground_truth stringclasses 6 values | dataset stringclasses 1 value |
|---|---|---|
[
{
"content": "In a 7x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 7), provided you can move right or up 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), (4, ... | 2 | MATH |
[
{
"content": "In a 6x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 7), provided you can move right or up 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), (2, ... | 3 | MATH |
[
{
"content": "In a 6x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 6), provided you can move right or up 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, 5), (4, ... | 2 | MATH |
[
{
"content": "In a 6x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 7), provided you can move right or up 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, 7), (3, ... | 2 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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, 5), (7, ... | 3 | MATH |
[
{
"content": "In a 9x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 6), provided you can move right or up 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, 1), (4, ... | 3 | MATH |
[
{
"content": "In a 8x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 4), provided you can move right or up 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), (6, ... | 2 | MATH |
[
{
"content": "In a 8x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 5), provided you can move right or up 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, 0), (2, ... | 3 | MATH |
[
{
"content": "In a 5x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 4), provided you can move right or up 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, 0), (2, ... | 3 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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), (2, ... | 3 | MATH |
[
{
"content": "In a 6x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 8), provided you can move right or up 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, 7), (2, ... | 5 | MATH |
[
{
"content": "In a 9x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 8), provided you can move right or up 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), (1, ... | 3 | MATH |
[
{
"content": "In a 9x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 6), provided you can move right or up 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, 2), (2, ... | 3 | MATH |
[
{
"content": "In a 5x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 7), provided you can move right or up 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, 6), (4, ... | 3 | MATH |
[
{
"content": "In a 6x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 4), provided you can move right or up 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), (3, ... | 2 | MATH |
[
{
"content": "In a 7x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 5), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (5, 0), (5, ... | 3 | MATH |
[
{
"content": "In a 9x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 7), provided you can move right or up 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), (8, ... | 5 | MATH |
[
{
"content": "In a 6x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 6), provided you can move right or up 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, 1), (2, ... | 4 | MATH |
[
{
"content": "In a 9x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 4), provided you can move right or up 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), (1, ... | 3 | MATH |
[
{
"content": "In a 7x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 6), provided you can move right or up 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), (1, ... | 3 | MATH |
[
{
"content": "In a 7x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 4), provided you can move right or up 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, 1), (4, ... | 3 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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, 3), (0, ... | 3 | MATH |
[
{
"content": "In a 5x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 8), provided you can move right or up 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, 3), (2, ... | 3 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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, 6), (4, ... | 3 | MATH |
[
{
"content": "In a 9x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 8), provided you can move right or up 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), (3, ... | 4 | MATH |
[
{
"content": "In a 8x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 4), provided you can move right or up 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), (7, ... | 3 | MATH |
[
{
"content": "In a 6x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 8), provided you can move right or up 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, 3), (4, ... | 4 | MATH |
[
{
"content": "In a 6x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 8), provided you can move right or up 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, 1), (5, ... | 3 | MATH |
[
{
"content": "In a 6x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 7), provided you can move right or up 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, 6), (0, ... | 3 | MATH |
[
{
"content": "In a 5x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 7), provided you can move right or up 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), (2, ... | 3 | MATH |
[
{
"content": "In a 7x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 7), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (6, 5), (5, ... | 2 | MATH |
[
{
"content": "In a 7x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 8), provided you can move right or up 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, 1), (5, ... | 4 | MATH |
[
{
"content": "In a 9x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 6), provided you can move right or up 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), (0, ... | 3 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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), (1, ... | 5 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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), (0, ... | 3 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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), (7, ... | 3 | MATH |
[
{
"content": "In a 8x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 4), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (5, 3), (3, ... | 2 | MATH |
[
{
"content": "In a 7x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 5), provided you can move right or up 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, 4), (1, ... | 3 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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, 1), (7, ... | 3 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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, 1), (0, ... | 2 | MATH |
[
{
"content": "In a 8x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 5), provided you can move right or up 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, 4), (3, ... | 4 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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, 3), (7, ... | 4 | MATH |
[
{
"content": "In a 6x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 5), provided you can move right or up 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, ... | 2 | MATH |
[
{
"content": "In a 6x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 6), provided you can move right or up 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, 6), (3, ... | 4 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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, 4), (0, ... | 3 | MATH |
[
{
"content": "In a 9x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 4), provided you can move right or up 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, 3), (6, ... | 2 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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, 4), (6, ... | 2 | MATH |
[
{
"content": "In a 9x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 7), provided you can move right or up 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, 5), (6, ... | 2 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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), (1, ... | 3 | MATH |
[
{
"content": "In a 6x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 7), provided you can move right or up 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, 2), (4, ... | 3 | MATH |
[
{
"content": "In a 8x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 5), provided you can move right or up 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, 5), (7, ... | 4 | MATH |
[
{
"content": "In a 9x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 4), provided you can move right or up 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, 1), (1, ... | 3 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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, 4), (5, ... | 2 | MATH |
[
{
"content": "In a 7x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 6), provided you can move right or up 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, 2), (3, ... | 2 | MATH |
[
{
"content": "In a 9x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 6), provided you can move right or up 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, 6), (0, ... | 2 | MATH |
[
{
"content": "In a 7x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 8), provided you can move right or up 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, 4), (5, ... | 3 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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, 2), (1, ... | 3 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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, 0), (3, ... | 3 | MATH |
[
{
"content": "In a 9x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 4), provided you can move right or up 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), (4, ... | 3 | MATH |
[
{
"content": "In a 7x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 5), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (5, 0), (4, ... | 2 | MATH |
[
{
"content": "In a 7x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 6), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (3, 0), (4, ... | 2 | MATH |
[
{
"content": "In a 6x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 7), provided you can move right or up 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), (4, ... | 3 | MATH |
[
{
"content": "In a 7x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 8), provided you can move right or up 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, 1), (4, ... | 4 | MATH |
[
{
"content": "In a 7x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 5), provided you can move right or up 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), (5, ... | 4 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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, 2), (5, ... | 5 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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), (4, ... | 3 | MATH |
[
{
"content": "In a 5x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 5), provided you can move right or up 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, 4), (3, ... | 5 | MATH |
[
{
"content": "In a 5x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 5), provided you can move right or up 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), (0, ... | 3 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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), (1, ... | 4 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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, 5), (2, ... | 2 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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, ... | 4 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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), (3, ... | 3 | MATH |
[
{
"content": "In a 9x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 8), provided you can move right or up 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), (3, ... | 4 | MATH |
[
{
"content": "In a 5x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 5), provided you can move right or up 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), (4, ... | 4 | MATH |
[
{
"content": "In a 5x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 4), provided you can move right or up 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, 2), (1, ... | 3 | MATH |
[
{
"content": "In a 7x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 7), provided you can move right or up 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), (3, ... | 2 | MATH |
[
{
"content": "In a 9x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 4), provided you can move right or up 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, 2), (6, ... | 2 | MATH |
[
{
"content": "In a 9x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 7), provided you can move right or up 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, 1), (7, ... | 3 | MATH |
[
{
"content": "In a 9x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 7), provided you can move right or up 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, 7), (7, ... | 3 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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, 1), (8, ... | 3 | MATH |
[
{
"content": "In a 8x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 6), provided you can move right or up 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, 5), (2, ... | 5 | MATH |
[
{
"content": "In a 5x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 8), provided you can move right or up 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), (4, ... | 2 | MATH |
[
{
"content": "In a 7x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 7), provided you can move right or up 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), (3, ... | 4 | MATH |
[
{
"content": "In a 7x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 6), provided you can move right or up 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, 1), (5, ... | 2 | MATH |
[
{
"content": "In a 5x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 6), provided you can move right or up 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), (1, ... | 2 | MATH |
[
{
"content": "In a 5x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 5), provided you can move right or up by any number of cells (like a chess rook) at each step, subject to the constraint that you cannot move through the following cells: (3, 0), (2, ... | 2 | MATH |
[
{
"content": "In a 7x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 4), provided you can move right or up 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, 3), (5, ... | 4 | MATH |
[
{
"content": "In a 8x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 8), provided you can move right or up 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, 5), (4, ... | 4 | MATH |
[
{
"content": "In a 8x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 4), provided you can move right or up 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, 3), (0, ... | 4 | MATH |
[
{
"content": "In a 6x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 5), provided you can move right or up 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, 2), (0, ... | 3 | MATH |
[
{
"content": "In a 5x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 8), provided you can move right or up 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, 1), (3, ... | 2 | MATH |
[
{
"content": "In a 6x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 5), provided you can move right or up 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, 3), (0, ... | 3 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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), (2, ... | 7 | MATH |
[
{
"content": "In a 6x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (5, 5), provided you can move right or up 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), (4, ... | 4 | MATH |
[
{
"content": "In a 7x9 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (6, 8), provided you can move right or up 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, 0), (6, ... | 2 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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, 5), (6, ... | 4 | MATH |
[
{
"content": "In a 5x5 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (4, 4), provided you can move right or up 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, 2), (2, ... | 2 | MATH |
[
{
"content": "In a 9x6 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 5), provided you can move right or up 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, ... | 2 | MATH |
[
{
"content": "In a 9x7 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (8, 6), provided you can move right or up 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, 5), (3, ... | 2 | MATH |
[
{
"content": "In a 8x8 grid, what is the fewest number of steps it takes to get from the bottom left (0, 0) to the top right (7, 7), provided you can move right or up 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), (2, ... | 3 | MATH |
End of preview. Expand
in Data Studio
No dataset card yet
- Downloads last month
- 6