task_name stringclasses 3
values | question stringlengths 430 2.4k | ground_truth stringlengths 1 6 |
|---|---|---|
maze | Navigate from '3' (start) to 'z' (goal):
```
>>>>>>>>>>>>>>>>>>
>eeeeeeeee>e>>eee>
>e>ee>e>>eeeeeeee>
>>ee>e>>eeee>e>ee>
>ee>>ee>>eeeee>>e>
>>e>>e>>e>zee>e>>>
>e>eeeee>ee>e>>ee>
>>e>e>eee>eeeeeee>
>e>e>eeeeee>eee>>>
>eeeeeeeee>eee>e>>
>eeeee>e>eeeeeee>>
>e>e>eeee>>eee>>e>
>eeeeeeeeee>>ee>>>
>ee>eee>>eee>eeee>
>e>eeeee... | 20 |
maze | Navigate from '`' (start) to 'i' (goal):
```
44444444444444444
4AAAAAAAAAAA4AA44
44A44AAAAA4A4AA44
4AA4A44AAA4AA4444
4AA444AAA4A4AAAA4
444A4AAA4AAA44A44
4A44A4AA4A4AAA4A4
4AAA4A4AAAAAAAAA4
4A4AAAAA44AA4AAA4
4AA4444AAAA444AA4
4A4AA44AA4A4`AAA4
4444AAAAA4AA4AA44
44A4AAAAAAA4A4AA4
4iAAAA4AAAA4AAAA4
4AAA4AAAA4A4AAAA4
4AAA... | 24 |
maze | Navigate from '(' (start) to '`' (goal):
```
QQQQQQQQQQQQQQQQQQ
Q%%%Q%Q%%%%%Q%%%%Q
QQ%QQ%Q%%%%%%%%QQQ
QQQ%%%Q%%%%%QQ%(%Q
QQ%%%QQ%%%Q%%%%Q%Q
Q%QQ%%%%%QQQQ%%Q%Q
Q%`Q%%%QQQ%QQ%QQ%Q
QQ%%%%Q%QQ%Q%%Q%QQ
Q%QQQQ%%QQ%%%%%%%Q
QQ%%%Q%%Q%%Q%%%Q%Q
Q%%%%%%%%%%Q%%%%QQ
Q%Q%%%Q%Q%%%%%QQQQ
QQ%%QQ%QQ%Q%QQ%Q%Q
Q%%%%Q%Q%QQQ%Q%%QQ
QQ%%%QQ%... | 20 |
maze | Navigate from '!' (start) to 'w' (goal):
```
yyyyyyyyyyyyyyyyy
yRyyyRRyRR!yRRRRy
yRyyyRRRRyRRRyRyy
yRRRyRRyRyRRRRyRy
yyyRRRRRyyRRRRRRy
yyRRyyRRRRyyRRRRy
yyRRyRRRyRyyyRRRy
yRRRRRRyRyRyRyyRy
yRyRyRyRRRyRyRyyy
yyRyRRRRyRyRRRyRy
yRRRyyRyyRRyRRRRy
yRRyRRRRRyRyyyRRy
yRyyRRyRRRRyyRRRy
yRRyRRwRyyRRyRRRy
yyyRRRRyyyRRRRyRy
yRyR... | 20 |
maze | Navigate from '5' (start) to '.' (goal):
```
999999999999999999
9P99P99PPPPPPPPPP9
999PP9PP.PP9P9PPP9
9PPP9PP9PP9PPPPPP9
99PPPP99P9PP9P9PP9
9PPP9PP99P99P9P999
9PPPPP99P9P99P9PP9
9PP9P99999P99PPPP9
99P9P9999PPPPPPP99
9PP9PPPP9999PPPP99
9P9PPPPP9PPP99PPP9
9PPP9PPPP99PP9PPP9
9PPP999P9P999999P9
99PP9P9PPP99P999P9
9PPPPP99... | 24 |
maze | Navigate from 'T' (start) to ')' (goal):
```
JJJJJJJJJJJJJJJJJJJJ
JJJ88888J88J888J888J
J888888888J8J88888JJ
J8888888J888J88888JJ
J88J8JJ88888J8J88J8J
JJ88J8JJ8J8J888JJ88J
JJJJ88888JJ8888J88JJ
J88J8JJ8J8JJJJJ88)8J
J88J888JJJJ88888J88J
J8JJ8JJ8J8888J88888J
JJ888J888J8888J8888J
JJ888J88888J8J88888J
J88J888J8J8J888J8J8J
J... | 27 |
maze | Navigate from 'g' (start) to '*' (goal):
```
)))))))))))))))))))
)E)E)EE)EEE)EEEEEE)
)E)EE)EEEEE))EEEE))
))*EEEEE)E)EE)EEEE)
)E))EEEEEE)EEEEE)E)
))EEE)E))EEEEE)EE))
)E)E)E))EE)E)E))EE)
)EEE))EEE)E)EEEEEE)
)EEEEEEEE)EE)EE)EE)
))EEEEEEE)EEEEEEEE)
))EE))E)EE)E)EEEE))
)EEEEEEE))EEEEEEE))
)EEEEEEEE)EE))EEEE)
))E)EEE)EE)EE)... | 22 |
maze | Navigate from 'Q' (start) to 'e' (goal):
```
88888888888888
8IIIIIIIIIIII8
88III8I888III8
8III8I8II8I8I8
88II8I8II8III8
8IIIII8I88III8
8IIeI8888I8II8
88I8II8II8III8
88I8I8III8IIQ8
8II8I8III888I8
8II88III8IIII8
888I8I8II88II8
8II8I88IIIII88
88888888888888
```
Legend: '8' = Wall, 'I' = Passage
What is the minimum numbe... | 21 |
maze | Navigate from 'K' (start) to '>' (goal):
```
""""""""""""""""""""
"y"yyy"yy""yy"yyy"y"
""y""yy"y"yyyyy"y"K"
"yyyyyyyy"y""yyyyyy"
"yy"yy"yy""y""yy"y""
"yyy""""yyy"yyy"yyy"
""y"yy"yyyy"yyy"y"y"
"yy"yyy"yyyyyyyy""""
"""y"yyyyy"""yyyy"y"
"yyyyy"yyy"yyyy"y"""
""yyyyy"y"yyyyyyyyy"
"yyy"yy>"yyyy"yy""y"
""yyy""yy"yy"yy"yy""
"... | 24 |
maze | Navigate from ')' (start) to 'k' (goal):
```
vvvvvvvvvvvvvv
v##v#vv##k#vvv
v#v#vvvv#v###v
v#vv##v#####vv
vvvv#)#v#####v
v##v###v#####v
v###v###vv#v#v
v##v###v#v###v
vv#v#v#v#####v
v##v##vv#v###v
vv###v###v##vv
v##vvv#####v#v
v######v####vv
vvvvvvvvvvvvvv
```
Legend: 'v' = Wall, '#' = Passage
What is the minimum numbe... | 31 |
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 6 houses (numbered 1 on the left, 6 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, arnold, alice, emily, carol, david
- Everyone has a... | emily |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: david, emily, bob, carol, alice, arnold
- The people are... | david |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: david, arnold, alice, emily, bob, carol
- Each person ha... | emily |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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, david, carol, emily, arnold, alice
- Each person ha... | carol |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: emily, carol, alice, arnold, david, bob
- The people are... | bob |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: david, bob, arnold, carol, alice, emily
- Everyone has a... | arnold |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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, emily, bob, carol, arnold, david
- Each mother is... | carol |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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, carol, david, bob, emily, alice
- Each person ha... | alice |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: david, bob, arnold, emily, alice, carol
- The people are... | arnold |
zebra_puzzles | This is a logic puzzle. There are 6 houses (numbered 1 on the left, 6 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: david, bob, alice, arnold, carol, emily
- Each person ha... | david |
README.md exists but content is empty.
- Downloads last month
- 27