astar-search-algorithm

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.

Astar A* pathfinding Unity C#

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

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.

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.

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

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

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

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 code to solve 8 Puzzle game using A star algorithm.

Visualizer for various Path Finding Algorithms

The 8-puzzle game and also lets the user get it solved by the (A* heuristics based) A.I

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.

Multi agent path planning

A* Algorithm written in pure c++ 17

. 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;

Astar (A*) algorithm to find path between two given points

Popular algorithms used in path planning of robotics

Implementation of A* algorithm in python

Java and Python implementations of the A* (A Star) path planning algorithm. Includes example test driver command line program.

*** IN PROGRESS *** - Path Finding Algorithm Project in C#

A python script that implements a generic planner to solve a series of minigames using heuristic algorithms to generate the best possible moves to reach the goal state.

A Python, PyGame simulation of Dijkstra and A*, running at the same time.

graph search algorithms depicted on a nxn matrix graph

OpenStreetMap Route Planner using A* search

puzzles in AI is a collection of intelligent agents written in Python to solve different arcade games. This project was created for the purposes of experimenting with the implementation of game playing and puzzle solving using AI techniques.

Energy Efficient Scheduling for IoT devices using A* search algortihm

A* Pathfinding C++ providing many additional features