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#

A project for visualising working of A* algorithm made in "Unity".

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

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

L2j format geodata path finder

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.

A* ( Star) algorithm for dynamic graphs on GPU

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

Exmple of the A star algorithm

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

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.

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

A Simple Implementation of A Star Search Algorithm

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

Repository for the programming exercises of the Intelligent Agents course (CS-430) at EPFL.

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

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

A* planner and control

Python implementation of N puzzle problem using A* and IDA* search algorithms.

Usage of A*/Astar algorithm

A* Pathfinding C++ providing many additional features

Path finding algorithms to find a path between pixels of images representing geographical features. Shows an OpenCV image output of traversal.

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

No description provided.

. implement Bidirectional Dijkstra and use it to compute distances in social networks very quickly; 2. implement A* search algorithm and apply it to compute distances in road networks faster than the classic algorithms do; 3. implement Contraction Hierarchies algorithm and apply it to preprocess large road networks and then compute distances in them much faster;

In this algorithm, I have written a module which is consist of a couple of main searching algorithm that has been implemented on the 8 puzzle problem as default.