Path finding algorithm and a simple maze creator created with C++ as a personnal project

A project comparing the execution speed of pathfinding algorithms on mazes for video game agents.

A utility to programmatically create pathfinding maps

C++ code that finds the shortest path between two points in arbitrary non-self-intersecting polygons with holes

Simple C++ implementation of an A* Pathfinding class.

L2j format geodata path finder

Path finding algorithm comparison.

This is a pathfinding simulator using the A* algorithm.

A* search algorithm used to play snake

Autonomous Robotic Mouse to navigate a maze- for IEEE California Micromouse Competition (CAMM) @ UCSD

Implementation of A* algorithm on C++ with reading a map from a file

a Pacman Clone, with an option to load levels from text files, includes an implementation of the A* path-finding-algorithm for the ghosts movement

RandomMazeSolver is a program capable of generating and solving mazes randomly. It also makes use of the parallelism paradigms offered by the OpenMP library in order to speed the execution up.

This C++ program generates mazes using randomized DFS and solves them using the Wall Follower and A* algorithms

C++ Maze Visualizer supporting orthogonal, hexagonal, and Voronoi diagram grids.

Example for Pathfinding with the A* algorithm

Path Finding Task

Pathfinding and route-planning utilities for drone-based area surveying

Hierarchical Pathfinding module