Interactive Python project for solving mazes using pathfinding algorithms like BFS, DFS, A*, Genetic Algorithm and Q-Learning. Features GUI visualization, maze generation, and performance comparisons.

🔍 A repository for the group assignment of my college's Artificial Intelligence subject about A* Search dan Greedy Best First Search

Jamaica TSP Solver is a Python application that solves the Traveling Salesman Problem (TSP) for Jamaica’s 14 parishes. It uses Nearest Neighbor, Greedy Best-First, and Brute Force algorithms, featuring route visualization with GeoPandas and interactive Folium maps. The project includes a GUI for matrix input and algorithm selection.