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

A program to solve a maze using Greedy Best First Search (GBFS) and A Star algorithm.

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

This Tree-Based Search Algorithms for Pathfinding implement DFS, BFS, RS, A*, and GBFS algorithms. The project assesses performance, heuristics, and optimizations while visually demonstrating algorithm behaviour.

Implemented Maze Solver using Greedy Best-First Search (GBFS) in Python Language

Implementation of A*, DFS, BFS, GBFS search algorithms using JavaScript

AI Search methods from an Intro to Artificial Intelligence Applications class.

Go to Bucharest in the fastest way

Code for Breadth first search, uniform cost search, greedy best first search and A* algorithms to solve the 8 puzzles 3 x 3

Informed & Uninformed Search algorithms [school assignment]

C# desktop app for Design & Analysis of Algorithms course — implements and visualizes search algorithms (BFS, DFS, UCS, GBFS).

This Python script implements the Greedy Best-First Search (GBFS) algorithm to solve a maze using the Turtle graphics library. The program visually represents the maze and the search process, allowing users to observe how the algorithm explores paths to find a solution based on heuristic evaluation.

Pathfinder_AI is a command-line tool for solving graph search problems using DFS, BFS, GBFS, A*, and UCS built during COS30019 AI coursework.

maze solver using different ai algorithms. (DFS, BFS, UCS, GBFS, A*)

A Maze Solving Agent using greedy best first search and A*star algorithms

Maze solving algos

Comparison of BFS, DFS, GBFS and A* algorithms on a robot pathfinding problem

AI Maze solver featuring multiple classical AI Search Algorithms such as BFS, DFS, A*, Greedy Best-First Search, and Uniform Cost Search. Includes solution visualization.