Interactive search experiments on randomised grids with configurable obstacles, at least one valid path always preserved, and visualised exploration.
The problem
Search behaviour is hard to reason about without a controlled environment that makes the state, the obstacles, the exploration and the final route visible.
What was built
An interactive N×N grid environment that generates randomised maps with configurable obstacle density, while preserving a valid route from source to destination.
Technical approach
- Generate a randomised, configurable grid
- Place the source, destination and obstacles
- Preserve at least one valid route
- Compute a path through the state space
- Visualise the explored cells and the final path
Engineering decisions
- Make the environment parameters configurable so experiments can be repeated.
- Do not name the algorithm until the source has been verified.
- Use visualisation to explain the behaviour, not just to show a final path.
How it was checked
- The repository supports randomised N×N maps and configurable obstacle density.
- Source-to-destination routing, valid-path preservation and exploration visualisation are documented.
What it shows
Algorithm design, state-space reasoning, simulation and explainable technical visualisation.
About the source
Academic and R&D project. The exact search algorithm is not named until the implementation has been reviewed.