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

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

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

Astar A* pathfinding Unity C#

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.

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

Implementation of BFS, DFS, Uniform cost search, greedy search, A* search for path finding in maze, Implementation of Water Jug problem with jugs having capacity m and n, resp.

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

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.

Array of AI Search algorithms is employed to playing Pac-Man ⍩⃝.

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

Rush Hour, a sliding block logic game.

A* ( Star) algorithm for dynamic graphs on GPU

A* (pronounced "A star") is a computer algorithm used in pathfinding and graph traversal. This repository is an implementation of this algorithm in Python.

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

A collection of motion planning projects in Python 3 and YAML

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

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.