greedy-best-first-search

An all-in-one application to visualize multiple different local path planning algorithms

Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.

🔍 A friendly visualizer for some search algorithms, like DFS, BDS, Greedy and A*

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.

Mangalyaan is a web application that helps a Mars rover to find the shortest path between two points on a surface while avoiding obstacles on the way using different searching algorithms.

A visualization to show you how exactly the pathfinding algorithms work in reality. Check it out !

classical search algorithms are used in AI | AI course - Fall 2018

This program solves a 2D maze with the help of several search algorithms like BFS, DFS, A* (A-Star) etc.

AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze

visualizes five pathfinding algorithms and maze generation algorithms.

In this, we solved a maze using both Greedy Best First Search Algortihm and A* Algorithm

AI Final Assignment, paper link: tinyurl.com/last-choice-ai

Solving the n-puzzle problem using informed and uninformed search strategies

Online demo: https://kamalbennani.github.io/pathfinder-visualization/

Robot Navigation using graph algorithms like DFS, BFS Astar etc.

UoE Informatics Large Practical Coursework 2 - Air Quality Map

Visualization tool of path finding algorithms

Visualization for the following algorithms: A* Search, Bredth First Search, Depth First Search, and Greedy-Best First Search. In addition to Recursive and DFS maze generation.

a star search, greedy best search and bfs and dfs lib

Pathfinding using Astar, Dijkstra and Greedy Best-first using C# in Unity

Using A * search algorithm and GBFS search algorithm to solve the Romanian problem

Project assignment of the "Optimization methods and algorithms" course focused on implementing a hybrid meta-heuristic algorithm to solve the optimal database design problem.

This program solves 2D maze using various uninformed and informed (heuristic) search strategies.

C# desktop maze playground! You can generate and edit a maze, change all sorts of visual settings and then export it into a picture. Also, you can choose a start/end node and visualize three different algorithms for finding the shortest path. Additionally, walls of each node are also editable.

Finds the best solution path for a maze using artificial intelligence

Artificial Intelligence Algorithms on the 8Puzzle

寻路算法

Solution of Machine Intelligence (CMP402) labs

Visualize how different search algorithms traverse a grid.