A Java-based maze solver application that uses Breadth-First Search (BFS) algorithm to find the shortest path from START to EXIT in a maze. Features interactive GUI with path visualization and step-by ...
This repo hosts the code that implements a maze solver using SystemVerilog and Formal Verification. The maze is defined as a 10x10 grid, where 1 represents a path and 0 represents a wall. The solver ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results