A Java-based graphical application designed to visualize and compare classic pathfinding algorithms in an interactive grid-based environment.
This project was created as an educational tool for a Game AI workshop during the AI Camp internal event organized by the SoAI (School of Artificial Intelligence) Club at ESI Algiers.
Pathfinding is a fundamental topic in Game AI, robotics, and artificial intelligence.
This project aims to:
- Provide an intuitive visual comparison between multiple pathfinding algorithms
- Help participants understand how different algorithms explore space and build paths
- Highlight trade-offs between optimality, speed, and exploration strategy
- Serve as a live demonstration tool for Game AI workshops
The application was used during a Game AI workshop presented as part of the AI Camp internal event.
The visualizer includes the following pathfinding algorithms:
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra’s Algorithm
- A* (A-Star)
- Variants and optimized versions of the above algorithms
Each algorithm can be observed step by step, allowing clear comparison of their behaviors and results.
- Java GUI grid-based visualization
- Real-time display of node exploration
- Visual comparison between uninformed and informed search algorithms
- Designed for clarity and teaching rather than raw performance
- Clean separation between algorithm logic and visualization
- Java
- Java Swing / AWT
- Object-Oriented Programming
- Graph and grid-based pathfinding techniques
Make sure Java (JDK 8 or higher) is installed.
javac -d bin -sourcepath ./src/main/java ./src/main/java/com/pathfinding/visualizer/app/App.java
java -cp bin com.pathfinding.visualizer.app.App
- Developed for the AI Camp internal event
- Organized by the SoAI Club (School of Artificial Intelligence Algiers)
- Hosted at ESI (École Nationale Supérieure d'Informatique)
- Presented as part of a Game AI workshop
- Created by a Game AI manager within SoAI
This project aims to bridge theoretical concepts and practical understanding by making algorithm behavior visually accessible.
This repository is suitable for:
- Game AI workshops
- Algorithm visualization sessions
- Introductory AI or graph theory courses
- Students learning pathfinding for games and simulations
You are free to fork, modify, and extend this project for educational purposes.