messages listlengths 1 1 | ground_truth stringlengths 1 9 | dataset stringclasses 1 value |
|---|---|---|
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of an 8x8 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main dia... | 3 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 10x10 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 4 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 12x12 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 5 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 14x14 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 6 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 16x16 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 7 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of an 18x18 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main d... | 8 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 20x20 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 9 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 22x22 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 10 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 24x24 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 11 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 26x26 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 12 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 28x28 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 13 | MATH |
[
{
"content": "Suppose you have an agent in the bottom left (i=0, j=0) cell of a 30x30 grid, whose objective is to make it to the top right cell. Its valid moves from any cell are to move one cell to the right, or to move one cell upward, and it is further constrained by having to stay strictly below the main di... | 14 | MATH |
[
{
"content": "In a 10x10 grid, how many different paths are there from the bottom left (0, 0) to the top right (9, 9), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (2, 0), (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8)... | 10 | MATH |
[
{
"content": "In a 20x20 grid, how many different paths are there from the bottom left (0, 0) to the top right (19, 19), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (2, 0), (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, ... | 20 | MATH |
[
{
"content": "In a 10x10 grid, how many different paths are there from the bottom left (0, 0) to the top right (9, 9), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), (7, 7), (8, 8)?\n\nPre... | 2860 | MATH |
[
{
"content": "In a 20x20 grid, how many different paths are there from the bottom left (0, 0) to the top right (19, 19), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), (7, 7), (8, 8), (9, ... | 955277400 | MATH |
No dataset card yet
- Downloads last month
- 6