Datasets:
doc_id int64 0 999 ⌀ | query stringlengths 213 1.05k | choices listlengths 4 4 | gold int64 0 3 | metadata dict |
|---|---|---|---|---|
0 | 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: A4 | Obstacles (impassable): A1, B4, E4
What is the shortest valid path from E1 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right, up, right, right",
"down, down, down, up, up, right, up",
"up, up, down, down, up, down, right",
"up, up, up, up, right, right, right"
] | 0 | {
"grid_size": 5,
"start": "E1",
"end": "A4",
"obstacles": [
"A1",
"B4",
"E4"
],
"shortest_path_length": 7,
"fingerprint": "8529ab37b57d"
} |
1 | 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): B1, C4, E3
What is the shortest valid path from A1 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, left, left, up, right, up, right",
"down, down, down, down, right, right, right, right",
"left, left, down, down, left, up, up, right",
"right, down, down, down, right, right, down, right"
] | 3 | {
"grid_size": 5,
"start": "A1",
"end": "E5",
"obstacles": [
"B1",
"C4",
"E3"
],
"shortest_path_length": 8,
"fingerprint": "2baae7cbb779"
} |
2 | 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: E1 | Goal: D5 | Obstacles (impassable): B2, C2, D4
What is the shortest valid path from E1 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up, right, left, right",
"up, right, right, right, right",
"right, right, right, right, up",
"up, up, down, left, up"
] | 2 | {
"grid_size": 5,
"start": "E1",
"end": "D5",
"obstacles": [
"B2",
"C2",
"D4"
],
"shortest_path_length": 5,
"fingerprint": "6fe4924af625"
} |
3 | 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: B2 | Obstacles (impassable): B4, E2, E3
What is the shortest valid path from C2 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"left",
"right",
"down"
] | 0 | {
"grid_size": 5,
"start": "C2",
"end": "B2",
"obstacles": [
"B4",
"E2",
"E3"
],
"shortest_path_length": 1,
"fingerprint": "09ec4fc04c3d"
} |
4 | 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: E5 | Goal: A2 | Obstacles (impassable): B3, C1, C3
What is the shortest valid path from E5 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, down, left, down, right, right",
"right, down, left, down, down, left, right",
"right, left, down, down, right, up, up",
"up, up, up, up, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "E5",
"end": "A2",
"obstacles": [
"B3",
"C1",
"C3"
],
"shortest_path_length": 7,
"fingerprint": "77bec7d5a937"
} |
5 | 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: E2 | Goal: C4 | Obstacles (impassable): A3, C3, D5
What is the shortest valid path from E2 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, left, up",
"up, right, right, up",
"up, up, right, right",
"right, right, left, up"
] | 1 | {
"grid_size": 5,
"start": "E2",
"end": "C4",
"obstacles": [
"A3",
"C3",
"D5"
],
"shortest_path_length": 4,
"fingerprint": "175dfb97fa85"
} |
6 | 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): B4, D2, E4
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, left, down, up, down, up",
"down, up, left, down, down, left",
"down, up, left, right, up, up",
"up, up, left, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "C5",
"end": "A1",
"obstacles": [
"B4",
"D2",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "edf28c829e63"
} |
7 | 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): A5, D3, E2
What is the shortest valid path from A3 to E5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, left, right, right, up",
"right, down, left, right, down, down",
"down, down, right, down, down, right",
"down, down, down, down, right, right"
] | 2 | {
"grid_size": 5,
"start": "A3",
"end": "E5",
"obstacles": [
"A5",
"D3",
"E2"
],
"shortest_path_length": 6,
"fingerprint": "7ed07fcd2bf8"
} |
8 | 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): B3, D3, 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",
"down, up",
"up, down",
"up, left"
] | 0 | {
"grid_size": 5,
"start": "C1",
"end": "A1",
"obstacles": [
"B3",
"D3",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "afefb2103538"
} |
9 | 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: D3 | Obstacles (impassable): A5, D4, E4
What is the shortest valid path from B2 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, right",
"right, down, up",
"right, down, right",
"up, right, left"
] | 0 | {
"grid_size": 5,
"start": "B2",
"end": "D3",
"obstacles": [
"A5",
"D4",
"E4"
],
"shortest_path_length": 3,
"fingerprint": "ec2fef561bbf"
} |
10 | 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: A2 | Obstacles (impassable): A4, E1, E2
What is the shortest valid path from E4 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, left, left",
"up, right, left, up, down, down",
"up, up, up, left, up, left",
"down, right, down, right, down, left"
] | 2 | {
"grid_size": 5,
"start": "E4",
"end": "A2",
"obstacles": [
"A4",
"E1",
"E2"
],
"shortest_path_length": 6,
"fingerprint": "dccec681a280"
} |
11 | 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: D3 | Obstacles (impassable): A2, A4, E1
What is the shortest valid path from C5 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, right, right",
"up, up, down",
"right, down, right",
"down, left, left"
] | 3 | {
"grid_size": 5,
"start": "C5",
"end": "D3",
"obstacles": [
"A2",
"A4",
"E1"
],
"shortest_path_length": 3,
"fingerprint": "8e47ccd6736e"
} |
12 | 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: C3 | Obstacles (impassable): B4, B5, C5
What is the shortest valid path from A1 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, up, up",
"down, up, up, down",
"left, up, up, right",
"down, down, right, right"
] | 3 | {
"grid_size": 5,
"start": "A1",
"end": "C3",
"obstacles": [
"B4",
"B5",
"C5"
],
"shortest_path_length": 4,
"fingerprint": "edad417d0b5a"
} |
13 | 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: E2 | Goal: B3 | Obstacles (impassable): A4, C3, D4
What is the shortest valid path from E2 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right",
"down, left, right, down",
"down, up, up, right",
"left, left, down, left"
] | 0 | {
"grid_size": 5,
"start": "E2",
"end": "B3",
"obstacles": [
"A4",
"C3",
"D4"
],
"shortest_path_length": 4,
"fingerprint": "49ce006c4847"
} |
14 | 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: E5 | Goal: A3 | Obstacles (impassable): A1, C5, D5
What is the shortest valid path from E5 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, left, left",
"left, up, up, up, up, left",
"up, down, left, left, down, right",
"up, up, down, left, down, left"
] | 1 | {
"grid_size": 5,
"start": "E5",
"end": "A3",
"obstacles": [
"A1",
"C5",
"D5"
],
"shortest_path_length": 6,
"fingerprint": "bf512a870740"
} |
15 | 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: D3 | Obstacles (impassable): A4, A5, B5
What is the shortest valid path from E2 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right",
"left, left",
"up, down",
"left, up"
] | 0 | {
"grid_size": 5,
"start": "E2",
"end": "D3",
"obstacles": [
"A4",
"A5",
"B5"
],
"shortest_path_length": 2,
"fingerprint": "b3d6e91ecd51"
} |
16 | 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): B4, D2, E1
What is the shortest valid path from B2 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, up, left, down",
"down, down, down",
"down, right, down, down, left",
"right, left, up, up, right"
] | 2 | {
"grid_size": 5,
"start": "B2",
"end": "E2",
"obstacles": [
"B4",
"D2",
"E1"
],
"shortest_path_length": 5,
"fingerprint": "4adf9cd71dd2"
} |
17 | 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, A4, C4
What is the shortest valid path from D3 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"right",
"down",
"up"
] | 2 | {
"grid_size": 5,
"start": "D3",
"end": "E3",
"obstacles": [
"A1",
"A4",
"C4"
],
"shortest_path_length": 1,
"fingerprint": "71654d22088a"
} |
18 | 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): B2, B3, E2
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, left, right, down",
"up, up",
"down, down, down, right",
"left, up, up, right"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "A2",
"obstacles": [
"B2",
"B3",
"E2"
],
"shortest_path_length": 4,
"fingerprint": "6becd0ad5e1b"
} |
19 | 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: E2 | Obstacles (impassable): B3, B4, E4
What is the shortest valid path from C4 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, right",
"down, left, down, left",
"down, down, left, left",
"down, up, right, up"
] | 1 | {
"grid_size": 5,
"start": "C4",
"end": "E2",
"obstacles": [
"B3",
"B4",
"E4"
],
"shortest_path_length": 4,
"fingerprint": "d3b685cbd292"
} |
20 | 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: B3 | Goal: A1 | Obstacles (impassable): B2, C3, E2
What is the shortest valid path from B3 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, up",
"left, left, up",
"up, left, left",
"left, left, right"
] | 2 | {
"grid_size": 5,
"start": "B3",
"end": "A1",
"obstacles": [
"B2",
"C3",
"E2"
],
"shortest_path_length": 3,
"fingerprint": "85f4eb395ebe"
} |
21 | 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 . E .
B . . . . .
C . # . # .
D . . . . #
E . . . . .
Start: A2 | Goal: A4 | Obstacles (impassable): C2, C4, D5
What is the shortest valid path from A2 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left",
"left, right",
"up, right",
"right, right"
] | 3 | {
"grid_size": 5,
"start": "A2",
"end": "A4",
"obstacles": [
"C2",
"C4",
"D5"
],
"shortest_path_length": 2,
"fingerprint": "c8ee44fb0cef"
} |
22 | 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: D2 | Obstacles (impassable): D3, E2, E4
What is the shortest valid path from A1 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, right, up",
"down, down, down, right",
"left, right, left, right",
"left, left, up, left"
] | 1 | {
"grid_size": 5,
"start": "A1",
"end": "D2",
"obstacles": [
"D3",
"E2",
"E4"
],
"shortest_path_length": 4,
"fingerprint": "fe498410cd5b"
} |
23 | 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): C3, E2, E4
What is the shortest valid path from B2 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, down",
"down, left, right",
"up, left, left",
"down, right, right"
] | 0 | {
"grid_size": 5,
"start": "B2",
"end": "C4",
"obstacles": [
"C3",
"E2",
"E4"
],
"shortest_path_length": 3,
"fingerprint": "8fdf30566ca2"
} |
24 | 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: E2 | Obstacles (impassable): B2, D1, D2
What is the shortest valid path from C5 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, down, down, down",
"down, down, left, left, left",
"down, up, left, left, up",
"up, up, down, right, up"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "E2",
"obstacles": [
"B2",
"D1",
"D2"
],
"shortest_path_length": 5,
"fingerprint": "8005484d246c"
} |
25 | 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: E3 | Goal: C3 | Obstacles (impassable): A5, B3, D1
What is the shortest valid path from E3 to C3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, right",
"up, down",
"right, down",
"up, up"
] | 3 | {
"grid_size": 5,
"start": "E3",
"end": "C3",
"obstacles": [
"A5",
"B3",
"D1"
],
"shortest_path_length": 2,
"fingerprint": "db0bfd8caaf9"
} |
26 | 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: E2 | Obstacles (impassable): D2, D3, D5
What is the shortest valid path from C5 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, left, left, left",
"left, down, down, left, left",
"left, right, right, right, down",
"right, right, left, down, left"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "E2",
"obstacles": [
"D2",
"D3",
"D5"
],
"shortest_path_length": 5,
"fingerprint": "6a0e643ec2bf"
} |
27 | 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: C5 | Obstacles (impassable): A3, B5, E3
What is the shortest valid path from B4 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left",
"up, down",
"down, right",
"down, left"
] | 2 | {
"grid_size": 5,
"start": "B4",
"end": "C5",
"obstacles": [
"A3",
"B5",
"E3"
],
"shortest_path_length": 2,
"fingerprint": "fa2641b52a2b"
} |
28 | 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: E3 | Goal: A5 | Obstacles (impassable): A3, B2, C4
What is the shortest valid path from E3 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, right, up, right",
"right, right, up, right, right, up",
"up, up, up, up, right, right",
"right, left, right, right, up, down"
] | 0 | {
"grid_size": 5,
"start": "E3",
"end": "A5",
"obstacles": [
"A3",
"B2",
"C4"
],
"shortest_path_length": 6,
"fingerprint": "b4566d34f9e6"
} |
29 | 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: D3 | Obstacles (impassable): B3, D5, E4
What is the shortest valid path from C4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left",
"left, right",
"right, down",
"right, up"
] | 0 | {
"grid_size": 5,
"start": "C4",
"end": "D3",
"obstacles": [
"B3",
"D5",
"E4"
],
"shortest_path_length": 2,
"fingerprint": "118078d354dc"
} |
30 | 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: E4 | Goal: B1 | Obstacles (impassable): A5, C5, D5
What is the shortest valid path from E4 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, up, left, right, left",
"up, up, up, left, left, left",
"up, right, up, up, right, down",
"down, right, left, left, right, left"
] | 1 | {
"grid_size": 5,
"start": "E4",
"end": "B1",
"obstacles": [
"A5",
"C5",
"D5"
],
"shortest_path_length": 6,
"fingerprint": "c8634f1d64f7"
} |
31 | 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: A1 | Obstacles (impassable): A2, D3, E4
What is the shortest valid path from D1 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, down",
"down, up, down",
"up, up, up",
"left, down, up"
] | 2 | {
"grid_size": 5,
"start": "D1",
"end": "A1",
"obstacles": [
"A2",
"D3",
"E4"
],
"shortest_path_length": 3,
"fingerprint": "a1eb09ae8715"
} |
32 | 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: A4 | Obstacles (impassable): B2, C5, D4
What is the shortest valid path from E2 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, right, right",
"up, up, left, right, right, down",
"left, left, down, up, down, left",
"up, up, right, up, up, right"
] | 3 | {
"grid_size": 5,
"start": "E2",
"end": "A4",
"obstacles": [
"B2",
"C5",
"D4"
],
"shortest_path_length": 6,
"fingerprint": "dea7af4128aa"
} |
33 | 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): B5, E2, E5
What is the shortest valid path from A4 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, up, right, right",
"up, up, left, right, left",
"down, down, down, down, left",
"up, right, left, right, down"
] | 2 | {
"grid_size": 5,
"start": "A4",
"end": "E3",
"obstacles": [
"B5",
"E2",
"E5"
],
"shortest_path_length": 5,
"fingerprint": "5fc90a7ca509"
} |
34 | 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: D3 | Obstacles (impassable): C5, D1, E5
What is the shortest valid path from D5 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down",
"right, left",
"left, left",
"up, left"
] | 2 | {
"grid_size": 5,
"start": "D5",
"end": "D3",
"obstacles": [
"C5",
"D1",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "6e42a9533316"
} |
35 | 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: D5 | Obstacles (impassable): C1, C3, E2
What is the shortest valid path from D4 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"up",
"right",
"down"
] | 2 | {
"grid_size": 5,
"start": "D4",
"end": "D5",
"obstacles": [
"C1",
"C3",
"E2"
],
"shortest_path_length": 1,
"fingerprint": "bf388d65ab52"
} |
36 | 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: C1 | Obstacles (impassable): D3, D5, E3
What is the shortest valid path from B4 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, up, up",
"up, down, up, down",
"down, left, left, left",
"right, right, down, right"
] | 2 | {
"grid_size": 5,
"start": "B4",
"end": "C1",
"obstacles": [
"D3",
"D5",
"E3"
],
"shortest_path_length": 4,
"fingerprint": "d82016d16639"
} |
37 | 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: B3 | Obstacles (impassable): B5, D4, E2
What is the shortest valid path from E3 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left, left",
"up, up, up",
"left, down, up",
"left, right, left"
] | 1 | {
"grid_size": 5,
"start": "E3",
"end": "B3",
"obstacles": [
"B5",
"D4",
"E2"
],
"shortest_path_length": 3,
"fingerprint": "11f68d9f6104"
} |
38 | 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): B1, E3, E5
What is the shortest valid path from E4 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left",
"up, left",
"left, up",
"down, down"
] | 1 | {
"grid_size": 5,
"start": "E4",
"end": "D3",
"obstacles": [
"B1",
"E3",
"E5"
],
"shortest_path_length": 2,
"fingerprint": "246267d61f81"
} |
39 | 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: B1 | Obstacles (impassable): A1, B5, E3
What is the shortest valid path from C2 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left",
"up, up",
"up, left",
"left, down"
] | 2 | {
"grid_size": 5,
"start": "C2",
"end": "B1",
"obstacles": [
"A1",
"B5",
"E3"
],
"shortest_path_length": 2,
"fingerprint": "852036fe893f"
} |
40 | 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: D4 | Goal: B5 | Obstacles (impassable): C1, C5, D1
What is the shortest valid path from D4 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up, left",
"right, up, up",
"right, right, up",
"up, up, right"
] | 3 | {
"grid_size": 5,
"start": "D4",
"end": "B5",
"obstacles": [
"C1",
"C5",
"D1"
],
"shortest_path_length": 3,
"fingerprint": "afac8c6a8d01"
} |
41 | 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: D4 | Goal: B5 | Obstacles (impassable): A3, A4, B3
What is the shortest valid path from D4 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, right",
"right, right, left",
"right, left, up",
"up, up, right"
] | 3 | {
"grid_size": 5,
"start": "D4",
"end": "B5",
"obstacles": [
"A3",
"A4",
"B3"
],
"shortest_path_length": 3,
"fingerprint": "b81c0db44238"
} |
42 | 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: E2 | Obstacles (impassable): A3, B1, B3
What is the shortest valid path from B4 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up, down, up, right",
"down, down, down, left, left",
"left, left, right, up, down",
"right, right, left, up, down"
] | 1 | {
"grid_size": 5,
"start": "B4",
"end": "E2",
"obstacles": [
"A3",
"B1",
"B3"
],
"shortest_path_length": 5,
"fingerprint": "01e56c0bcb24"
} |
43 | 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: C4 | Goal: A4 | Obstacles (impassable): B3, D3, E1
What is the shortest valid path from C4 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up",
"down, left",
"up, down",
"down, up"
] | 0 | {
"grid_size": 5,
"start": "C4",
"end": "A4",
"obstacles": [
"B3",
"D3",
"E1"
],
"shortest_path_length": 2,
"fingerprint": "1ece048e9b20"
} |
44 | 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): B5, C3, 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, up, up",
"up, up, left",
"up, up, right",
"left, right, right"
] | 0 | {
"grid_size": 5,
"start": "C5",
"end": "A4",
"obstacles": [
"B5",
"C3",
"E3"
],
"shortest_path_length": 3,
"fingerprint": "78570fb89b30"
} |
45 | 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 . E . .
B . . # . .
C . . . . .
D . . . # .
E . # . . .
Start: A1 | Goal: A3 | Obstacles (impassable): B3, D4, E2
What is the shortest valid path from A1 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right",
"up, left",
"up, down",
"left, down"
] | 0 | {
"grid_size": 5,
"start": "A1",
"end": "A3",
"obstacles": [
"B3",
"D4",
"E2"
],
"shortest_path_length": 2,
"fingerprint": "55902e37112b"
} |
46 | 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: D1 | Obstacles (impassable): C1, C2, C4
What is the shortest valid path from A3 to D1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up, down, left, right",
"down, down, down, left, left",
"right, left, right, up, right",
"up, left, left, left, up"
] | 1 | {
"grid_size": 5,
"start": "A3",
"end": "D1",
"obstacles": [
"C1",
"C2",
"C4"
],
"shortest_path_length": 5,
"fingerprint": "5d9764d9b004"
} |
47 | 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: D3 | Obstacles (impassable): A2, C4, C5
What is the shortest valid path from E2 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left",
"up, right",
"up, down",
"right, right"
] | 1 | {
"grid_size": 5,
"start": "E2",
"end": "D3",
"obstacles": [
"A2",
"C4",
"C5"
],
"shortest_path_length": 2,
"fingerprint": "a792c69c8e71"
} |
48 | 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): A4, D1, E3
What is the shortest valid path from B5 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up",
"left",
"right",
"down"
] | 3 | {
"grid_size": 5,
"start": "B5",
"end": "C5",
"obstacles": [
"A4",
"D1",
"E3"
],
"shortest_path_length": 1,
"fingerprint": "3103c3057a5b"
} |
49 | 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): A5, D1, E1
What is the shortest valid path from C5 to A4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, left",
"up, left, up",
"left, left, right",
"right, right, down"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "A4",
"obstacles": [
"A5",
"D1",
"E1"
],
"shortest_path_length": 3,
"fingerprint": "8c6e2b748c57"
} |
50 | 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: C3 | Goal: B2 | Obstacles (impassable): D2, D5, E4
What is the shortest valid path from C3 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left",
"left, right",
"down, up",
"up, left"
] | 3 | {
"grid_size": 5,
"start": "C3",
"end": "B2",
"obstacles": [
"D2",
"D5",
"E4"
],
"shortest_path_length": 2,
"fingerprint": "f9b04c2da380"
} |
51 | 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: E2 | Obstacles (impassable): A5, C5, D1
What is the shortest valid path from D4 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, left",
"down, left, left",
"down, down, right",
"right, left, left"
] | 1 | {
"grid_size": 5,
"start": "D4",
"end": "E2",
"obstacles": [
"A5",
"C5",
"D1"
],
"shortest_path_length": 3,
"fingerprint": "ef308e3c1c04"
} |
52 | 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: C1 | Goal: E4 | Obstacles (impassable): C3, D1, E3
What is the shortest valid path from C1 to E4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, right, right, right",
"left, up, right, up, right",
"right, down, right, up, down",
"right, down, right, right, down"
] | 3 | {
"grid_size": 5,
"start": "C1",
"end": "E4",
"obstacles": [
"C3",
"D1",
"E3"
],
"shortest_path_length": 5,
"fingerprint": "fd1f598779e7"
} |
53 | 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: E1 | Obstacles (impassable): A3, A5, D1
What is the shortest valid path from C4 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, right, up, left",
"down, left, down, up, right",
"right, left, right, up, up",
"down, down, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "C4",
"end": "E1",
"obstacles": [
"A3",
"A5",
"D1"
],
"shortest_path_length": 5,
"fingerprint": "62fec6e46ca6"
} |
54 | 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: C5 | Goal: B1 | Obstacles (impassable): A1, B5, E3
What is the shortest valid path from C5 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, down, down, right",
"up, left, up, left, left",
"left, up, left, left, left",
"up, left, left, left, left"
] | 2 | {
"grid_size": 5,
"start": "C5",
"end": "B1",
"obstacles": [
"A1",
"B5",
"E3"
],
"shortest_path_length": 5,
"fingerprint": "77ff00e2a8d5"
} |
55 | 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: D5 | Obstacles (impassable): B3, C3, E2
What is the shortest valid path from A3 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, right, left",
"right, left, up, right, left",
"right, down, down, down, right",
"down, down, down, right, right"
] | 2 | {
"grid_size": 5,
"start": "A3",
"end": "D5",
"obstacles": [
"B3",
"C3",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "11d703aeac36"
} |
56 | 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: D4 | Obstacles (impassable): B5, C4, E1
What is the shortest valid path from C2 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, left",
"left, right, left",
"up, down, right",
"down, right, right"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "D4",
"obstacles": [
"B5",
"C4",
"E1"
],
"shortest_path_length": 3,
"fingerprint": "eb841ea89d7d"
} |
57 | 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: A1 | Obstacles (impassable): D4, E2, E5
What is the shortest valid path from B4 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, down, down, left",
"up, right, left, down",
"up, left, left, left",
"down, up, up, left"
] | 2 | {
"grid_size": 5,
"start": "B4",
"end": "A1",
"obstacles": [
"D4",
"E2",
"E5"
],
"shortest_path_length": 4,
"fingerprint": "c026b4754fb4"
} |
58 | 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: A5 | Obstacles (impassable): A3, B5, C1
What is the shortest valid path from E4 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, up, right",
"left, up, right, up, down",
"left, down, left, right, left",
"right, down, down, down, left"
] | 0 | {
"grid_size": 5,
"start": "E4",
"end": "A5",
"obstacles": [
"A3",
"B5",
"C1"
],
"shortest_path_length": 5,
"fingerprint": "11e0f4a2ee3a"
} |
59 | 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: C2 | Obstacles (impassable): A1, A3, C3
What is the shortest valid path from D3 to C2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left",
"left, right",
"left, up",
"right, left"
] | 2 | {
"grid_size": 5,
"start": "D3",
"end": "C2",
"obstacles": [
"A1",
"A3",
"C3"
],
"shortest_path_length": 2,
"fingerprint": "92cba12c0cae"
} |
60 | 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: A1 | Obstacles (impassable): C1, D3, D5
What is the shortest valid path from D1 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up",
"down, up, right, left, right",
"right, up, up, up, left",
"up, down, up, up, left"
] | 2 | {
"grid_size": 5,
"start": "D1",
"end": "A1",
"obstacles": [
"C1",
"D3",
"D5"
],
"shortest_path_length": 5,
"fingerprint": "e6fda408f582"
} |
61 | 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): A5, C3, C5
What is the shortest valid path from B3 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right, left",
"down, down",
"left, right, down, right",
"left, down, down, right"
] | 3 | {
"grid_size": 5,
"start": "B3",
"end": "D3",
"obstacles": [
"A5",
"C3",
"C5"
],
"shortest_path_length": 4,
"fingerprint": "7c046a1787a3"
} |
62 | 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: C5 | Obstacles (impassable): A4, B3, C2
What is the shortest valid path from B2 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, right, right, right",
"up, down, up, up, left, down, down, down",
"left, left, up, right, left, down, up, right",
"left, down, down, right, right, up, right, right"
] | 3 | {
"grid_size": 5,
"start": "B2",
"end": "C5",
"obstacles": [
"A4",
"B3",
"C2"
],
"shortest_path_length": 8,
"fingerprint": "c5c7c3a42851"
} |
63 | 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: D4 | Goal: B2 | Obstacles (impassable): B3, C1, E5
What is the shortest valid path from D4 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, left, left",
"down, up, left, down",
"down, left, down, up",
"up, left, left, up"
] | 3 | {
"grid_size": 5,
"start": "D4",
"end": "B2",
"obstacles": [
"B3",
"C1",
"E5"
],
"shortest_path_length": 4,
"fingerprint": "d427dce11cb1"
} |
64 | 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): A1, C1, D4
What is the shortest valid path from C2 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, down",
"right, left",
"down, left",
"up, right"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "B3",
"obstacles": [
"A1",
"C1",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "3c9bc06e8928"
} |
65 | 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: A2 | Obstacles (impassable): D2, E2, E4
What is the shortest valid path from D5 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, up, up, left, left, left",
"left, right, up, up, right, right",
"right, up, right, right, up, up",
"left, down, up, down, left, left"
] | 0 | {
"grid_size": 5,
"start": "D5",
"end": "A2",
"obstacles": [
"D2",
"E2",
"E4"
],
"shortest_path_length": 6,
"fingerprint": "e7efe5c8df88"
} |
66 | 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: D2 | Obstacles (impassable): A4, C4, D5
What is the shortest valid path from C5 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, left, down, down, left",
"up, down, right, right, down, right",
"down, left, left, left",
"left, right, right, right, up, left"
] | 0 | {
"grid_size": 5,
"start": "C5",
"end": "D2",
"obstacles": [
"A4",
"C4",
"D5"
],
"shortest_path_length": 6,
"fingerprint": "e0fc3bdcee74"
} |
67 | 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: A5 | Obstacles (impassable): A3, D1, E2
What is the shortest valid path from C2 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right, up, right",
"up, up, up, right, up",
"up, up, right, right, right",
"left, down, up, left, up"
] | 0 | {
"grid_size": 5,
"start": "C2",
"end": "A5",
"obstacles": [
"A3",
"D1",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "6e677b474f3a"
} |
68 | 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: A2 | Obstacles (impassable): B5, C2, D5
What is the shortest valid path from E4 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, up, down, left, left",
"up, up, up, up, left, left",
"up, down, down, right, down, up",
"left, left, up, left, down, right"
] | 1 | {
"grid_size": 5,
"start": "E4",
"end": "A2",
"obstacles": [
"B5",
"C2",
"D5"
],
"shortest_path_length": 6,
"fingerprint": "7361d67a6a56"
} |
69 | 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: A5 | Obstacles (impassable): C3, D4, E2
What is the shortest valid path from B1 to A5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left, left, up, up",
"right, right, right, left, down",
"up, right, right, right, right",
"up, down, up, up, down"
] | 2 | {
"grid_size": 5,
"start": "B1",
"end": "A5",
"obstacles": [
"C3",
"D4",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "b1efd1636125"
} |
70 | 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): B4, C4, C5
What is the shortest valid path from E2 to A3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, right, right, left, down",
"up, left, right, up, left",
"right, left, up, down, right",
"up, up, up, up, right"
] | 3 | {
"grid_size": 5,
"start": "E2",
"end": "A3",
"obstacles": [
"B4",
"C4",
"C5"
],
"shortest_path_length": 5,
"fingerprint": "cd26007a06e5"
} |
71 | 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: B5 | Goal: B2 | Obstacles (impassable): A5, B4, E5
What is the shortest valid path from B5 to B2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, down, right, down",
"left, left, left",
"down, left, left, up, left",
"left, left, up, up, right"
] | 2 | {
"grid_size": 5,
"start": "B5",
"end": "B2",
"obstacles": [
"A5",
"B4",
"E5"
],
"shortest_path_length": 5,
"fingerprint": "d052ff88d17a"
} |
72 | 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: A2 | Obstacles (impassable): A1, C4, C5
What is the shortest valid path from E4 to A2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, up, left, down, right",
"up, up, up, up, left, left",
"up, left, up, up, up, left",
"up, left, right, right, right, left"
] | 2 | {
"grid_size": 5,
"start": "E4",
"end": "A2",
"obstacles": [
"A1",
"C4",
"C5"
],
"shortest_path_length": 6,
"fingerprint": "915a96cc76f5"
} |
73 | 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: A4 | Goal: B3 | Obstacles (impassable): C3, C4, D4
What is the shortest valid path from A4 to B3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right",
"down, up",
"left, left",
"down, left"
] | 3 | {
"grid_size": 5,
"start": "A4",
"end": "B3",
"obstacles": [
"C3",
"C4",
"D4"
],
"shortest_path_length": 2,
"fingerprint": "67b41aed528b"
} |
74 | 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): A5, E1, 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). | [
"down, down, up, down, right",
"down, up, down, left, down",
"up, up, left, left, left",
"right, right, left, left, down"
] | 2 | {
"grid_size": 5,
"start": "E5",
"end": "C2",
"obstacles": [
"A5",
"E1",
"E4"
],
"shortest_path_length": 5,
"fingerprint": "bf1de13fcff0"
} |
75 | 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): B4, B5, D4
What is the shortest valid path from C5 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, up, left, right, right",
"down, down, left, left, left, left",
"up, up, left, left, up, up",
"right, right, up, right, down, left"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "E1",
"obstacles": [
"B4",
"B5",
"D4"
],
"shortest_path_length": 6,
"fingerprint": "013ea96122cb"
} |
76 | 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: A2 | Goal: C5 | Obstacles (impassable): A4, C1, E3
What is the shortest valid path from A2 to C5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down, left, left, left",
"right, right, left, up, left",
"up, down, up, down, right",
"down, down, right, right, right"
] | 3 | {
"grid_size": 5,
"start": "A2",
"end": "C5",
"obstacles": [
"A4",
"C1",
"E3"
],
"shortest_path_length": 5,
"fingerprint": "e9228bc72830"
} |
77 | 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: E2 | Obstacles (impassable): B4, B5, C3
What is the shortest valid path from D3 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, down",
"left, left",
"up, down",
"down, left"
] | 3 | {
"grid_size": 5,
"start": "D3",
"end": "E2",
"obstacles": [
"B4",
"B5",
"C3"
],
"shortest_path_length": 2,
"fingerprint": "e8711f211de1"
} |
78 | 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: E1 | Goal: C1 | Obstacles (impassable): A5, E2, E3
What is the shortest valid path from E1 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, up",
"left, left",
"up, up",
"up, right"
] | 2 | {
"grid_size": 5,
"start": "E1",
"end": "C1",
"obstacles": [
"A5",
"E2",
"E3"
],
"shortest_path_length": 2,
"fingerprint": "44981907ab83"
} |
79 | 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: D1 | Obstacles (impassable): A5, B2, B3
What is the shortest valid path from E5 to D1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up, left, up, up",
"up, left, left, left, left",
"down, down, right, up, right",
"left, down, right, down, down"
] | 1 | {
"grid_size": 5,
"start": "E5",
"end": "D1",
"obstacles": [
"A5",
"B2",
"B3"
],
"shortest_path_length": 5,
"fingerprint": "afd4c47db053"
} |
80 | 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: D5 | Obstacles (impassable): B5, E4, E5
What is the shortest valid path from C5 to D5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left",
"down",
"right",
"up"
] | 1 | {
"grid_size": 5,
"start": "C5",
"end": "D5",
"obstacles": [
"B5",
"E4",
"E5"
],
"shortest_path_length": 1,
"fingerprint": "c8b54540a836"
} |
81 | 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: D2 | Obstacles (impassable): A3, A4, B5
What is the shortest valid path from E3 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left",
"right, down",
"right, up",
"down, left"
] | 0 | {
"grid_size": 5,
"start": "E3",
"end": "D2",
"obstacles": [
"A3",
"A4",
"B5"
],
"shortest_path_length": 2,
"fingerprint": "76800f0eb640"
} |
82 | 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: C4 | Obstacles (impassable): A2, C3, D2
What is the shortest valid path from A1 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, up, left, up, left",
"left, down, right, up, left",
"down, right, right, right, down",
"down, down, right, right, right"
] | 2 | {
"grid_size": 5,
"start": "A1",
"end": "C4",
"obstacles": [
"A2",
"C3",
"D2"
],
"shortest_path_length": 5,
"fingerprint": "5114f79f94ca"
} |
83 | 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: B5 | Goal: D1 | Obstacles (impassable): A5, E3, E5
What is the shortest valid path from B5 to D1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, right, up, left, down",
"right, right, up, up, up, left",
"left, up, up, down, right, right",
"down, down, left, left, left, left"
] | 3 | {
"grid_size": 5,
"start": "B5",
"end": "D1",
"obstacles": [
"A5",
"E3",
"E5"
],
"shortest_path_length": 6,
"fingerprint": "54dd8ea6fd6e"
} |
84 | 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: D3 | Obstacles (impassable): A1, D2, E1
What is the shortest valid path from D5 to D3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, left",
"up, left",
"left, right",
"down, down"
] | 0 | {
"grid_size": 5,
"start": "D5",
"end": "D3",
"obstacles": [
"A1",
"D2",
"E1"
],
"shortest_path_length": 2,
"fingerprint": "7affa659dee2"
} |
85 | 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: E2 | Obstacles (impassable): A3, C2, D2
What is the shortest valid path from B1 to E2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, up, left",
"down, down, down, right",
"up, right, left, left",
"up, up, right, right"
] | 1 | {
"grid_size": 5,
"start": "B1",
"end": "E2",
"obstacles": [
"A3",
"C2",
"D2"
],
"shortest_path_length": 4,
"fingerprint": "7289f9b447d0"
} |
86 | 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: D4 | Obstacles (impassable): A5, C1, E4
What is the shortest valid path from E5 to D4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down",
"left, down",
"right, right",
"up, left"
] | 3 | {
"grid_size": 5,
"start": "E5",
"end": "D4",
"obstacles": [
"A5",
"C1",
"E4"
],
"shortest_path_length": 2,
"fingerprint": "58750ae60ed2"
} |
87 | 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: B5 | Obstacles (impassable): B2, C1, D2
What is the shortest valid path from A2 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, left, left, up",
"right, down, right, right",
"down, right, right, right",
"right, right, left, up"
] | 1 | {
"grid_size": 5,
"start": "A2",
"end": "B5",
"obstacles": [
"B2",
"C1",
"D2"
],
"shortest_path_length": 4,
"fingerprint": "0de1ed0a2ba7"
} |
88 | 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: C2 | Goal: C4 | Obstacles (impassable): C3, C5, E4
What is the shortest valid path from C2 to C4? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left, down, right",
"right, right",
"up, right, right, down",
"right, left, left, up"
] | 2 | {
"grid_size": 5,
"start": "C2",
"end": "C4",
"obstacles": [
"C3",
"C5",
"E4"
],
"shortest_path_length": 4,
"fingerprint": "0eab73935bdb"
} |
89 | 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: B1 | Obstacles (impassable): B5, C1, D3
What is the shortest valid path from D5 to B1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, left, up, left, left, left",
"up, up, left, left, left, left",
"right, down, right, left, right, up",
"up, up, left, left, left, right"
] | 0 | {
"grid_size": 5,
"start": "D5",
"end": "B1",
"obstacles": [
"B5",
"C1",
"D3"
],
"shortest_path_length": 6,
"fingerprint": "ee8b04a0ec05"
} |
90 | 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: E1 | Obstacles (impassable): A2, A3, E2
What is the shortest valid path from B4 to E1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, down, left, left, left",
"down, down, left, left, left, down",
"right, left, down, up, down, right",
"up, down, up, down, left, left"
] | 1 | {
"grid_size": 5,
"start": "B4",
"end": "E1",
"obstacles": [
"A2",
"A3",
"E2"
],
"shortest_path_length": 6,
"fingerprint": "b36ca6b27bfa"
} |
91 | 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): C2, C5, E2
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",
"right, left, left, down, up",
"left, right, up, down, left",
"left, up, up, up, right"
] | 3 | {
"grid_size": 5,
"start": "D5",
"end": "A5",
"obstacles": [
"C2",
"C5",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "dfc478e0088f"
} |
92 | 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: D2 | Obstacles (impassable): A4, C3, D3
What is the shortest valid path from D1 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down",
"up",
"right",
"left"
] | 2 | {
"grid_size": 5,
"start": "D1",
"end": "D2",
"obstacles": [
"A4",
"C3",
"D3"
],
"shortest_path_length": 1,
"fingerprint": "0704ab61a15e"
} |
93 | 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: E3 | Obstacles (impassable): A3, C5, E2
What is the shortest valid path from B1 to E3? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, left, down, up",
"left, left, up, left, left",
"down, down, right, right, down",
"down, down, down, right, right"
] | 2 | {
"grid_size": 5,
"start": "B1",
"end": "E3",
"obstacles": [
"A3",
"C5",
"E2"
],
"shortest_path_length": 5,
"fingerprint": "c5fc2a0e51ac"
} |
94 | 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: A1 | Obstacles (impassable): C2, D3, D4
What is the shortest valid path from D1 to A1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"left, right, down",
"up, up, up",
"up, up, left",
"right, right, right"
] | 1 | {
"grid_size": 5,
"start": "D1",
"end": "A1",
"obstacles": [
"C2",
"D3",
"D4"
],
"shortest_path_length": 3,
"fingerprint": "72e9356d0713"
} |
95 | 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: C1 | Obstacles (impassable): A3, C5, E1
What is the shortest valid path from A5 to C1? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"down, down, left, left, left, left",
"down, left, down, left, left, left",
"up, up, down, left, down, down",
"right, left, down, down, down, right"
] | 1 | {
"grid_size": 5,
"start": "A5",
"end": "C1",
"obstacles": [
"A3",
"C5",
"E1"
],
"shortest_path_length": 6,
"fingerprint": "fcd9b1fd6076"
} |
96 | 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: D2 | Obstacles (impassable): A3, B4, B5
What is the shortest valid path from C2 to D2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right",
"up",
"left",
"down"
] | 3 | {
"grid_size": 5,
"start": "C2",
"end": "D2",
"obstacles": [
"A3",
"B4",
"B5"
],
"shortest_path_length": 1,
"fingerprint": "15bd556400bc"
} |
97 | 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: C3 | Goal: B5 | Obstacles (impassable): A3, C5, E3
What is the shortest valid path from C3 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"up, right, right",
"up, down, right",
"down, left, down",
"right, right, right"
] | 0 | {
"grid_size": 5,
"start": "C3",
"end": "B5",
"obstacles": [
"A3",
"C5",
"E3"
],
"shortest_path_length": 3,
"fingerprint": "4db6254a6cdd"
} |
98 | 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: E4 | Goal: C2 | Obstacles (impassable): A5, C3, E5
What is the shortest valid path from E4 to C2? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, up, left, right",
"left, up, left, down",
"up, left, left, up",
"up, up, left, left"
] | 2 | {
"grid_size": 5,
"start": "E4",
"end": "C2",
"obstacles": [
"A5",
"C3",
"E5"
],
"shortest_path_length": 4,
"fingerprint": "74f76937a69b"
} |
99 | 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: B5 | Obstacles (impassable): C3, C4, D5
What is the shortest valid path from A2 to B5? Give your answer as a comma-separated list of directions (up/down/left/right). | [
"right, left, right, up",
"down, down, right, right",
"down, down, left, left",
"down, right, right, right"
] | 3 | {
"grid_size": 5,
"start": "A2",
"end": "B5",
"obstacles": [
"C3",
"C4",
"D5"
],
"shortest_path_length": 4,
"fingerprint": "422cf246cbe6"
} |
End of preview. Expand
in Data Studio
Tractatus-Eval: Spatial Embodied Logic Benchmark
A benchmark for evaluating whether LLMs understand hard physical constraints (walls, obstacles, grid boundaries) that require embodied spatial understanding.
Each sample is a 5×5 grid navigation problem with A*-computed ground truth and physics-engine-validated distractors.
- 1,000 samples | 4 choices each | 0% data contamination
- Compatible with EleutherAI lm-evaluation-harness
GitHub: AlexFlanker/tractatus-eval
- Downloads last month
- 43