Prolog program for Search of a road-route from any city A to any other city B

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)

Deep search, Best-first Greedy search, Hill Climb

Generate the basic structure for the famous game by using the Solid principle, class diagrams tools, and the popular search algorithms

Solving TACI 8-Puzzle using heuristic search

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

Implementation of different path finding algorithms

8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.

Maze project part C in JavaFX

AI path planner program that utilizes a multitude of algorithms, including the A* Search algorithm.

Prolog Assignment : London Underground

Implementation of famous search algorithms for Missionaries and Cannibals problem

O projeto foi um trabalho acadêmico de Inteligência artificial, tem como objetivo solucionar o problema 8-Puzzle. Confira o vídeo demonstrativo.

Visual demonstration of various pathfinding algorithms.

BFS and A-star shortest distance

Greedy Best First Search and A* Search implemented in Java

In this pure javascript demo, you will be able to see the most famous path-finding algrithms in action, with nice animations and intuitive customizations of the paths!

This is a homework about various Uninformed and Informed search algorithms, implemented for solving a simple game. This homework is a part of many projects in a Fundamentals to AI course @ FUM.