Solving-a-randomly-generated-maze

Path finding on a randomly genearted maze

1. A maze is randomly generated with only black and white pixels. The probability of a pixel of being black is maintained at 30%.
2. BFS, DFS, Dijkstra's algorithm, Greedy BFS and A* --- these five path finding algorithm is used to find path between the top-left and bottom-right corner pixel.

• Output video links:

1. Dijkastra's Algorithm
2. Greedy Algorithm
3. Depth First Search
4. Breadth First Search
5. A* Algorithm

• Some snapshots:

Path finding on a map

Finding a route between start point(126,19) and the end point(257,183) on the given map(276x431).

• Output video links:

1. Dijkastra's Algorithm
2. Greedy Algorithm
3. Depth First Search
4. Breadth First Search
5. A* Algorithm

• Some snapshots:

Presentation Link:

Link of the presentation of the project.