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

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

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

A* planner and control

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.

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

ENPM 661 Project 3 Phase 2: A rigid robot traverses through a configuration space to find the goal node using A star search algorithm, while it avoid the obstacles in the map

Lecture notes for 4M26 in the form of a video game

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

Popular algorithms used in path planning of robotics

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

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.

Implementation of A* algorithm in python

Ares-Adventure is a Python-based Sokoban puzzle solver that implements four search algorithms: BFS, DFS, UCS and A*

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

A simplified Tetris game where the goal is to remove a target token using the fewest moves. Implements A* search with heuristic optimization to find the shortest sequence of actions for the Red player.

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