O programa consiste em criar um algoritmo de Inteligência Artificial usando o método da Busca pelo Primeiro Melhor ou Best-First Search (BFS)

Undergraduate

Solve Indonesian Dot Puzzle using Depth First Search, Best First Search and A* algorithms

Best-First-Search | Breadth-First-Search | Depth-First-Search | Greedy-Best-First-Search | A-Star-Search

Search Algorithms Library

BFS and A-star shortest distance

EECS 348: Intro to Artificial Intelligence, Assignment 1 (Python)

This is the implementation of A* and Best First Search Algorithms in python language. The project comprimise two data structures: stack and heap.

Implementation of famous search algorithms for Missionaries and Cannibals problem

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

A CLI application for creating mazes using Eller's algorithm, solving them using the Best first search algorithm, and running various outputs.

This repo is created as a part of Aritificial Intelligence course at my college and contains implementations of some AI algorithms from scratch.

An AI Solver for Puzzle "Rush Hour"

This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

Python implementation of common pathfinding algorithms in 3D grid space

Finding path in a map which consist of cities using A*, Best First Search, Breadth First Search and Depth First Search.