Maze Game And Solver Using Bfs And Dfs (Java Gui Application)

Abstract

This project proposes the development of a Java-based Maze Solver Game that demonstratesthe practical implementation of core Data Structures and Algorithms concepts. The maze will be represented as a two-dimensional grid and internally modeled as a graph structure whereeach cell represents a node. The application will allow users to manually navigate the maze as well as automaticallysolve it using Breadth First Search (BFS) and Depth First Search (DFS) algorithms. The system will visually display the path traversal process through a graphical user interface (GUI). The project aims to enhance understanding of graph traversal techniques and their real-world applications in pathfinding systems.

Research Team