Bloxorz-Style Levels with Guaranteed Shortest Paths

Bloxorz-style grid levels procedurally generated with a guaranteed shortest-path solution (found via BFS).
Each example is a small ASCII map with a start (S), goal (G), walkable tiles (#), and void/holes ( ).
The dataset includes both the shortest move sequence and its length.

• Splits: train (900), test (100)
• File format: newline-delimited JSON (.jsonl)
• Moves: U, D, L, R

Dataset Summary

This dataset is designed for planning, search, and sequence modeling tasks. Levels are generated on rectangular grids with variable sizes and tile densities, then solved with BFS to ensure the recorded plan is optimal in number of moves.

Example Record

{
  "level":" #######\n # #####\n G##S# #\n###### #\n####### \n##  # ##",
  "width":8,
  "height":6,
  "density":0.785,
  "start":[2,4],
  "goal":[2,1],
  "shortest_path":"LL",
  "solution_length":2,
  "seed":10337
}