Hugging Face's logo

Datasets:
lchen915
/
shortest-path-dataset-problems_seed0_n20000_rows5-6_cols5-6_p0.4

Modalities:
Tabular
Text
Formats:
parquet
Size:
10K - 100K
Libraries:
Datasets
pandas
Polars
Dataset card Data Studio Files
xet
 Community
1
Dataset Viewer
Auto-converted to Parquet Duplicate
question
string
answer
string
grid
list
start
list
dest
list
rows
int64
cols
int64
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X O X O O X X O O O X O O O * X O O O O # X O O X O O If a path exists, return it as a sequence of moves (e...
down
[ [ "O", "O", "X", "X", "O", "X" ], [ "O", "O", "X", "X", "O", "O" ], [ "O", "X", "O", "O", "O", "*" ], [ "X", "O", "O", "O", "O", "#" ], [ "X", "O", "O", "X", "O", "O" ] ]
[ 2, 5 ]
[ 3, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X X O O X O X O X X O O X O X # X O X X O O O O X O O X O O O * O X X If a path exists, return it as a sequence...
right, up, up, right, up
[ [ "X", "X", "X", "O", "O", "X" ], [ "O", "X", "O", "X", "X", "O" ], [ "O", "X", "O", "X", "#", "X" ], [ "O", "X", "X", "O", "O", "O" ], [ "O", "X", "O", "O", "X", "O" ], [ ...
[ 5, 2 ]
[ 2, 4 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # O X O O O X O * O X O O X O X O O X O X X O X O If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "#", "O", "X", "O", "O" ], [ "O", "X", "O", "*", "O" ], [ "X", "O", "O", "X", "O" ], [ "X", "O", "O", "X", "O" ], [ "X", "X", "O", "X", "O" ] ]
[ 1, 3 ]
[ 0, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O X O O O O O X O O O O X * O X X O O O O O O O X O O # X O O O O If a path exists, return it as a sequence...
down, left, left, down, left, left, down
[ [ "O", "O", "O", "O", "X", "O" ], [ "O", "O", "O", "O", "X", "O" ], [ "O", "O", "O", "X", "*", "O" ], [ "X", "X", "O", "O", "O", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ ...
[ 2, 4 ]
[ 5, 0 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * O O X X X O O # O O O O X O X O O X O O O O O O O O X O X O O O O X X If a path exists, return it as a sequence...
right, right, down
[ [ "*", "O", "O", "X", "X", "X" ], [ "O", "O", "#", "O", "O", "O" ], [ "O", "X", "O", "X", "O", "O" ], [ "X", "O", "O", "O", "O", "O" ], [ "O", "O", "O", "X", "O", "X" ], [ ...
[ 0, 0 ]
[ 1, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X X X X X X O O X O X X O O X O O O X X X O X * # X O If a path exists, return it as a sequence of moves (e...
right
[ [ "X", "O", "O", "X", "X" ], [ "X", "X", "X", "X", "O" ], [ "O", "X", "O", "X", "X" ], [ "O", "O", "X", "O", "O" ], [ "O", "X", "X", "X", "O" ], [ "X", "*", "#", "X", "O" ] ]
[ 5, 1 ]
[ 5, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O * O O X O X O X # X X O O O O O O X O X O O O X X X O O O If a path exists, return it as a sequence of moves (e...
right, right, down
[ [ "O", "*", "O", "O", "X", "O" ], [ "X", "O", "X", "#", "X", "X" ], [ "O", "O", "O", "O", "O", "O" ], [ "X", "O", "X", "O", "O", "O" ], [ "X", "X", "X", "O", "O", "O" ] ]
[ 0, 1 ]
[ 1, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X O O X X O * O O X X O X X X O X X O # X O O If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "O", "X", "X", "O", "O" ], [ "X", "X", "O", "*", "O" ], [ "O", "X", "X", "O", "X" ], [ "X", "X", "O", "X", "X" ], [ "O", "#", "X", "O", "O" ] ]
[ 1, 3 ]
[ 4, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X O O X O O O X O O O O X X X X # O O X O X X O O O O If a path exists, return it as a sequence of moves (e...
[ [ "X", "O", "O", "X", "O", "O" ], [ "X", "O", "O", "O", "X", "O" ], [ "O", "O", "O", "X", "X", "X" ], [ "X", "#", "O", "O", "X", "O" ], [ "X", "X", "O", "O", "O", "O" ] ]
[ 3, 1 ]
[ 3, 1 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X O O * O O X O O O X O # O O O O O O O O O If a path exists, return it as a sequence of moves (e.g., "righ...
down, down, left
[ [ "O", "O", "X", "X", "O" ], [ "O", "*", "O", "O", "X" ], [ "O", "O", "O", "X", "O" ], [ "#", "O", "O", "O", "O" ], [ "O", "O", "O", "O", "O" ] ]
[ 1, 1 ]
[ 3, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X X X X O O X # X O O X O X O O O X O O O * O O O X O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "O", "O", "X", "X" ], [ "X", "X", "O", "O", "X" ], [ "#", "X", "O", "O", "X" ], [ "O", "X", "O", "O", "O" ], [ "X", "O", "O", "O", "*" ], [ "O", "O", "O", "X", "O" ] ]
[ 4, 4 ]
[ 2, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X O O O X O O O X X O O O O X * X O X O X # X X X X X X O X O X O If a path exists, return it as a sequence...
down
[ [ "O", "O", "X", "X", "O", "O" ], [ "O", "X", "O", "O", "O", "X" ], [ "X", "O", "O", "O", "O", "X" ], [ "*", "X", "O", "X", "O", "X" ], [ "#", "X", "X", "X", "X", "X" ], [ ...
[ 3, 0 ]
[ 4, 0 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X O O X O O X X X # X X O O * X X O O O X O X X O O X X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "X", "O", "O", "X" ], [ "O", "O", "X", "X", "X", "#" ], [ "X", "X", "O", "O", "*", "X" ], [ "X", "O", "O", "O", "X", "O" ], [ "X", "X", "O", "O", "X", "X" ] ]
[ 2, 4 ]
[ 1, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X X O X X O O X O X X # O X X * O O O O O X X O O O X O X X X O O If a path exists, return it as a sequence...
right, right, up
[ [ "X", "O", "O", "X", "X", "O" ], [ "X", "X", "O", "O", "X", "O" ], [ "X", "X", "#", "O", "X", "X" ], [ "*", "O", "O", "O", "O", "O" ], [ "X", "X", "O", "O", "O", "X" ], [ ...
[ 3, 0 ]
[ 2, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O * # X O O O O O X X O O X X O X O X X X O X X O X O O O O If a path exists, return it as a sequence of moves (e...
right
[ [ "O", "*", "#", "X", "O", "O" ], [ "O", "O", "O", "X", "X", "O" ], [ "O", "X", "X", "O", "X", "O" ], [ "X", "X", "X", "O", "X", "X" ], [ "O", "X", "O", "O", "O", "O" ] ]
[ 0, 1 ]
[ 0, 2 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O O O X X O O X O X X X X # O O * X X X O X If a path exists, return it as a sequence of moves (e.g., "righ...
left, left, left
[ [ "O", "X", "O", "O", "O" ], [ "O", "X", "X", "O", "O" ], [ "X", "O", "X", "X", "X" ], [ "X", "#", "O", "O", "*" ], [ "X", "X", "X", "O", "X" ] ]
[ 3, 4 ]
[ 3, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O * O O O O O X O O X O X O O X O O X O X # X X X O X X O X If a path exists, return it as a sequence of moves (e...
down, down, down, down
[ [ "O", "*", "O", "O", "O" ], [ "O", "O", "X", "O", "O" ], [ "X", "O", "X", "O", "O" ], [ "X", "O", "O", "X", "O" ], [ "X", "#", "X", "X", "X" ], [ "O", "X", "X", "O", "X" ] ]
[ 0, 1 ]
[ 4, 1 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O O X O X O X X O O X X O O O O O X X X O # O O X * X X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "O", "O", "X", "O" ], [ "X", "O", "X", "X", "O", "O" ], [ "X", "X", "O", "O", "O", "O" ], [ "O", "X", "X", "X", "O", "#" ], [ "O", "O", "X", "*", "X", "X" ] ]
[ 4, 3 ]
[ 3, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O O X O X X O X O # O X O O X O X O * O X X O X O O O O X X X O O O If a path exists, return it as a sequence...
infeasible
[ [ "X", "X", "O", "O", "X", "O" ], [ "X", "X", "O", "X", "O", "#" ], [ "O", "X", "O", "O", "X", "O" ], [ "X", "O", "*", "O", "X", "X" ], [ "O", "X", "O", "O", "O", "O" ], [ ...
[ 3, 2 ]
[ 1, 5 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O X O O O X # O X * X O X O O X O O X O X O X X X O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "X", "O", "X", "O" ], [ "O", "O", "X", "#", "O" ], [ "X", "*", "X", "O", "X" ], [ "O", "O", "X", "O", "O" ], [ "X", "O", "X", "O", "X" ], [ "X", "X", "O", "O", "X" ] ]
[ 2, 1 ]
[ 1, 3 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X # O O O O O O X X O O O X * X X X O O O O O O X O O X If a path exists, return it as a sequence of moves (e...
down, left, left, up, up, right, up
[ [ "O", "O", "X", "#", "O", "O" ], [ "O", "O", "O", "O", "X", "X" ], [ "O", "O", "O", "X", "*", "X" ], [ "X", "X", "O", "O", "O", "O" ], [ "O", "O", "X", "O", "O", "X" ] ]
[ 2, 4 ]
[ 0, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * X O O X X O O X O X O O O O O X # O O O O X O O X O O O O If a path exists, return it as a sequence of moves (e...
down, right, down, right, right, down, down, right, right, up, up
[ [ "*", "X", "O", "O", "X", "X" ], [ "O", "O", "X", "O", "X", "O" ], [ "O", "O", "O", "O", "X", "#" ], [ "O", "O", "O", "O", "X", "O" ], [ "O", "X", "O", "O", "O", "O" ] ]
[ 0, 0 ]
[ 2, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X O O # O * X O X O O O O O X X X O X O O O If a path exists, return it as a sequence of moves (e.g., "righ...
left, left
[ [ "O", "O", "X", "X", "O" ], [ "O", "#", "O", "*", "X" ], [ "O", "X", "O", "O", "O" ], [ "O", "O", "X", "X", "X" ], [ "O", "X", "O", "O", "O" ] ]
[ 1, 3 ]
[ 1, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X X O O X X O O O O X X X # O X X X O O O X If a path exists, return it as a sequence of moves (e.g., "righ...
[ [ "O", "O", "O", "X", "X" ], [ "O", "O", "X", "X", "O" ], [ "O", "O", "O", "X", "X" ], [ "X", "#", "O", "X", "X" ], [ "X", "O", "O", "O", "X" ] ]
[ 3, 1 ]
[ 3, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X O X O X O X X O O X X O O X X O O X O X O O O O X O X * O X X # If a path exists, return it as a sequence...
infeasible
[ [ "O", "O", "X", "X", "O", "X" ], [ "O", "X", "O", "X", "X", "O" ], [ "O", "X", "X", "O", "O", "X" ], [ "X", "O", "O", "X", "O", "X" ], [ "O", "O", "O", "O", "X", "O" ], [ ...
[ 5, 1 ]
[ 5, 5 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O X O O O X X O O O O O O O X X X X O X X X * X # X O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "X", "O", "O", "X", "O" ], [ "O", "O", "X", "X", "O", "O" ], [ "O", "O", "O", "O", "O", "X" ], [ "X", "X", "X", "O", "X", "X" ], [ "X", "*", "X", "#", "X", "O" ] ]
[ 4, 1 ]
[ 4, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X O O O * X O X O O X X X X X X X X O X X # If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "X", "O", "O", "X", "O" ], [ "O", "O", "*", "X", "O" ], [ "X", "O", "O", "X", "X" ], [ "X", "X", "X", "X", "X" ], [ "X", "O", "X", "X", "#" ] ]
[ 1, 2 ]
[ 4, 4 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O O # O O X X X O O O O O O O X O X O O X X X X X X X * If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "X", "O", "O", "#", "O" ], [ "O", "X", "X", "X", "O", "O" ], [ "O", "O", "O", "O", "O", "X" ], [ "O", "X", "O", "O", "X", "X" ], [ "X", "X", "X", "X", "X", "*" ] ]
[ 4, 5 ]
[ 0, 4 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O # O O X X O X X X X X X O X O X O O O O X O O O X * X X O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "#", "O", "O", "X", "X" ], [ "O", "X", "X", "X", "X", "X" ], [ "X", "O", "X", "O", "X", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "O", "X", "*", "X", "X", "O" ] ]
[ 4, 2 ]
[ 0, 1 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O X X O X O X X O X O X # X * O X X O X O X If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "O", "O", "O", "O", "X" ], [ "X", "O", "X", "O", "X" ], [ "X", "O", "X", "O", "X" ], [ "#", "X", "*", "O", "X" ], [ "X", "O", "X", "O", "X" ] ]
[ 3, 2 ]
[ 3, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X O O X O X X X X X X X O X O X X X O X * # O O O O O O O O O O O O If a path exists, return it as a sequence...
right
[ [ "O", "O", "X", "O", "O", "X" ], [ "O", "X", "X", "X", "X", "X" ], [ "X", "X", "O", "X", "O", "X" ], [ "X", "X", "O", "X", "*", "#" ], [ "O", "O", "O", "O", "O", "O" ], [ ...
[ 3, 4 ]
[ 3, 5 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O X X O O O O O O X X O O X X X O * O O O X # O O O O If a path exists, return it as a sequence of moves (e...
down
[ [ "O", "X", "O", "O", "X" ], [ "X", "O", "O", "O", "O" ], [ "O", "O", "X", "X", "O" ], [ "O", "X", "X", "X", "O" ], [ "*", "O", "O", "O", "X" ], [ "#", "O", "O", "O", "O" ] ]
[ 4, 0 ]
[ 5, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O # X O O X * O O X X O O O O X X O O O X O O O O O O X O O O O X O O If a path exists, return it as a sequence...
right, up
[ [ "O", "O", "#", "X", "O", "O" ], [ "X", "*", "O", "O", "X", "X" ], [ "O", "O", "O", "O", "X", "X" ], [ "O", "O", "O", "X", "O", "O" ], [ "O", "O", "O", "O", "X", "O" ], [ ...
[ 1, 1 ]
[ 0, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O O X # O O O O X O O O X X O X * O X X X O X X X O X X X X X X X X If a path exists, return it as a sequence...
infeasible
[ [ "X", "X", "O", "O", "X", "#" ], [ "O", "O", "O", "O", "X", "O" ], [ "O", "O", "X", "X", "O", "X" ], [ "*", "O", "X", "X", "X", "O" ], [ "X", "X", "X", "O", "X", "X" ], [ ...
[ 3, 0 ]
[ 0, 5 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O * O O X O O X O O # O O O O O X O X O O X O X X O O X O O O O O O If a path exists, return it as a sequence...
left, down, down, left, left
[ [ "X", "X", "O", "*", "O", "O" ], [ "X", "O", "O", "X", "O", "O" ], [ "#", "O", "O", "O", "O", "O" ], [ "X", "O", "X", "O", "O", "X" ], [ "O", "X", "X", "O", "O", "X" ], [ ...
[ 0, 3 ]
[ 2, 0 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X X O O X O O X O X O * X O # O O X X O X O If a path exists, return it as a sequence of moves (e.g., "righ...
down, left, left
[ [ "X", "O", "O", "X", "X" ], [ "O", "O", "X", "O", "O" ], [ "X", "O", "X", "O", "*" ], [ "X", "O", "#", "O", "O" ], [ "X", "X", "O", "X", "O" ] ]
[ 2, 4 ]
[ 3, 2 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O # O O O X X X X O O O O O X X O X O O O X * X O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "X", "O", "O", "#" ], [ "O", "O", "O", "X", "X" ], [ "X", "X", "O", "O", "O" ], [ "O", "O", "X", "X", "O" ], [ "X", "O", "O", "O", "X" ], [ "*", "X", "O", "O", "X" ] ]
[ 5, 0 ]
[ 0, 4 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O X O O X O X # O O O X X O * X X O O X O X O O O X X If a path exists, return it as a sequence of moves (e...
left, up, left
[ [ "O", "X", "O", "O", "X" ], [ "O", "O", "X", "O", "X" ], [ "#", "O", "O", "O", "X" ], [ "X", "O", "*", "X", "X" ], [ "O", "O", "X", "O", "X" ], [ "O", "O", "O", "X", "X" ] ]
[ 3, 2 ]
[ 2, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O O # X O X X X O O O O O O X X O X X X O * If a path exists, return it as a sequence of moves (e.g., "righ...
up, up, left, left, up, up, left, left, down
[ [ "O", "O", "O", "O", "O" ], [ "#", "X", "O", "X", "X" ], [ "X", "O", "O", "O", "O" ], [ "O", "O", "X", "X", "O" ], [ "X", "X", "X", "O", "*" ] ]
[ 4, 4 ]
[ 1, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O # O O X * O O O O O O O O O X O O O O O O X X X X O X X O O O X O X X If a path exists, return it as a sequence...
down, left, left, left, left, up
[ [ "O", "#", "O", "O", "X", "*" ], [ "O", "O", "O", "O", "O", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "O", "O", "O", "O", "X", "X" ], [ "X", "X", "O", "X", "X", "O" ], [ ...
[ 0, 5 ]
[ 0, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X X O O O O X * X O O X X O X O X # O O O O If a path exists, return it as a sequence of moves (e.g., "righ...
up, right, right, right, down, down, down, left, left, left
[ [ "O", "O", "O", "X", "X" ], [ "O", "O", "O", "O", "X" ], [ "*", "X", "O", "O", "X" ], [ "X", "O", "X", "O", "X" ], [ "#", "O", "O", "O", "O" ] ]
[ 2, 0 ]
[ 4, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X X O O O X X # O * O X X O X X X X O O X X O O O O X O If a path exists, return it as a sequence of moves (e...
left, left
[ [ "O", "X", "X", "X", "O", "O" ], [ "O", "X", "X", "#", "O", "*" ], [ "O", "X", "X", "O", "X", "X" ], [ "X", "X", "O", "O", "X", "X" ], [ "O", "O", "O", "O", "X", "O" ] ]
[ 1, 5 ]
[ 1, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O * O O O O X # O O O X O O X O X X X X X O O O O X O X O If a path exists, return it as a sequence of moves (e...
down
[ [ "O", "O", "*", "O", "O", "O" ], [ "O", "X", "#", "O", "O", "O" ], [ "X", "O", "O", "X", "O", "X" ], [ "X", "X", "X", "X", "O", "O" ], [ "O", "O", "X", "O", "X", "O" ] ]
[ 0, 2 ]
[ 1, 2 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X X * O O O O O X # X O O X X O O O X O O O O If a path exists, return it as a sequence of moves (e.g., "righ...
down, left, left, left, down
[ [ "O", "X", "X", "X", "*" ], [ "O", "O", "O", "O", "O" ], [ "X", "#", "X", "O", "O" ], [ "X", "X", "O", "O", "O" ], [ "X", "O", "O", "O", "O" ] ]
[ 0, 4 ]
[ 2, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O X X O O O X * O X X O O O O O O X X X X O O O O # O X If a path exists, return it as a sequence of moves (e...
down, left, down, down, down, left
[ [ "O", "X", "O", "X", "X" ], [ "O", "O", "O", "X", "*" ], [ "O", "X", "X", "O", "O" ], [ "O", "O", "O", "O", "X" ], [ "X", "X", "X", "O", "O" ], [ "O", "O", "#", "O", "X" ] ]
[ 1, 4 ]
[ 5, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O # X X O X X O O X X O X O O O X O O X O O * X If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "X", "O", "#", "X", "X" ], [ "O", "X", "X", "O", "O" ], [ "X", "X", "O", "X", "O" ], [ "O", "O", "X", "O", "O" ], [ "X", "O", "O", "*", "X" ] ]
[ 4, 3 ]
[ 0, 2 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X O O O X X O O O # O O O X O O O O O O O O O O O O O X If a path exists, return it as a sequence of moves (e...
[ [ "O", "X", "X", "O", "O" ], [ "O", "X", "X", "O", "O" ], [ "O", "#", "O", "O", "O" ], [ "X", "O", "O", "O", "O" ], [ "O", "O", "O", "O", "O" ], [ "O", "O", "O", "O", "X" ] ]
[ 2, 1 ]
[ 2, 1 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X O O O X X O X O # O O O X O O O X * O O X If a path exists, return it as a sequence of moves (e.g., "righ...
right, up, up
[ [ "X", "O", "O", "X", "O" ], [ "O", "O", "X", "X", "O" ], [ "X", "O", "#", "O", "O" ], [ "O", "X", "O", "O", "O" ], [ "X", "*", "O", "O", "X" ] ]
[ 4, 1 ]
[ 2, 2 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X O X O O O X O O X O # X O X X O O O O X X X X X O O O X O X O O If a path exists, return it as a sequence...
[ [ "O", "O", "O", "X", "O", "X" ], [ "O", "O", "O", "X", "O", "O" ], [ "X", "O", "#", "X", "O", "X" ], [ "X", "O", "O", "O", "O", "X" ], [ "X", "X", "X", "X", "O", "O" ], [ ...
[ 2, 2 ]
[ 2, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X O O X X O X O X X X X O X X O O O O O X X O X O O O O * O X # O O If a path exists, return it as a sequence...
up, up, right, right, right, down, down
[ [ "O", "X", "X", "O", "O", "X" ], [ "X", "O", "X", "O", "X", "X" ], [ "X", "X", "O", "X", "X", "O" ], [ "O", "O", "O", "O", "X", "X" ], [ "O", "X", "O", "O", "O", "O" ], [ ...
[ 5, 0 ]
[ 5, 3 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X # X O X O X X X X O O O X O X O X X O * X O O O X X O O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "X", "#", "X", "O", "X" ], [ "O", "X", "X", "X", "X", "O" ], [ "O", "O", "X", "O", "X", "O" ], [ "X", "X", "O", "*", "X", "O" ], [ "O", "O", "X", "X", "O", "O" ] ]
[ 3, 3 ]
[ 0, 2 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X O O X X O X * O O O O O X X O O # O X X X X If a path exists, return it as a sequence of moves (e.g., "righ...
down, down
[ [ "X", "O", "X", "O", "O" ], [ "X", "X", "O", "X", "*" ], [ "O", "O", "O", "O", "O" ], [ "X", "X", "O", "O", "#" ], [ "O", "X", "X", "X", "X" ] ]
[ 1, 4 ]
[ 3, 4 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O # O O X X O O O O O X O O X O O X O O O O X O X O * O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "#", "O", "O" ], [ "X", "X", "O", "O", "O" ], [ "O", "O", "X", "O", "O" ], [ "X", "O", "O", "X", "O" ], [ "O", "O", "O", "X", "O" ], [ "X", "O", "*", "O", "X" ] ]
[ 5, 2 ]
[ 0, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * O O O X X O # O O X X O O X O O O O X X X O X X If a path exists, return it as a sequence of moves (e.g., "righ...
right, right, down
[ [ "*", "O", "O", "O", "X" ], [ "X", "O", "#", "O", "O" ], [ "X", "X", "O", "O", "X" ], [ "O", "O", "O", "O", "X" ], [ "X", "X", "O", "X", "X" ] ]
[ 0, 0 ]
[ 1, 2 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X * O X O O O X X O X X O O X X O X O O X X O X X O X O # If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "X", "*", "O", "X", "O" ], [ "O", "O", "X", "X", "O", "X" ], [ "X", "O", "O", "X", "X", "O" ], [ "X", "O", "O", "X", "X", "O" ], [ "X", "X", "O", "X", "O", "#" ] ]
[ 0, 2 ]
[ 4, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # X O O X X O X X O O O O O O X X X O O O X O O X O * X X O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "#", "X", "O", "O", "X" ], [ "X", "O", "X", "X", "O" ], [ "O", "O", "O", "O", "O" ], [ "X", "X", "X", "O", "O" ], [ "O", "X", "O", "O", "X" ], [ "O", "*", "X", "X", "O" ] ]
[ 5, 1 ]
[ 0, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O # O O O X O O * O X O X X X X X O O X X X O X X X X O O O O O X O If a path exists, return it as a sequence...
left, up
[ [ "X", "X", "O", "#", "O", "O" ], [ "O", "X", "O", "O", "*", "O" ], [ "X", "O", "X", "X", "X", "X" ], [ "X", "O", "O", "X", "X", "X" ], [ "O", "X", "X", "X", "X", "O" ], [ ...
[ 1, 4 ]
[ 0, 3 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X X O O O X O X O O O O * O X # X O X X X X O X X O O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "X", "X", "O", "O", "O" ], [ "X", "O", "X", "O", "O", "O" ], [ "O", "*", "O", "X", "#", "X" ], [ "O", "X", "X", "X", "X", "O" ], [ "X", "X", "O", "O", "O", "X" ] ]
[ 2, 1 ]
[ 2, 4 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X X O X O O O X O # X O X O * X O X O O X O O If a path exists, return it as a sequence of moves (e.g., "righ...
up
[ [ "X", "O", "X", "X", "O" ], [ "X", "O", "O", "O", "X" ], [ "O", "#", "X", "O", "X" ], [ "O", "*", "X", "O", "X" ], [ "O", "O", "X", "O", "O" ] ]
[ 3, 1 ]
[ 2, 1 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X X O O X O O O O O O O O * O O O # X O O O O O O X O O O X O X X If a path exists, return it as a sequence...
left, left, down
[ [ "O", "O", "X", "X", "X", "O" ], [ "O", "X", "O", "O", "O", "O" ], [ "O", "O", "O", "O", "*", "O" ], [ "O", "O", "#", "X", "O", "O" ], [ "O", "O", "O", "O", "X", "O" ], [ ...
[ 2, 4 ]
[ 3, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X * X O X O X X O X O X X O O O X X X X X # O O O X O O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "X", "*", "X" ], [ "O", "X", "O", "X", "X" ], [ "O", "X", "O", "X", "X" ], [ "O", "O", "O", "X", "X" ], [ "X", "X", "X", "#", "O" ], [ "O", "O", "X", "O", "O" ] ]
[ 0, 3 ]
[ 4, 3 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O X O O X X O O X X X O O O X O X * # O O O O O X X O O O O O X O If a path exists, return it as a sequence...
right
[ [ "O", "X", "O", "O", "X", "O" ], [ "O", "X", "X", "O", "O", "X" ], [ "X", "X", "O", "O", "O", "X" ], [ "O", "X", "*", "#", "O", "O" ], [ "O", "O", "O", "X", "X", "O" ], [ ...
[ 3, 2 ]
[ 3, 3 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X X O O O X O O X X X X O X * O O O X X O # X O O O O X O If a path exists, return it as a sequence of moves (e...
right, down
[ [ "X", "X", "X", "O", "O", "O" ], [ "X", "O", "O", "X", "X", "X" ], [ "X", "O", "X", "*", "O", "O" ], [ "O", "X", "X", "O", "#", "X" ], [ "O", "O", "O", "O", "X", "O" ] ]
[ 2, 3 ]
[ 3, 4 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O X O X O O O O O O X O X * X O O X O X X O # If a path exists, return it as a sequence of moves (e.g., "righ...
up, right, up, right, right, down, down, down, right
[ [ "X", "X", "O", "X", "O" ], [ "X", "O", "O", "O", "O" ], [ "O", "O", "X", "O", "X" ], [ "*", "X", "O", "O", "X" ], [ "O", "X", "X", "O", "#" ] ]
[ 3, 0 ]
[ 4, 4 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X X X X O X X O X O O O X X * O # O O X O X O X O O O X X If a path exists, return it as a sequence of moves (e...
right, right
[ [ "O", "X", "X", "X", "X" ], [ "O", "X", "X", "O", "X" ], [ "O", "O", "O", "X", "X" ], [ "*", "O", "#", "O", "O" ], [ "X", "O", "X", "O", "X" ], [ "O", "O", "O", "X", "X" ] ]
[ 3, 0 ]
[ 3, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X O O O O X O X X O X X O X O * O # O X X O X O O O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "X", "O", "O", "O" ], [ "O", "X", "O", "X", "X", "O" ], [ "X", "X", "O", "X", "O", "*" ], [ "O", "#", "O", "X", "X", "O" ], [ "X", "O", "O", "O", "O", "X" ] ]
[ 2, 5 ]
[ 3, 1 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O O O O O O O X O X * O O # O O X O X X X O O If a path exists, return it as a sequence of moves (e.g., "righ...
down, left, left
[ [ "O", "X", "O", "O", "O" ], [ "O", "O", "O", "O", "X" ], [ "O", "X", "*", "O", "O" ], [ "#", "O", "O", "X", "O" ], [ "X", "X", "X", "O", "O" ] ]
[ 2, 2 ]
[ 3, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X X O O O X X X O O O O O O O X X # O X * X O O O O O If a path exists, return it as a sequence of moves (e...
down, left, left, left, up
[ [ "O", "O", "X", "X", "X" ], [ "O", "O", "O", "X", "X" ], [ "X", "O", "O", "O", "O" ], [ "O", "O", "O", "X", "X" ], [ "#", "O", "X", "*", "X" ], [ "O", "O", "O", "O", "O" ] ]
[ 4, 3 ]
[ 4, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O X X X * O O X O O O X O O O O X O X O O X O X O O O O X # X X O If a path exists, return it as a sequence...
infeasible
[ [ "O", "O", "O", "O", "X", "X" ], [ "X", "*", "O", "O", "X", "O" ], [ "O", "O", "X", "O", "O", "O" ], [ "O", "X", "O", "X", "O", "O" ], [ "X", "O", "X", "O", "O", "O" ], [ ...
[ 1, 1 ]
[ 5, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X * X O X O # O X O X X X O O X X X X O O X O O O O O O X If a path exists, return it as a sequence of moves (e...
down
[ [ "O", "X", "*", "X", "O" ], [ "X", "O", "#", "O", "X" ], [ "O", "X", "X", "X", "O" ], [ "O", "X", "X", "X", "X" ], [ "O", "O", "X", "O", "O" ], [ "O", "O", "O", "O", "X" ] ]
[ 0, 2 ]
[ 1, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X O O O O O X X O * X X O X X O O O # O O O O O O X O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "O", "X", "O", "O" ], [ "O", "O", "O", "X", "X" ], [ "O", "*", "X", "X", "O" ], [ "X", "X", "O", "O", "O" ], [ "#", "O", "O", "O", "O" ], [ "O", "O", "X", "O", "X" ] ]
[ 2, 1 ]
[ 4, 0 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X O O X O O O O X X X O X O * X X X O O O O X X X O # O If a path exists, return it as a sequence of moves (e...
down, down
[ [ "O", "O", "X", "O", "O", "X" ], [ "O", "O", "O", "O", "X", "X" ], [ "X", "O", "X", "O", "*", "X" ], [ "X", "X", "O", "O", "O", "O" ], [ "X", "X", "X", "O", "#", "O" ] ]
[ 2, 4 ]
[ 4, 4 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * O # O O O X O O O X X O O O X X O O O O O X O O O X O O O If a path exists, return it as a sequence of moves (e...
right, right
[ [ "*", "O", "#", "O", "O" ], [ "O", "X", "O", "O", "O" ], [ "X", "X", "O", "O", "O" ], [ "X", "X", "O", "O", "O" ], [ "O", "O", "X", "O", "O" ], [ "O", "X", "O", "O", "O" ] ]
[ 0, 0 ]
[ 0, 2 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O * O O X O O X X O X X O O X O O O X O # O O O O O O X X O If a path exists, return it as a sequence of moves (e...
right, right, down, down, down, left
[ [ "O", "*", "O", "O", "X", "O" ], [ "O", "X", "X", "O", "X", "X" ], [ "O", "O", "X", "O", "O", "O" ], [ "X", "O", "#", "O", "O", "O" ], [ "O", "O", "O", "X", "X", "O" ] ]
[ 0, 1 ]
[ 3, 2 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X O O X X O X X O O X X O O X O O X O O X X X X X * X # If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "O", "X", "O", "O", "X" ], [ "X", "O", "X", "X", "O", "O" ], [ "X", "X", "O", "O", "X", "O" ], [ "O", "X", "O", "O", "X", "X" ], [ "X", "X", "X", "*", "X", "#" ] ]
[ 4, 3 ]
[ 4, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O X X X O * X O O O X X # O O X O O O O O O O X X X X O O X X X X O O If a path exists, return it as a sequence...
infeasible
[ [ "O", "O", "X", "X", "X", "O" ], [ "*", "X", "O", "O", "O", "X" ], [ "X", "#", "O", "O", "X", "O" ], [ "O", "O", "O", "O", "O", "O" ], [ "X", "X", "X", "X", "O", "O" ], [ ...
[ 1, 0 ]
[ 2, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O X X O O # X X O X X O O O X O O O X O X O * O X X O If a path exists, return it as a sequence of moves (e...
right, up, up, up
[ [ "O", "O", "O", "O", "X", "X" ], [ "O", "O", "#", "X", "X", "O" ], [ "X", "X", "O", "O", "O", "X" ], [ "O", "O", "O", "X", "O", "X" ], [ "O", "*", "O", "X", "X", "O" ] ]
[ 4, 1 ]
[ 1, 2 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X O O O O X O O O X X # O O X X O O X O X X X * O X X X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "O", "X", "O", "O" ], [ "O", "O", "X", "O", "O" ], [ "O", "X", "X", "#", "O" ], [ "O", "X", "X", "O", "O" ], [ "X", "O", "X", "X", "X" ], [ "*", "O", "X", "X", "X" ] ]
[ 5, 0 ]
[ 2, 3 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O O O X X X O X O O O O X O O X O O X X O X X # X O X O X X * X X O If a path exists, return it as a sequence...
infeasible
[ [ "X", "O", "O", "O", "O", "X" ], [ "X", "X", "O", "X", "O", "O" ], [ "O", "O", "X", "O", "O", "X" ], [ "O", "O", "X", "X", "O", "X" ], [ "X", "#", "X", "O", "X", "O" ], [ ...
[ 5, 2 ]
[ 4, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # X O X O O X X X O O O O O O X O X O X O O O X O If a path exists, return it as a sequence of moves (e.g., "righ...
[ [ "#", "X", "O", "X", "O" ], [ "O", "X", "X", "X", "O" ], [ "O", "O", "O", "O", "O" ], [ "X", "O", "X", "O", "X" ], [ "O", "O", "O", "X", "O" ] ]
[ 0, 0 ]
[ 0, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * X O # O O O O X O X X X X X O O O O O O X O O O X X O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "*", "X", "O", "#", "O", "O" ], [ "O", "O", "X", "O", "X", "X" ], [ "X", "X", "X", "O", "O", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "O", "X", "X", "O", "O", "X" ] ]
[ 0, 0 ]
[ 0, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X O X O O X O X O O O X O * O O O O O O # O O O X O X If a path exists, return it as a sequence of moves (e...
right, right, down
[ [ "X", "O", "O", "X", "O" ], [ "X", "O", "O", "X", "O" ], [ "X", "O", "O", "O", "X" ], [ "O", "*", "O", "O", "O" ], [ "O", "O", "O", "#", "O" ], [ "O", "O", "X", "O", "X" ] ]
[ 3, 1 ]
[ 4, 3 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X O X * O O # X O X O X O O X X O X O X X O X X If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "O", "X", "O", "X", "*" ], [ "O", "O", "#", "X", "O" ], [ "X", "O", "X", "O", "O" ], [ "X", "X", "O", "X", "O" ], [ "X", "X", "O", "X", "X" ] ]
[ 0, 4 ]
[ 1, 2 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X O O O O # O O O X X O * O O X O O O O O O O O O O O If a path exists, return it as a sequence of moves (e...
right, up, up, right, right
[ [ "O", "O", "O", "X", "O" ], [ "O", "O", "O", "#", "O" ], [ "O", "O", "X", "X", "O" ], [ "*", "O", "O", "X", "O" ], [ "O", "O", "O", "O", "O" ], [ "O", "O", "O", "O", "O" ] ]
[ 3, 0 ]
[ 1, 3 ]
6
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: * # X O O X O X X X X X O O O O X O O O O X O O X O O O O X O O X O O O If a path exists, return it as a sequence...
right
[ [ "*", "#", "X", "O", "O", "X" ], [ "O", "X", "X", "X", "X", "X" ], [ "O", "O", "O", "O", "X", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "X", "O", "O", "O", "O", "X" ], [ ...
[ 0, 0 ]
[ 0, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X * X X O O X O O X O O X O O X X O # X X O O O X X O X O O O X X O X O If a path exists, return it as a sequence...
infeasible
[ [ "X", "*", "X", "X", "O", "O" ], [ "X", "O", "O", "X", "O", "O" ], [ "X", "O", "O", "X", "X", "O" ], [ "#", "X", "X", "O", "O", "O" ], [ "X", "X", "O", "X", "O", "O" ], [ ...
[ 0, 1 ]
[ 3, 0 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X X # O X X O O O O O O * O X X O O O O X O O X X O O O X If a path exists, return it as a sequence of moves (e...
right, up, right, up
[ [ "X", "X", "X", "#", "O", "X" ], [ "X", "O", "O", "O", "O", "O" ], [ "O", "*", "O", "X", "X", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "X", "X", "O", "O", "O", "X" ] ]
[ 2, 1 ]
[ 0, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # O X X X X X X O X O X O X O X X X O X X O O O O O * O O X O X O O O O If a path exists, return it as a sequence...
infeasible
[ [ "#", "O", "X", "X", "X", "X" ], [ "X", "X", "O", "X", "O", "X" ], [ "O", "X", "O", "X", "X", "X" ], [ "O", "X", "X", "O", "O", "O" ], [ "O", "O", "*", "O", "O", "X" ], [ ...
[ 4, 2 ]
[ 0, 0 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O X O X X X * X X # X O X X X O X O X X O X O O O O O X If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "O", "O", "O", "X", "O", "X" ], [ "X", "X", "*", "X", "X", "#" ], [ "X", "O", "X", "X", "X", "O" ], [ "X", "O", "X", "X", "O", "X" ], [ "O", "O", "O", "O", "O", "X" ] ]
[ 1, 2 ]
[ 1, 5 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # O O X O * O X O O X X O O O O X O X O X X O O X X O X O O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "#", "O", "O", "X", "O", "*" ], [ "O", "X", "O", "O", "X", "X" ], [ "O", "O", "O", "O", "X", "O" ], [ "X", "O", "X", "X", "O", "O" ], [ "X", "X", "O", "X", "O", "O" ] ]
[ 0, 5 ]
[ 0, 0 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O O X X O X X O X X O X O O X X O * # O O O X O X O O O O O O X O X X If a path exists, return it as a sequence...
right
[ [ "X", "O", "O", "X", "X", "O" ], [ "X", "X", "O", "X", "X", "O" ], [ "X", "O", "O", "X", "X", "O" ], [ "*", "#", "O", "O", "O", "X" ], [ "O", "X", "O", "O", "O", "O" ], [ ...
[ 3, 0 ]
[ 3, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O * X O O O O O X O O O X X O O X O X O # X X O X X X O O O X X O X O If a path exists, return it as a sequence...
infeasible
[ [ "O", "O", "*", "X", "O", "O" ], [ "O", "O", "O", "X", "O", "O" ], [ "O", "X", "X", "O", "O", "X" ], [ "O", "X", "O", "#", "X", "X" ], [ "O", "X", "X", "X", "O", "O" ], [ ...
[ 0, 2 ]
[ 3, 3 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O X X X O O O O X X O O X # O X O X O * O O X X X X O X O X O O X If a path exists, return it as a sequence...
up
[ [ "O", "O", "O", "O", "X", "X" ], [ "X", "O", "O", "O", "O", "X" ], [ "X", "O", "O", "X", "#", "O" ], [ "X", "O", "X", "O", "*", "O" ], [ "O", "X", "X", "X", "X", "O" ], [ ...
[ 3, 4 ]
[ 2, 4 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # X X O X O O O X O O X X X X X X X O O O O X * O If a path exists, return it as a sequence of moves (e.g., "righ...
infeasible
[ [ "#", "X", "X", "O", "X" ], [ "O", "O", "O", "X", "O" ], [ "O", "X", "X", "X", "X" ], [ "X", "X", "X", "O", "O" ], [ "O", "O", "X", "*", "O" ] ]
[ 4, 3 ]
[ 0, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O X * # X O O O O O X O X O O O X X X O X O O O X If a path exists, return it as a sequence of moves (e.g., "righ...
right
[ [ "O", "X", "*", "#", "X" ], [ "O", "O", "O", "O", "O" ], [ "X", "O", "X", "O", "O" ], [ "O", "X", "X", "X", "O" ], [ "X", "O", "O", "O", "X" ] ]
[ 0, 2 ]
[ 0, 3 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: O O O O O X O O X O O X O * O O O O X # X X O O O O O X O X O O O X O X If a path exists, return it as a sequence...
down
[ [ "O", "O", "O", "O", "O", "X" ], [ "O", "O", "X", "O", "O", "X" ], [ "O", "*", "O", "O", "O", "O" ], [ "X", "#", "X", "X", "O", "O" ], [ "O", "O", "O", "X", "O", "X" ], [ ...
[ 2, 1 ]
[ 3, 1 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X X O O O X O X # O O X O O O X X O X O X X O * O O X X O If a path exists, return it as a sequence of moves (e...
right, right, up, up, right, up
[ [ "X", "X", "X", "O", "O", "O" ], [ "X", "O", "X", "#", "O", "O" ], [ "X", "O", "O", "O", "X", "X" ], [ "O", "X", "O", "X", "X", "O" ], [ "*", "O", "O", "X", "X", "O" ] ]
[ 4, 0 ]
[ 1, 3 ]
5
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: # O * O O O X O O O X X X X X O O O X O O X O X X If a path exists, return it as a sequence of moves (e.g., "righ...
left, left
[ [ "#", "O", "*", "O", "O" ], [ "O", "X", "O", "O", "O" ], [ "X", "X", "X", "X", "X" ], [ "O", "O", "O", "X", "O" ], [ "O", "X", "O", "X", "X" ] ]
[ 0, 2 ]
[ 0, 0 ]
5
5
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X O X O X X O O X O O O O O O X O X O X # O O X X X X O O X O * O O O X If a path exists, return it as a sequence...
right, right, up, up, left
[ [ "X", "O", "X", "O", "X", "X" ], [ "O", "O", "X", "O", "O", "O" ], [ "O", "O", "O", "X", "O", "X" ], [ "O", "X", "#", "O", "O", "X" ], [ "X", "X", "X", "O", "O", "X" ], [ ...
[ 5, 1 ]
[ 3, 2 ]
6
6
Find the shortest path from the start (*) to the destination (#) in this grid. You can only move through open cells (O) and cannot pass through obstacles (X). Valid moves are: right, down, left, up. Grid: X X O O O X X X # X X X O X X O O X O X O O * O O X O X X O If a path exists, return it as a sequence of moves (e...
infeasible
[ [ "X", "X", "O", "O", "O", "X" ], [ "X", "X", "#", "X", "X", "X" ], [ "O", "X", "X", "O", "O", "X" ], [ "O", "X", "O", "O", "*", "O" ], [ "O", "X", "O", "X", "X", "O" ] ]
[ 3, 4 ]
[ 1, 2 ]
5
6
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
4
Number of rows:
20,000
Total file size:
1.17 MB