Path finding algorithm and a simple maze creator created with C++ as a personnal project
-
Updated
Aug 4, 2023 - C++
Path finding algorithm and a simple maze creator created with C++ as a personnal project
Autonomous Robotic Mouse to navigate a maze- for IEEE California Micromouse Competition (CAMM) @ UCSD
Procedural Dungeon Generation
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.
C++ Maze Visualizer supporting orthogonal, hexagonal, and Voronoi diagram grids.
Midterm Project of lecture "Advanced Introduction to C++, scientific computing and machine learning"
C++ code that finds the shortest path between two points in arbitrary non-self-intersecting polygons with holes
This is a pathfinding simulator using the A* algorithm.
Robot maze arena for Planet Chili code challenges http://www.planetchili.net
Implementation of the PRA* pathfinding algorithm
Bellman-Ford and Dijkastras' algorithm for shortest path finding
Optimized loading station placement based on hierarchical Hub-Labeling
#include-only, single header, custom written ai that can play ANY turn based game, including Boardgames, Card-games, hidden-info games, multiplayer games, and games with randomness.
Implementation of Greedy algorithm
Random graph generation and several pathfinding algoritms
Implementations of the A* algorithm in C++
An implementation of Dijkstra's pathfinding algorithm in C++
Add a description, image, and links to the pathfinding topic page so that developers can more easily learn about it.
To associate your repository with the pathfinding topic, visit your repo's landing page and select "manage topics."