PopularMajor Project
Artificial Intelligence
Face Recognition Attendance System
Camera-based attendance with liveness detection and analytics
- Python
- OpenCV
- FaceNet
- Flask
- +2
₹4,900₹5,999
4.8/301 reviews
Artificial Intelligence · Mini Project
Optimal Path Finding with A*
Watch BFS, Dijkstra and A* search a grid step by step
1-2 weeks build
Overview
An interactive visualiser where you draw walls and weighted cells on a grid, place a start and a goal, and watch BFS, DFS, Dijkstra and A* explore in real time. Each run reports path cost, nodes expanded and time taken, so the algorithms can be compared on the same map. A maze generator and several A* heuristics make the differences easy to see.
What makes it stand up
- 01BFS, DFS, Dijkstra, greedy best-first and A* in one tool
- 02Draw walls and weighted terrain with the mouse
- 03Manhattan, Euclidean and diagonal heuristics for A*
- 04Recursive-division maze generator
- 05Side-by-side stats for path cost and nodes expanded
Module breakdown
- 01
Grid editor
Mouse-driven walls, weights, start and goal.
- 02
Algorithms
Shared interface for every search strategy.
- 03
Heuristics
Pluggable distance functions for A* and greedy search.
- 04
Visualisation
Animated frontier, visited set and final path.
- 05
Comparison
Benchmark table and charts across generated mazes.
After this, you will be able to
- Explain why an admissible heuristic keeps A* optimal
- Compare Dijkstra and A* on the same maze in a demo
- Defend the time and space complexity of each algorithm
Technology stack
- Python
- Pygame
- NumPy
- Matplotlib
- Level
- Mini Project
- Domain
- Artificial Intelligence
- Build time
- 1-2 weeks
- Difficulty
You receive
- Complete, commented source code
- 60-90 page project report (IEEE format)
- Editable presentation deck
- Architecture, ER and UML diagrams
- Local setup and deployment guide
- Sample dataset or seed data
- Viva question bank with answers
- One 45-minute walkthrough call
- 30 days of doubt-clearing support