This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

A repository containing codes and algorithms for the AI course 18CSC305J.

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

Astar A* pathfinding Unity C#

N-Puzzle implementation with BFS, DFS, Greedy and A*

A code to solve 8 Puzzle game using A star algorithm.

Exmple of the A star algorithm

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.

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.

Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia

A* ( Star) algorithm for dynamic graphs on GPU

L2j format geodata path finder

Route Planner with OpenStreetMap is a C++ based project which used the A* Search algorith for finding the distance between two points on a map.

A Kotlin multiplatform puzzle game based on the Sliding-Puzzle problem that uses A* search algorithm to solve it

A Simple Implementation of A Star Search Algorithm

Jogo com algoritmo de busca para fugir de uma ou várias IA em um labirinto

Implementation of A* Graph Search Algorithm for a 2D Path Planning Problem with ROS

This is a Maze Pathfinding Application that includes the A* Algo as-well as the BFS Algo

Round table arrangemnet solution using greedy, Astar and UCS algorithms on graph data structure.

Python codes for A* algo, RBFS algo and IDS algo on 8_PUZZLES problem.