doc_id int64 0 999 ⌀ | query stringlengths 213 1.05k | choices listlengths 4 4 | gold int64 0 3 | metadata dict |
|---|---|---|---|---|
200 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . E #
B . . . . S
C . . . . .
D # . . . .
E . . . # .
Start: B5 | Goal: A4 | Obstacles (impassable): A5, D1, E4
What is the shortest valid path from B5 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up",
"down, left",
"left, down",
"up, left"
] | 0 | {
"grid_size": 5,
"start": "B5",
"end": "A4",
"obstacles": [
"A5",
"D1",
"E4"
],
"shortest_path_length": 2,
"fingerprint": "50424ba27882"
} |
201 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . # .
C E # . S .
D . . . # .
E . . . . .
Start: C4 | Goal: C1 | Obstacles (impassable): B4, C2, D4
What is the shortest valid path from C4 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, down, up, right",
"left, up, left, left, down",
"left, left, left",
"left, right, up, right, up"
] | 1 | {
"grid_size": 5,
"start": "C4",
"end": "C1",
"obstacles": [
"B4",
"C2",
"D4"
],
"shortest_path_length": 5,
"fingerprint": "2c9f2cb6333a"
} |
202 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . S
B . E . . .
C # . . # .
D . . . # .
E . . . . .
Start: A5 | Goal: B2 | Obstacles (impassable): C1, C4, D4
What is the shortest valid path from A5 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, left, down",
"left, up, up, right",
"down, left, left, left",
"up, right, left, down"
] | 2 | {
"grid_size": 5,
"start": "A5",
"end": "B2",
"obstacles": [
"C1",
"C4",
"D4"
],
"shortest_path_length": 4,
"fingerprint": "0c3f9c1f081e"
} |
203 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . .
B # . . . .
C . . . . .
D # . . S .
E . . . . E
Start: D4 | Goal: E5 | Obstacles (impassable): A3, B1, D1
What is the shortest valid path from D4 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, down",
"right, right",
"down, right",
"right, up"
] | 2 | {
"grid_size": 5,
"start": "D4",
"end": "E5",
"obstacles": [
"A3",
"B1",
"D1"
],
"shortest_path_length": 2,
"fingerprint": "43812b38eacf"
} |
204 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . # . . .
C . . . . .
D . E . . .
E . # . . S
Start: E5 | Goal: D2 | Obstacles (impassable): A1, B2, E2
What is the shortest valid path from E5 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, left, left",
"left, down, up, up",
"up, down, down, left",
"left, down, up, right"
] | 0 | {
"grid_size": 5,
"start": "E5",
"end": "D2",
"obstacles": [
"A1",
"B2",
"E2"
],
"shortest_path_length": 4,
"fingerprint": "3264a0f404ae"
} |
205 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C # . . # .
D . E . . #
E . . . S .
Start: E4 | Goal: D2 | Obstacles (impassable): C1, C4, D5
What is the shortest valid path from E4 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up, down",
"up, left, left",
"left, down, down",
"down, left, right"
] | 1 | {
"grid_size": 5,
"start": "E4",
"end": "D2",
"obstacles": [
"C1",
"C4",
"D5"
],
"shortest_path_length": 3,
"fingerprint": "827fd5213c8d"
} |
206 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . S . . .
C . . . . .
D . # . # .
E . . . E .
Start: B2 | Goal: E4 | Obstacles (impassable): A1, D2, D4
What is the shortest valid path from B2 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, down, right, right",
"left, up, up, up, up",
"down, up, left, up, right",
"down, right, down, down, right"
] | 3 | {
"grid_size": 5,
"start": "B2",
"end": "E4",
"obstacles": [
"A1",
"D2",
"D4"
],
"shortest_path_length": 5,
"fingerprint": "a70b326838b3"
} |
207 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B . . . . .
C . . # S E
D . . # . .
E . . . . .
Start: C4 | Goal: C5 | Obstacles (impassable): A4, C3, D3
What is the shortest valid path from C4 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"right",
"left",
"down"
] | 1 | {
"grid_size": 5,
"start": "C4",
"end": "C5",
"obstacles": [
"A4",
"C3",
"D3"
],
"shortest_path_length": 1,
"fingerprint": "168f210f93eb"
} |
208 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . # .
C . . . . .
D . E . . #
E . S # . .
Start: E2 | Goal: D2 | Obstacles (impassable): B4, D5, E3
What is the shortest valid path from E2 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"down",
"left",
"up"
] | 3 | {
"grid_size": 5,
"start": "E2",
"end": "D2",
"obstacles": [
"B4",
"D5",
"E3"
],
"shortest_path_length": 1,
"fingerprint": "678410955a08"
} |
209 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . S . # .
C . . . . .
D . # . . E
E . . . . #
Start: B2 | Goal: D5 | Obstacles (impassable): B4, D2, E5
What is the shortest valid path from B2 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, down, right, left",
"down, left, right, left, down",
"down, right, down, right, right",
"down, down, right, right, right"
] | 2 | {
"grid_size": 5,
"start": "B2",
"end": "D5",
"obstacles": [
"B4",
"D2",
"E5"
],
"shortest_path_length": 5,
"fingerprint": "e93c4f55c1e5"
} |
210 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . E # .
B . . . . .
C . . . . .
D # . . # .
E . S . . .
Start: E2 | Goal: A3 | Obstacles (impassable): A4, D1, D4
What is the shortest valid path from E2 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, right",
"down, up, up, up, left",
"up, up, down, up, left",
"down, right, left, left, right"
] | 0 | {
"grid_size": 5,
"start": "E2",
"end": "A3",
"obstacles": [
"A4",
"D1",
"D4"
],
"shortest_path_length": 5,
"fingerprint": "205a1fbf2384"
} |
211 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . # .
B . . . . .
C . . . S .
D . . . . .
E . . . E #
Start: C4 | Goal: E4 | Obstacles (impassable): A2, A4, E5
What is the shortest valid path from C4 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, down",
"down, down",
"left, right",
"down, left"
] | 1 | {
"grid_size": 5,
"start": "C4",
"end": "E4",
"obstacles": [
"A2",
"A4",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "498b079329d1"
} |
212 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B # . . . .
C E S # . .
D . . . . .
E . . . . .
Start: C2 | Goal: C1 | Obstacles (impassable): A4, B1, C3
What is the shortest valid path from C2 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"left",
"down",
"right"
] | 1 | {
"grid_size": 5,
"start": "C2",
"end": "C1",
"obstacles": [
"A4",
"B1",
"C3"
],
"shortest_path_length": 1,
"fingerprint": "7fca25f77432"
} |
213 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . E .
B S . . . .
C . . . # .
D # . . # .
E . . . . .
Start: B1 | Goal: A4 | Obstacles (impassable): C4, D1, D4
What is the shortest valid path from B1 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right, up",
"up, down, right, right",
"right, down, right, left",
"up, right, right, right"
] | 3 | {
"grid_size": 5,
"start": "B1",
"end": "A4",
"obstacles": [
"C4",
"D1",
"D4"
],
"shortest_path_length": 4,
"fingerprint": "260a9ffacc5c"
} |
214 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A S . . . .
B . . . . .
C . . . . .
D . # . . .
E . # E . #
Start: A1 | Goal: E3 | Obstacles (impassable): D2, E2, E5
What is the shortest valid path from A1 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, up, right, down, right",
"down, down, right, right, down, down",
"down, down, down, down, right, right",
"left, right, down, up, up, down"
] | 1 | {
"grid_size": 5,
"start": "A1",
"end": "E3",
"obstacles": [
"D2",
"E2",
"E5"
],
"shortest_path_length": 6,
"fingerprint": "4f27c4f17aa6"
} |
215 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . S . .
B . . # . .
C # . . . .
D # . . . .
E . . . . E
Start: A3 | Goal: E5 | Obstacles (impassable): B3, C1, D1
What is the shortest valid path from A3 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, down, down, right",
"left, left, up, down, right, right",
"down, down, down, down, right, right",
"down, up, right, right, right, up"
] | 0 | {
"grid_size": 5,
"start": "A3",
"end": "E5",
"obstacles": [
"B3",
"C1",
"D1"
],
"shortest_path_length": 6,
"fingerprint": "71595f509289"
} |
216 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . S .
B . . . . .
C . . . . .
D E . . . .
E # . . # .
Start: A4 | Goal: D1 | Obstacles (impassable): A1, E1, E4
What is the shortest valid path from A4 to D1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right, up, up, up",
"left, down, right, left, left, up",
"down, right, left, right, left, right",
"down, down, down, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "A4",
"end": "D1",
"obstacles": [
"A1",
"E1",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "19103995aaaa"
} |
217 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A S . . . .
B . . . . #
C E # . . .
D . . . . .
E # . . . .
Start: A1 | Goal: C1 | Obstacles (impassable): B5, C2, E1
What is the shortest valid path from A1 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, down",
"left, up",
"down, down",
"right, down"
] | 2 | {
"grid_size": 5,
"start": "A1",
"end": "C1",
"obstacles": [
"B5",
"C2",
"E1"
],
"shortest_path_length": 2,
"fingerprint": "a52150b57b9b"
} |
218 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B . E . . .
C . . # . #
D . . . . S
E . . . . .
Start: D5 | Goal: B2 | Obstacles (impassable): A4, C3, C5
What is the shortest valid path from D5 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, left, left, left",
"up, right, right, down, right",
"down, left, up, right, up",
"left, up, up, left, left"
] | 3 | {
"grid_size": 5,
"start": "D5",
"end": "B2",
"obstacles": [
"A4",
"C3",
"C5"
],
"shortest_path_length": 5,
"fingerprint": "bed80e9f750f"
} |
219 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C . . . E .
D # # S # .
E . . . . .
Start: D3 | Goal: C4 | Obstacles (impassable): D1, D2, D4
What is the shortest valid path from D3 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up",
"up, right",
"down, down",
"right, left"
] | 1 | {
"grid_size": 5,
"start": "D3",
"end": "C4",
"obstacles": [
"D1",
"D2",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "6d9c896438fa"
} |
220 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . S #
C # . E . #
D . . . . .
E . . . . .
Start: B4 | Goal: C3 | Obstacles (impassable): B5, C1, C5
What is the shortest valid path from B4 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left",
"down, left",
"right, left",
"down, down"
] | 1 | {
"grid_size": 5,
"start": "B4",
"end": "C3",
"obstacles": [
"B5",
"C1",
"C5"
],
"shortest_path_length": 2,
"fingerprint": "32410f988203"
} |
221 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C # . . . .
D . S E . .
E # . # . .
Start: D2 | Goal: D3 | Obstacles (impassable): C1, E1, E3
What is the shortest valid path from D2 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"down",
"left",
"right"
] | 3 | {
"grid_size": 5,
"start": "D2",
"end": "D3",
"obstacles": [
"C1",
"E1",
"E3"
],
"shortest_path_length": 1,
"fingerprint": "9ce609345df9"
} |
222 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B # S . E #
C . . . . .
D . . . . .
E . . . . #
Start: B2 | Goal: B4 | Obstacles (impassable): B1, B5, E5
What is the shortest valid path from B2 to B4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up",
"right, right",
"left, down",
"up, left"
] | 1 | {
"grid_size": 5,
"start": "B2",
"end": "B4",
"obstacles": [
"B1",
"B5",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "8029610fab00"
} |
223 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . # . .
C . . . . .
D . . # . S
E . E . # .
Start: D5 | Goal: E2 | Obstacles (impassable): B3, D3, E4
What is the shortest valid path from D5 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, left, up, right, right",
"down, left, left, left",
"left, up, left, left, down, down",
"right, left, up, up, left, down"
] | 2 | {
"grid_size": 5,
"start": "D5",
"end": "E2",
"obstacles": [
"B3",
"D3",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "0fb955faf1a1"
} |
224 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . S . . #
C . . . . #
D . . . . .
E . . . # E
Start: B2 | Goal: E5 | Obstacles (impassable): B5, C5, E4
What is the shortest valid path from B2 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, left, left, down, down",
"down, down, down, right, right, right",
"down, down, right, right, right, down",
"down, up, down, down, up, right"
] | 2 | {
"grid_size": 5,
"start": "B2",
"end": "E5",
"obstacles": [
"B5",
"C5",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "8f3789ebfaa2"
} |
225 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . #
B . . . . .
C # . . . S
D . . . . .
E . . E . .
Start: C5 | Goal: E3 | Obstacles (impassable): A2, A5, C1
What is the shortest valid path from C5 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, down, down",
"up, down, right, right",
"up, left, right, left",
"down, down, left, left"
] | 3 | {
"grid_size": 5,
"start": "C5",
"end": "E3",
"obstacles": [
"A2",
"A5",
"C1"
],
"shortest_path_length": 4,
"fingerprint": "8c05f0c21a8e"
} |
226 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . S . . #
C # # . . .
D . . . . .
E . E . . .
Start: B2 | Goal: E2 | Obstacles (impassable): B5, C1, C2
What is the shortest valid path from B2 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, right, up, up, left",
"down, down, down",
"right, down, down, down, left",
"right, down, down, up, left"
] | 2 | {
"grid_size": 5,
"start": "B2",
"end": "E2",
"obstacles": [
"B5",
"C1",
"C2"
],
"shortest_path_length": 5,
"fingerprint": "2e4059aff805"
} |
227 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . . . S #
C . . . . .
D . . E . .
E . . . # .
Start: B4 | Goal: D3 | Obstacles (impassable): A1, B5, E4
What is the shortest valid path from B4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, up",
"down, down, left",
"up, left, down",
"left, right, right"
] | 1 | {
"grid_size": 5,
"start": "B4",
"end": "D3",
"obstacles": [
"A1",
"B5",
"E4"
],
"shortest_path_length": 3,
"fingerprint": "b7615d36226d"
} |
228 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . E . .
B . # . . .
C . . . . .
D . . . . .
E S # . . #
Start: E1 | Goal: A3 | Obstacles (impassable): B2, E2, E5
What is the shortest valid path from E1 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, right, right",
"up, up, down, left, up, down",
"down, right, up, down, right, up",
"down, up, right, left, up, up"
] | 0 | {
"grid_size": 5,
"start": "E1",
"end": "A3",
"obstacles": [
"B2",
"E2",
"E5"
],
"shortest_path_length": 6,
"fingerprint": "bfff7353c99a"
} |
229 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C # . # # S
D . . . . .
E E . . . .
Start: C5 | Goal: E1 | Obstacles (impassable): C1, C3, C4
What is the shortest valid path from C5 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, right, right, up, right",
"down, down, left, left, left, left",
"up, left, up, left, left, up",
"up, right, up, up, up, up"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "E1",
"obstacles": [
"C1",
"C3",
"C4"
],
"shortest_path_length": 6,
"fingerprint": "673ec74a7966"
} |
230 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . S
B . . . . #
C . . # . .
D . . # . .
E . . . E .
Start: A5 | Goal: E4 | Obstacles (impassable): B5, C3, D3
What is the shortest valid path from A5 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right, up",
"down, down, down, down, left",
"left, down, down, down, down",
"down, left, left, up, down"
] | 2 | {
"grid_size": 5,
"start": "A5",
"end": "E4",
"obstacles": [
"B5",
"C3",
"D3"
],
"shortest_path_length": 5,
"fingerprint": "c155c3c3cd37"
} |
231 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . #
B . S . . .
C . . . E .
D . # . . .
E # . . . .
Start: B2 | Goal: C4 | Obstacles (impassable): A5, D2, E1
What is the shortest valid path from B2 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, up",
"down, up, right",
"down, down, down",
"down, right, right"
] | 3 | {
"grid_size": 5,
"start": "B2",
"end": "C4",
"obstacles": [
"A5",
"D2",
"E1"
],
"shortest_path_length": 3,
"fingerprint": "8a4194094a5f"
} |
232 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . E .
B . # . S .
C . . . . .
D . . . # .
E . . . # .
Start: B4 | Goal: A4 | Obstacles (impassable): B2, D4, E4
What is the shortest valid path from B4 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"down",
"up",
"right"
] | 2 | {
"grid_size": 5,
"start": "B4",
"end": "A4",
"obstacles": [
"B2",
"D4",
"E4"
],
"shortest_path_length": 1,
"fingerprint": "e8accf2c7657"
} |
233 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . E . .
B . # . . .
C # . . . .
D # . . . S
E . . . . .
Start: D5 | Goal: A3 | Obstacles (impassable): B2, C1, D1
What is the shortest valid path from D5 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, left, left",
"down, down, right, left, left",
"left, right, down, up, left",
"right, left, left, down, left"
] | 0 | {
"grid_size": 5,
"start": "D5",
"end": "A3",
"obstacles": [
"B2",
"C1",
"D1"
],
"shortest_path_length": 5,
"fingerprint": "437dbe9e7f4b"
} |
234 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . #
C . # . . E
D S . . . .
E . . . . #
Start: D1 | Goal: C5 | Obstacles (impassable): B5, C2, E5
What is the shortest valid path from D1 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right, right, right",
"down, down, left, up, up",
"right, up, down, up, left",
"right, right, up, right, right"
] | 3 | {
"grid_size": 5,
"start": "D1",
"end": "C5",
"obstacles": [
"B5",
"C2",
"E5"
],
"shortest_path_length": 5,
"fingerprint": "1b236b7f9711"
} |
235 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . .
B . # . . .
C . . E . .
D . . . S .
E . . . . #
Start: D4 | Goal: C3 | Obstacles (impassable): A2, B2, E5
What is the shortest valid path from D4 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down",
"left, right",
"up, left",
"down, left"
] | 2 | {
"grid_size": 5,
"start": "D4",
"end": "C3",
"obstacles": [
"A2",
"B2",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "77db6fffa6c7"
} |
236 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . E . .
B . . . . .
C . # # . .
D . S . . .
E . . . . .
Start: D2 | Goal: A3 | Obstacles (impassable): A1, C2, C3
What is the shortest valid path from D2 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, down, right, down, down",
"down, right, left, up, down, right",
"right, right, up, up, up, left",
"up, up, up, right"
] | 2 | {
"grid_size": 5,
"start": "D2",
"end": "A3",
"obstacles": [
"A1",
"C2",
"C3"
],
"shortest_path_length": 6,
"fingerprint": "3bd85c87c4ad"
} |
237 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . .
B . # E . .
C . S . . .
D . . . . .
E . # . . .
Start: C2 | Goal: B3 | Obstacles (impassable): A2, B2, E2
What is the shortest valid path from C2 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right",
"up, right",
"right, right",
"right, up"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "B3",
"obstacles": [
"A2",
"B2",
"E2"
],
"shortest_path_length": 2,
"fingerprint": "68e708d4e0ba"
} |
238 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . S .
B . . . # .
C . . . . .
D . # . . .
E # . E . .
Start: A4 | Goal: E3 | Obstacles (impassable): B4, D2, E1
What is the shortest valid path from A4 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, down, down, down",
"up, left, right, down, right",
"down, down, down, down, left",
"left, down, right, right, left"
] | 0 | {
"grid_size": 5,
"start": "A4",
"end": "E3",
"obstacles": [
"B4",
"D2",
"E1"
],
"shortest_path_length": 5,
"fingerprint": "22911d2ddaaf"
} |
239 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . #
B . . . . .
C . . . . .
D S # . . E
E . . . . .
Start: D1 | Goal: D5 | Obstacles (impassable): A1, A5, D2
What is the shortest valid path from D1 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, up, left, down",
"up, right, right, down, right, right",
"right, right, right, right",
"down, down, down, left, up, down"
] | 1 | {
"grid_size": 5,
"start": "D1",
"end": "D5",
"obstacles": [
"A1",
"A5",
"D2"
],
"shortest_path_length": 6,
"fingerprint": "b4ab7ac77deb"
} |
240 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B # # . . .
C . . . . .
D S . . # .
E . E . . .
Start: D1 | Goal: E2 | Obstacles (impassable): B1, B2, D4
What is the shortest valid path from D1 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down",
"down, right",
"down, up",
"right, up"
] | 1 | {
"grid_size": 5,
"start": "D1",
"end": "E2",
"obstacles": [
"B1",
"B2",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "dd26dd7ecb14"
} |
241 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . E
B # . . # .
C . . . . .
D . . . S .
E . . . . .
Start: D4 | Goal: A5 | Obstacles (impassable): A2, B1, B4
What is the shortest valid path from D4 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right",
"down, right, up, left",
"up, right, up, up",
"up, down, right, right"
] | 2 | {
"grid_size": 5,
"start": "D4",
"end": "A5",
"obstacles": [
"A2",
"B1",
"B4"
],
"shortest_path_length": 4,
"fingerprint": "f036046e4625"
} |
242 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . #
B . . . . .
C . . . S .
D . . . # E
E . . . . #
Start: C4 | Goal: D5 | Obstacles (impassable): A5, D4, E5
What is the shortest valid path from C4 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down",
"down, left",
"right, up",
"down, right"
] | 0 | {
"grid_size": 5,
"start": "C4",
"end": "D5",
"obstacles": [
"A5",
"D4",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "89f31b159e55"
} |
243 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . E S
B . # . . .
C . . . . .
D . # . . .
E . . . . .
Start: A5 | Goal: A4 | Obstacles (impassable): A1, B2, D2
What is the shortest valid path from A5 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down",
"left",
"up",
"right"
] | 1 | {
"grid_size": 5,
"start": "A5",
"end": "A4",
"obstacles": [
"A1",
"B2",
"D2"
],
"shortest_path_length": 1,
"fingerprint": "d7bf284d85b5"
} |
244 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # # .
B . . . . .
C . . . . .
D . E S . .
E . . . . #
Start: D3 | Goal: D2 | Obstacles (impassable): A3, A4, E5
What is the shortest valid path from D3 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"right",
"down",
"up"
] | 0 | {
"grid_size": 5,
"start": "D3",
"end": "D2",
"obstacles": [
"A3",
"A4",
"E5"
],
"shortest_path_length": 1,
"fingerprint": "b7b98090f848"
} |
245 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . E . . .
B . . . . .
C . S . # .
D . # . . .
E . . # . .
Start: C2 | Goal: A2 | Obstacles (impassable): C4, D2, E3
What is the shortest valid path from C2 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up",
"right, left",
"up, right",
"down, right"
] | 0 | {
"grid_size": 5,
"start": "C2",
"end": "A2",
"obstacles": [
"C4",
"D2",
"E3"
],
"shortest_path_length": 2,
"fingerprint": "26626178be4b"
} |
246 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . .
B . . E . #
C . . . . .
D . . . . #
E . . . . S
Start: E5 | Goal: B3 | Obstacles (impassable): A3, B5, D5
What is the shortest valid path from E5 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left, down, up, up",
"left, up, up, up, left",
"up, up, up, left, left",
"up, up, right, down, left"
] | 1 | {
"grid_size": 5,
"start": "E5",
"end": "B3",
"obstacles": [
"A3",
"B5",
"D5"
],
"shortest_path_length": 5,
"fingerprint": "7966712cf756"
} |
247 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . S
B . . . # .
C . . . E .
D . . . # .
E # . . . .
Start: A5 | Goal: C4 | Obstacles (impassable): B4, D4, E1
What is the shortest valid path from A5 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, left",
"left, right, left",
"right, right, down",
"left, right, down"
] | 0 | {
"grid_size": 5,
"start": "A5",
"end": "C4",
"obstacles": [
"B4",
"D4",
"E1"
],
"shortest_path_length": 3,
"fingerprint": "04866f668231"
} |
248 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . S E
C . # . . .
D . . . # .
E . . . . #
Start: B4 | Goal: B5 | Obstacles (impassable): C2, D4, E5
What is the shortest valid path from B4 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"down",
"left",
"right"
] | 3 | {
"grid_size": 5,
"start": "B4",
"end": "B5",
"obstacles": [
"C2",
"D4",
"E5"
],
"shortest_path_length": 1,
"fingerprint": "6c32baf0a203"
} |
249 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A E . # . #
B . . . . .
C . . . . .
D # . . . .
E S . . . .
Start: E1 | Goal: A1 | Obstacles (impassable): A3, A5, D1
What is the shortest valid path from E1 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up, up, up, up, left",
"up, up, right, right, left, up",
"right, up, up, left, down, left",
"up, up, up, up"
] | 0 | {
"grid_size": 5,
"start": "E1",
"end": "A1",
"obstacles": [
"A3",
"A5",
"D1"
],
"shortest_path_length": 6,
"fingerprint": "a1a2abde3cad"
} |
250 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A E . . . .
B . # . . .
C . . . . S
D . # . . .
E . # . . .
Start: C5 | Goal: A1 | Obstacles (impassable): B2, D2, E2
What is the shortest valid path from C5 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, up, down, up, left",
"left, down, up, down, down, up",
"right, left, right, right, down, up",
"up, up, left, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "C5",
"end": "A1",
"obstacles": [
"B2",
"D2",
"E2"
],
"shortest_path_length": 6,
"fingerprint": "5a78c039999b"
} |
251 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . # .
C . # . . .
D . . E # .
E . . . S .
Start: E4 | Goal: D3 | Obstacles (impassable): B4, C2, D4
What is the shortest valid path from E4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down",
"right, right",
"up, left",
"left, up"
] | 3 | {
"grid_size": 5,
"start": "E4",
"end": "D3",
"obstacles": [
"B4",
"C2",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "d07e6bee88e9"
} |
252 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # # .
B . . . . .
C . . . S .
D . E # . .
E . . . . .
Start: C4 | Goal: D2 | Obstacles (impassable): A3, A4, D3
What is the shortest valid path from C4 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, down",
"down, left, left",
"left, left, up",
"left, left, right"
] | 0 | {
"grid_size": 5,
"start": "C4",
"end": "D2",
"obstacles": [
"A3",
"A4",
"D3"
],
"shortest_path_length": 3,
"fingerprint": "14b2fff39dd1"
} |
253 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . E . .
C # . . . #
D . . . . .
E . # . . S
Start: E5 | Goal: B3 | Obstacles (impassable): C1, C5, E2
What is the shortest valid path from E5 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up, right, up, left",
"up, left, up, up, left",
"up, up, up, left, left",
"up, right, down, down, left"
] | 1 | {
"grid_size": 5,
"start": "E5",
"end": "B3",
"obstacles": [
"C1",
"C5",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "61ace4c3baff"
} |
254 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . .
B . . # E #
C . . . . .
D . . . . .
E . . S . .
Start: E3 | Goal: B4 | Obstacles (impassable): A3, B3, B5
What is the shortest valid path from E3 to B4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right",
"right, left, left, down",
"up, up, right, up",
"right, left, up, down"
] | 2 | {
"grid_size": 5,
"start": "E3",
"end": "B4",
"obstacles": [
"A3",
"B3",
"B5"
],
"shortest_path_length": 4,
"fingerprint": "c0ef45c6af1a"
} |
255 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . # # # .
C . . . . .
D S . . . .
E . . . E .
Start: D1 | Goal: E4 | Obstacles (impassable): B2, B3, B4
What is the shortest valid path from D1 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, right, right, right",
"left, down, up, up",
"down, down, down, down",
"up, right, up, up"
] | 0 | {
"grid_size": 5,
"start": "D1",
"end": "E4",
"obstacles": [
"B2",
"B3",
"B4"
],
"shortest_path_length": 4,
"fingerprint": "821bceefac90"
} |
256 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B # . . # .
C . . . . .
D S . . E .
E . . . . #
Start: D1 | Goal: D4 | Obstacles (impassable): B1, B4, E5
What is the shortest valid path from D1 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, down",
"right, right, right",
"down, up, right",
"right, up, left"
] | 1 | {
"grid_size": 5,
"start": "D1",
"end": "D4",
"obstacles": [
"B1",
"B4",
"E5"
],
"shortest_path_length": 3,
"fingerprint": "28d495be9391"
} |
257 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . E .
B . . . . .
C # . . . S
D . # . . .
E . . # . .
Start: C5 | Goal: A4 | Obstacles (impassable): C1, D2, E3
What is the shortest valid path from C5 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, down",
"up, up, down",
"up, up, left",
"right, up, left"
] | 2 | {
"grid_size": 5,
"start": "C5",
"end": "A4",
"obstacles": [
"C1",
"D2",
"E3"
],
"shortest_path_length": 3,
"fingerprint": "e9c66df5891e"
} |
258 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B # . . . .
C # # . . .
D S . . . E
E . . . . .
Start: D1 | Goal: D5 | Obstacles (impassable): B1, C1, C2
What is the shortest valid path from D1 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, down",
"right, right, down, right",
"left, left, right, left",
"right, right, right, right"
] | 3 | {
"grid_size": 5,
"start": "D1",
"end": "D5",
"obstacles": [
"B1",
"C1",
"C2"
],
"shortest_path_length": 4,
"fingerprint": "46b296fb5e3d"
} |
259 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . # S . .
C . . # # .
D . . E . .
E . . . . .
Start: B3 | Goal: D3 | Obstacles (impassable): B2, C3, C4
What is the shortest valid path from B3 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, right, up, down, right",
"right, down, left, right, left, left",
"down, down",
"right, right, down, down, left, left"
] | 3 | {
"grid_size": 5,
"start": "B3",
"end": "D3",
"obstacles": [
"B2",
"C3",
"C4"
],
"shortest_path_length": 6,
"fingerprint": "0baf355e235a"
} |
260 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . .
B E # . # .
C . . . . .
D . . . . .
E . . S . .
Start: E3 | Goal: B1 | Obstacles (impassable): A2, B2, B4
What is the shortest valid path from E3 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up, right, left, left",
"up, up, up, left, left",
"up, up, left, left, up",
"left, left, left, left, up"
] | 2 | {
"grid_size": 5,
"start": "E3",
"end": "B1",
"obstacles": [
"A2",
"B2",
"B4"
],
"shortest_path_length": 5,
"fingerprint": "cf502306c2ca"
} |
261 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . # . . .
C . . . . .
D . . . # E
E # S . . .
Start: E2 | Goal: D5 | Obstacles (impassable): B2, D4, E1
What is the shortest valid path from E2 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, up, right",
"right, right, right, up",
"up, right, right, right",
"down, left, left, left"
] | 1 | {
"grid_size": 5,
"start": "E2",
"end": "D5",
"obstacles": [
"B2",
"D4",
"E1"
],
"shortest_path_length": 4,
"fingerprint": "257b249d5886"
} |
262 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B S . . . .
C # . . # .
D . . . . #
E E . . . .
Start: B1 | Goal: E1 | Obstacles (impassable): C1, C4, D5
What is the shortest valid path from B1 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, down, left",
"right, up, up, down, left",
"down, down, down",
"down, left, left, left, left"
] | 0 | {
"grid_size": 5,
"start": "B1",
"end": "E1",
"obstacles": [
"C1",
"C4",
"D5"
],
"shortest_path_length": 5,
"fingerprint": "58998468fa1a"
} |
263 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C . E . . .
D . # . # .
E . . . # S
Start: E5 | Goal: C2 | Obstacles (impassable): D2, D4, E4
What is the shortest valid path from E5 to C2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, down, down, up",
"up, up, left, left, left",
"down, down, left, up, down",
"down, right, up, up, up"
] | 1 | {
"grid_size": 5,
"start": "E5",
"end": "C2",
"obstacles": [
"D2",
"D4",
"E4"
],
"shortest_path_length": 5,
"fingerprint": "a420b14433de"
} |
264 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A S . # . .
B . . . . .
C . . # . .
D . # . . .
E . . . . E
Start: A1 | Goal: E5 | Obstacles (impassable): A3, C3, D2
What is the shortest valid path from A1 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, down, down, right, right, right, right",
"up, left, down, up, right, left, down, down",
"left, right, down, down, down, up, up, left",
"left, right, right, left, right, down, down, right"
] | 0 | {
"grid_size": 5,
"start": "A1",
"end": "E5",
"obstacles": [
"A3",
"C3",
"D2"
],
"shortest_path_length": 8,
"fingerprint": "31bdd4013502"
} |
265 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . .
B . . # . .
C . S . . .
D E . # . .
E . . . . .
Start: C2 | Goal: D1 | Obstacles (impassable): A3, B3, D3
What is the shortest valid path from C2 to D1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left",
"left, up",
"left, right",
"down, left"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "D1",
"obstacles": [
"A3",
"B3",
"D3"
],
"shortest_path_length": 2,
"fingerprint": "31d7eab14e0a"
} |
266 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . . . . E
C . S . . .
D # . # . .
E . . . . .
Start: C2 | Goal: B5 | Obstacles (impassable): A1, D1, D3
What is the shortest valid path from C2 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, left, up",
"right, left, down, up",
"up, right, right, right",
"left, down, right, right"
] | 2 | {
"grid_size": 5,
"start": "C2",
"end": "B5",
"obstacles": [
"A1",
"D1",
"D3"
],
"shortest_path_length": 4,
"fingerprint": "058c00cf4b91"
} |
267 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . # . .
C . . # . .
D . . . . .
E # . S E .
Start: E3 | Goal: E4 | Obstacles (impassable): B3, C3, E1
What is the shortest valid path from E3 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"down",
"left",
"up"
] | 0 | {
"grid_size": 5,
"start": "E3",
"end": "E4",
"obstacles": [
"B3",
"C3",
"E1"
],
"shortest_path_length": 1,
"fingerprint": "f53921152640"
} |
268 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . #
B # E . . .
C . . . S .
D . . . . .
E . . . . .
Start: C4 | Goal: B2 | Obstacles (impassable): A3, A5, B1
What is the shortest valid path from C4 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, up",
"right, left, right",
"up, left, left",
"left, up, right"
] | 2 | {
"grid_size": 5,
"start": "C4",
"end": "B2",
"obstacles": [
"A3",
"A5",
"B1"
],
"shortest_path_length": 3,
"fingerprint": "d02d4067c203"
} |
269 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . E #
B S . . # #
C . . . . .
D . . . . .
E . . . . .
Start: B1 | Goal: A4 | Obstacles (impassable): A5, B4, B5
What is the shortest valid path from B1 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, left, right",
"up, right, right, right",
"right, up, down, up",
"down, up, right, down"
] | 1 | {
"grid_size": 5,
"start": "B1",
"end": "A4",
"obstacles": [
"A5",
"B4",
"B5"
],
"shortest_path_length": 4,
"fingerprint": "b18c26f5cece"
} |
270 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # E . #
B . . . . .
C S . . . .
D . . . . .
E . . . . #
Start: C1 | Goal: A3 | Obstacles (impassable): A2, A5, E5
What is the shortest valid path from C1 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, right, right",
"left, right, up, right",
"down, down, left, right",
"up, right, right, up"
] | 3 | {
"grid_size": 5,
"start": "C1",
"end": "A3",
"obstacles": [
"A2",
"A5",
"E5"
],
"shortest_path_length": 4,
"fingerprint": "78115960c834"
} |
271 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . # . .
C . . S . #
D . . . . .
E . . . # E
Start: C3 | Goal: E5 | Obstacles (impassable): B3, C5, E4
What is the shortest valid path from C3 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, right, right",
"down, right, right, left",
"down, right, right, down",
"up, down, right, up"
] | 2 | {
"grid_size": 5,
"start": "C3",
"end": "E5",
"obstacles": [
"B3",
"C5",
"E4"
],
"shortest_path_length": 4,
"fingerprint": "c8fff2e71278"
} |
272 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B . . . # .
C . . . . .
D . # E . .
E . . . S .
Start: E4 | Goal: D3 | Obstacles (impassable): A4, B4, D2
What is the shortest valid path from E4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left",
"right, left",
"up, down",
"up, left"
] | 3 | {
"grid_size": 5,
"start": "E4",
"end": "D3",
"obstacles": [
"A4",
"B4",
"D2"
],
"shortest_path_length": 2,
"fingerprint": "fca3cf158d6e"
} |
273 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A E . . . .
B # . . # .
C S . . . .
D . . . # .
E . . . . .
Start: C1 | Goal: A1 | Obstacles (impassable): B1, B4, D4
What is the shortest valid path from C1 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up",
"up, right, down, up",
"up, right, down, left",
"right, up, up, left"
] | 3 | {
"grid_size": 5,
"start": "C1",
"end": "A1",
"obstacles": [
"B1",
"B4",
"D4"
],
"shortest_path_length": 4,
"fingerprint": "0e01ef251798"
} |
274 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . E . .
B . . . . .
C # . . . .
D S . . . #
E . # . . .
Start: D1 | Goal: A3 | Obstacles (impassable): C1, D5, E2
What is the shortest valid path from D1 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right, right",
"right, up, up, up, right",
"up, up, left, down, up",
"down, right, down, left, left"
] | 1 | {
"grid_size": 5,
"start": "D1",
"end": "A3",
"obstacles": [
"C1",
"D5",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "15ecaf75f285"
} |
275 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A S . . . .
B . . . . .
C . # # . .
D . . . . .
E . . E # .
Start: A1 | Goal: E3 | Obstacles (impassable): C2, C3, E4
What is the shortest valid path from A1 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, down, down, right, right",
"down, left, up, right, right, left",
"left, down, up, down, right, left",
"right, down, down, left, left, right"
] | 0 | {
"grid_size": 5,
"start": "A1",
"end": "E3",
"obstacles": [
"C2",
"C3",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "d00abe866789"
} |
276 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A E . . . .
B . . . . .
C . . . . S
D . # . . .
E # . . . #
Start: C5 | Goal: A1 | Obstacles (impassable): D2, E1, E5
What is the shortest valid path from C5 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, up, left, down, left",
"up, right, down, right, down, left",
"left, right, left, up, up, up",
"up, up, left, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "C5",
"end": "A1",
"obstacles": [
"D2",
"E1",
"E5"
],
"shortest_path_length": 6,
"fingerprint": "3cefb23cc109"
} |
277 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . S . # .
B . E . . .
C . . . . .
D # . . # .
E . . . . .
Start: A2 | Goal: B2 | Obstacles (impassable): A4, D1, D4
What is the shortest valid path from A2 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"up",
"down",
"left"
] | 2 | {
"grid_size": 5,
"start": "A2",
"end": "B2",
"obstacles": [
"A4",
"D1",
"D4"
],
"shortest_path_length": 1,
"fingerprint": "4090111b9bef"
} |
278 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A S . # . .
B . E . . .
C . . . . .
D # . . . .
E # . . . .
Start: A1 | Goal: B2 | Obstacles (impassable): A3, D1, E1
What is the shortest valid path from A1 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up",
"down, right",
"left, up",
"left, right"
] | 1 | {
"grid_size": 5,
"start": "A1",
"end": "B2",
"obstacles": [
"A3",
"D1",
"E1"
],
"shortest_path_length": 2,
"fingerprint": "df5ce6bf32fa"
} |
279 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . E . .
B . # . . #
C . . . . .
D . # . . .
E . . . S .
Start: E4 | Goal: A3 | Obstacles (impassable): B2, B5, D2
What is the shortest valid path from E4 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, left",
"left, right, right, up, down",
"down, down, down, right, up",
"up, up, down, right, down"
] | 0 | {
"grid_size": 5,
"start": "E4",
"end": "A3",
"obstacles": [
"B2",
"B5",
"D2"
],
"shortest_path_length": 5,
"fingerprint": "6071f46f92b6"
} |
280 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B # . . . .
C E . . . .
D . S # . .
E . # . . .
Start: D2 | Goal: C1 | Obstacles (impassable): B1, D3, E2
What is the shortest valid path from D2 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left",
"right, left",
"left, left",
"left, right"
] | 0 | {
"grid_size": 5,
"start": "D2",
"end": "C1",
"obstacles": [
"B1",
"D3",
"E2"
],
"shortest_path_length": 2,
"fingerprint": "944d110f1cf3"
} |
281 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . # E . .
C . . . . .
D . . # # S
E . . . . .
Start: D5 | Goal: B3 | Obstacles (impassable): B2, D3, D4
What is the shortest valid path from D5 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, up, up",
"left, up, down, left",
"right, left, left, right",
"up, up, left, left"
] | 3 | {
"grid_size": 5,
"start": "D5",
"end": "B3",
"obstacles": [
"B2",
"D3",
"D4"
],
"shortest_path_length": 4,
"fingerprint": "f93a4f421819"
} |
282 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . S . . .
C E . . . .
D . . . . .
E . . # . #
Start: B2 | Goal: C1 | Obstacles (impassable): A1, E3, E5
What is the shortest valid path from B2 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down",
"down, left",
"up, up",
"right, left"
] | 1 | {
"grid_size": 5,
"start": "B2",
"end": "C1",
"obstacles": [
"A1",
"E3",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "593a05216723"
} |
283 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . .
B . . S E #
C . . . . .
D . . . # .
E . . . . .
Start: B3 | Goal: B4 | Obstacles (impassable): A3, B5, D4
What is the shortest valid path from B3 to B4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"down",
"right",
"left"
] | 2 | {
"grid_size": 5,
"start": "B3",
"end": "B4",
"obstacles": [
"A3",
"B5",
"D4"
],
"shortest_path_length": 1,
"fingerprint": "27386b212e5f"
} |
284 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B . . . . .
C . . . . .
D . . . E #
E # . S . .
Start: E3 | Goal: D4 | Obstacles (impassable): A4, D5, E1
What is the shortest valid path from E3 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up",
"up, left",
"up, right",
"left, right"
] | 2 | {
"grid_size": 5,
"start": "E3",
"end": "D4",
"obstacles": [
"A4",
"D5",
"E1"
],
"shortest_path_length": 2,
"fingerprint": "092670862009"
} |
285 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . . . . .
C . . . . .
D . . . . #
E E . . S #
Start: E4 | Goal: E1 | Obstacles (impassable): A1, D5, E5
What is the shortest valid path from E4 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, down",
"right, up, left",
"up, left, down",
"left, left, left"
] | 3 | {
"grid_size": 5,
"start": "E4",
"end": "E1",
"obstacles": [
"A1",
"D5",
"E5"
],
"shortest_path_length": 3,
"fingerprint": "be99e20f87e1"
} |
286 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . . . .
C . . . . S
D . # . # #
E . . . . E
Start: C5 | Goal: E5 | Obstacles (impassable): D2, D4, D5
What is the shortest valid path from C5 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, up, right, up, right",
"down, down",
"left, left, down, down, right, right",
"up, down, right, left, right, down"
] | 2 | {
"grid_size": 5,
"start": "C5",
"end": "E5",
"obstacles": [
"D2",
"D4",
"D5"
],
"shortest_path_length": 6,
"fingerprint": "33dd89638e68"
} |
287 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . #
B . . . . .
C . . . E .
D . S . . .
E . . # . #
Start: D2 | Goal: C4 | Obstacles (impassable): A5, E3, E5
What is the shortest valid path from D2 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right",
"down, down, up",
"down, right, down",
"right, right, down"
] | 0 | {
"grid_size": 5,
"start": "D2",
"end": "C4",
"obstacles": [
"A5",
"E3",
"E5"
],
"shortest_path_length": 3,
"fingerprint": "05c3d28d002c"
} |
288 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # # .
B . . . . .
C . . . # .
D . . . E .
E . S . . .
Start: E2 | Goal: D4 | Obstacles (impassable): A3, A4, C4
What is the shortest valid path from E2 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right",
"right, left, left",
"up, left, down",
"down, left, left"
] | 0 | {
"grid_size": 5,
"start": "E2",
"end": "D4",
"obstacles": [
"A3",
"A4",
"C4"
],
"shortest_path_length": 3,
"fingerprint": "ed75c8aa4319"
} |
289 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . E
B . . # . .
C . . . . #
D . . . . S
E . . . . .
Start: D5 | Goal: A5 | Obstacles (impassable): A2, B3, C5
What is the shortest valid path from D5 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up",
"left, up, up, up, right",
"up, down, down, left, up",
"down, left, down, up, up"
] | 1 | {
"grid_size": 5,
"start": "D5",
"end": "A5",
"obstacles": [
"A2",
"B3",
"C5"
],
"shortest_path_length": 5,
"fingerprint": "c418b2d86c6a"
} |
290 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . . . . S
C # . . . E
D # . . . .
E . . . . .
Start: B5 | Goal: C5 | Obstacles (impassable): A1, C1, D1
What is the shortest valid path from B5 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"down",
"right",
"up"
] | 1 | {
"grid_size": 5,
"start": "B5",
"end": "C5",
"obstacles": [
"A1",
"C1",
"D1"
],
"shortest_path_length": 1,
"fingerprint": "83a2cc368fa8"
} |
291 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . # . . .
B E # . S #
C . . . . .
D . . . . .
E . . . . .
Start: B4 | Goal: B1 | Obstacles (impassable): A2, B2, B5
What is the shortest valid path from B4 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, left, left, up",
"left, left, left",
"right, left, left, up, up",
"left, up, right, up, up"
] | 0 | {
"grid_size": 5,
"start": "B4",
"end": "B1",
"obstacles": [
"A2",
"B2",
"B5"
],
"shortest_path_length": 5,
"fingerprint": "fefd6b79e99d"
} |
292 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . # .
B . . S . .
C . . E . .
D . # . . .
E . . # . .
Start: B3 | Goal: C3 | Obstacles (impassable): A4, D2, E3
What is the shortest valid path from B3 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"up",
"down",
"left"
] | 2 | {
"grid_size": 5,
"start": "B3",
"end": "C3",
"obstacles": [
"A4",
"D2",
"E3"
],
"shortest_path_length": 1,
"fingerprint": "925a3220c8a0"
} |
293 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # # . . .
B . . # . .
C . . . . .
D . . S . .
E . . E . .
Start: D3 | Goal: E3 | Obstacles (impassable): A1, A2, B3
What is the shortest valid path from D3 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down",
"left",
"up",
"right"
] | 0 | {
"grid_size": 5,
"start": "D3",
"end": "E3",
"obstacles": [
"A1",
"A2",
"B3"
],
"shortest_path_length": 1,
"fingerprint": "6917229dcedc"
} |
294 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . .
B . . # . #
C . S . . .
D . # . . .
E E . . . .
Start: C2 | Goal: E1 | Obstacles (impassable): B3, B5, D2
What is the shortest valid path from C2 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, left",
"right, up, left",
"left, down, down",
"down, down, left"
] | 2 | {
"grid_size": 5,
"start": "C2",
"end": "E1",
"obstacles": [
"B3",
"B5",
"D2"
],
"shortest_path_length": 3,
"fingerprint": "98bec6be99fb"
} |
295 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . # . #
B . . . . .
C . . S . .
D . . . . .
E . E . # .
Start: C3 | Goal: E2 | Obstacles (impassable): A3, A5, E4
What is the shortest valid path from C3 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, right",
"down, down, right",
"down, down, left",
"right, down, right"
] | 2 | {
"grid_size": 5,
"start": "C3",
"end": "E2",
"obstacles": [
"A3",
"A5",
"E4"
],
"shortest_path_length": 3,
"fingerprint": "fd9f53426d8e"
} |
296 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . #
B . # . . .
C . . . . .
D . . E S .
E . # . . .
Start: D4 | Goal: D3 | Obstacles (impassable): A5, B2, E2
What is the shortest valid path from D4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"down",
"up",
"left"
] | 3 | {
"grid_size": 5,
"start": "D4",
"end": "D3",
"obstacles": [
"A5",
"B2",
"E2"
],
"shortest_path_length": 1,
"fingerprint": "f6722aab7cc8"
} |
297 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . S
B . . . . .
C # . . . .
D . . . . .
E . . . E #
Start: A5 | Goal: E4 | Obstacles (impassable): A1, C1, E5
What is the shortest valid path from A5 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, up, down, down",
"down, down, down, down, left",
"right, right, left, right, left",
"down, down, down, left, down"
] | 3 | {
"grid_size": 5,
"start": "A5",
"end": "E4",
"obstacles": [
"A1",
"C1",
"E5"
],
"shortest_path_length": 5,
"fingerprint": "0d8d7895b4f0"
} |
298 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A # . . . .
B . . # . .
C . . . . .
D . . . E S
E . # . . .
Start: D5 | Goal: D4 | Obstacles (impassable): A1, B3, E2
What is the shortest valid path from D5 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"up",
"right",
"down"
] | 0 | {
"grid_size": 5,
"start": "D5",
"end": "D4",
"obstacles": [
"A1",
"B3",
"E2"
],
"shortest_path_length": 1,
"fingerprint": "f81d5c705c92"
} |
299 | You are navigating a 5×5 grid. Rows are labeled A–E (top to bottom), columns 1–5 (left to right). You can move one step at a time: up, down, left, or right. You CANNOT move diagonally, move outside the grid boundaries, or pass through obstacle cells.
Grid map:
1 2 3 4 5
A . . . . #
B S # . . .
C . . E . .
D # . . . .
E . . . . .
Start: B1 | Goal: C3 | Obstacles (impassable): A5, B2, D1
What is the shortest valid path from B1 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, right",
"down, up, right",
"down, down, down",
"down, right, right"
] | 3 | {
"grid_size": 5,
"start": "B1",
"end": "C3",
"obstacles": [
"A5",
"B2",
"D1"
],
"shortest_path_length": 3,
"fingerprint": "05bdbffdf093"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.