An implementation of BFS, DFS, and A* search in Python

Illustration of a star algorithm work

My own take on A*/Dijkstra Pathfinding. Its a generalization to permit all implementations while using any data-structures and heuristic functions regardless of whether or not the "map" fits in memory.

In this project, the Pac-Man agent finds paths through its maze world, both to reach a particular location and to collect food efficiently. Search algorithms such as Depth First Search, Bread First Search, Uniform Cost Search and A-star search are applied to Pac-Man scenarios.

A quick Python3 implementation of the A* pathfinding algorithm. Good for maze solving and timing, or burning away a Saturday trying to figure out how it works **cough I did that cough**

Solving NQueen and HeavyNqueen, Hill Climbing and Astar, based on Python, EM for Clustering

This project contains A* path planning algorithm implementation for Turtlebot3. Libraries of Robot operating system have been used for implementation

Course work - CSE 537 - SBU

Solve 15-puzzle (Game of 15)

Maze solver in Python (BFS and A*)

This is a program for controlling the EV3 and presenting its data

Optimal path finding on google map data

Illustration of A* search in python

Playground for motion planning and controls algorithms.

AI 8 puzzle problem using A* search

python package for fast shortest path computation on 2D grid or polygon maps

Programmeertheorie (5062PRTH6Y), 2018/2019, 1, Period 2

A* (A star) Path finding script for Python 3.

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