Skip to content

Simple Python project that uses standard libraries in conjunction with PyGame for the GUI. Allows the user to create a maze using their mouse, define starting position [S_i,S_j], goal position [G_i,G_j], and run different pathfinding algorithm visualizations from informed (Greedy, A*) to uninformed (DFS,BFS) and choose between L1 and L2 heuristics

Notifications You must be signed in to change notification settings

FIUPanther-JMolto98/Maze_Maker_Solver

Repository files navigation

(CAP4630/5602) FINAL PROJECT

Maze_Maker_Finder

TEAM 10:

‣Anthony Devesa

‣David Martinez

‣Joaquin Molto

‣Jose Revilla

‣Rahuul Rangaraj

This is our final project for Florida International University CAP4630/5602 - Introduction to Artificial Intelligence course:

Our program consists of an interactive game in which the user is given a window containing a white, gridded screen representing a blank m x m (square) matrix. Within the game, the player will then be able to interact with the screen and draw black squares representing the obstacles of the maze, as well as designate which coordinate of the matrix to be the starting point [Si,Sj] and the end point [Gi,Gj] using the cursor and a very intuitive UI. Once the maze has been drawn and the starting and end points specified, the user can select which pathfinding algorithm to use in order to solve the maze (DFS, BFS, GRD_L1, GRD_L2, AST_L1, AST_L2, BI_DFS). Our program will be written in the Python programming language to take advantage of libraries such as PyGame for the GUI and PyTest for testing and debugging purposes.

🔴DFS - Depth-First Search

🔵BFS - Breadth-First Search

🟢GRD_L1 - Greedy Best First Search (L1 Norm)

🟢GRD_L2 - Greedy Best First Search (L2 Norm)

🟡AST_L1 - A* (L1 Norm)

🟡AST_L2 - A* (L2 Norm)

🔴BI_DFS - Bi-Directional Depth-First Search🔵

About

Simple Python project that uses standard libraries in conjunction with PyGame for the GUI. Allows the user to create a maze using their mouse, define starting position [S_i,S_j], goal position [G_i,G_j], and run different pathfinding algorithm visualizations from informed (Greedy, A*) to uninformed (DFS,BFS) and choose between L1 and L2 heuristics

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages