task_name stringclasses 3
values | question stringlengths 262 1.98k | ground_truth stringlengths 1 6 |
|---|---|---|
maze | Navigate from '3' (start) to 'z' (goal):
```
>>>>>>>>>
>eeee>e>>
>ee>>>>>>
>eeeeee>>
>e>ee>>e>
>>ez>3e>>
>eee>e>e>
>eeeee>e>
>>>>>>>>>
```
Legend: '>' = Wall, 'e' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 6 |
maze | Navigate from '`' (start) to 'i' (goal):
```
4444444
4AAAAi4
4A4A4A4
4A4AA44
44AAAA4
44A`444
4444444
```
Legend: '4' = Wall, 'A' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 6 |
maze | Navigate from '(' (start) to '`' (goal):
```
QQQQQQQ
QQ%%%%Q
QQ`%Q%Q
Q%%Q%%Q
Q%%%Q%Q
Q%QQ%(Q
QQQQQQQ
```
Legend: 'Q' = Wall, '%' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 8 |
maze | Navigate from '!' (start) to 'w' (goal):
```
yyyyyyyyy
yyRRRRyyy
yRRyyRyyy
yRRRRRRRy
yR!yyRRyy
yyRyyRRRy
yyyyRRRyy
yRRRwRRRy
yyyyyyyyy
```
Legend: 'y' = Wall, 'R' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 9 |
maze | Navigate from '5' (start) to '.' (goal):
```
999999999
999PP9PP9
9999PPP99
9P9PPP999
9PPPP9P59
9PPPPPPP9
9PPP.9P99
9P9PPPP99
999999999
```
Legend: '9' = Wall, 'P' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 5 |
maze | Navigate from 'T' (start) to ')' (goal):
```
JJJJJJJJ
J8888J8J
JJ8JJJ8J
JJ88888J
J88J8)8J
J8JJJ88J
JT8J8J8J
JJJJJJJJ
```
Legend: 'J' = Wall, '8' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 8 |
maze | Navigate from 'g' (start) to '*' (goal):
```
)))))))))
))EEEg)E)
)EEEEEEE)
))*)EE)E)
)EEEEEE))
)E)EEEEE)
))EEE)E))
))EE))E))
)))))))))
```
Legend: ')' = Wall, 'E' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 5 |
maze | Navigate from 'Q' (start) to 'e' (goal):
```
8888888
88III88
8Q8II88
8IIIII8
8II8II8
88IeI88
8888888
```
Legend: '8' = Wall, 'I' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 5 |
maze | Navigate from 'K' (start) to '>' (goal):
```
""""""
"K"yy"
"yy"y"
"yyy>"
""""y"
""""""
```
Legend: '"' = Wall, 'y' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 5 |
maze | Navigate from ')' (start) to 'k' (goal):
```
vvvvvvvvv
vv#vvvvvv
v###vvvvv
v####)#vv
v#v##v##v
v##v#v##v
v###vk#vv
v###v##vv
vvvvvvvvv
```
Legend: 'v' = Wall, '#' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | 5 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 13 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 8 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 5 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 8 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 6 |
rotten_oranges | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 7 |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: alice, arnold, bob, carol
- Everyone has a different fav... | carol |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: bob, alice, arnold, carol
- The people are of nationalit... | bob |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: carol, alice, arnold, bob
- Each person has a favorite d... | carol |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: bob, alice, carol, arnold
- Each person has a favorite c... | arnold |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: arnold, bob, carol, alice
- The people are of nationalit... | bob |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: alice, carol, arnold, bob
- Everyone has a favorite smoo... | bob |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: carol, bob, arnold, alice
- Each mother is accompanied b... | arnold |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: arnold, alice, carol, bob
- Each person has a favorite c... | alice |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: alice, carol, bob, arnold
- The people are of nationalit... | bob |
zebra_puzzles | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: carol, bob, alice, arnold
- Each person has a favorite c... | carol |
README.md exists but content is empty.
- Downloads last month
- 36