-
Updated
Dec 22, 2020 - Python
#
greedybestfirst
Here are 4 public repositories matching this topic...
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.
gui reinforcement-learning ai genetic-algorithm astar-algorithm dfs ids simulated-annealing bfs searching-algorithms maze-generator maze-solver ucs qlearning-algorithm greedybestfirst
-
Updated
Dec 31, 2024 - Python
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.
-
Updated
Dec 24, 2024 - HTML
🔍 A repository for the group assignment of my college's Artificial Intelligence subject about A* Search dan Greedy Best First Search
-
Updated
Mar 21, 2023 - Jupyter Notebook
Add this topic to your repo
To associate your repository with the greedybestfirst topic, visit your repo's landing page and select "manage topics."