A collection of tools and algorithms for developing traditional roguelikes. Such as field-of-view, pathfinding, and a tile-based terminal emulator.

导航网格寻路C++实现版(入门版)

Minimal A* implementation in C. No dynamic memory allocation.

A guide that explains how different path finding algorithms work

Project for ROB 550. Implementing SLAM using LIDAR, wheel encoders and IMU on MBot.

A terminal implementation of the game Quoridor with an engine

This project is meant to make you code an ant farm manager - 42 Silicon Valley

Contains map generation and path finding

Fast path finding algorithm for dynamic environments

A kind of 7-Grids pathfinding algorithm

Explore and solve traffic problem via implementing a simulator for autonomous vehicles 🚙

Platformer game for development subject at CITM University

Theatrical Controller for Thesis Project

🚀 Quickest Path REST API | A high-performance C++ REST API for calculating the quickest path between landmarks in the United States. Supports JSON/XML responses, efficient pathfinding using graph algorithms, and robust data validation. Ideal for route planning applications!

Projekt P1 - Levering af pakker

A library of path planning algorithms over 2d and 3d spaces using STL and priority queues.

This C program implements the A* algorithm for finding the shortest path in a 2D array. The program randomly generates a maze by setting some cells as walls, and sets a starting and an ending point. It then applies the A* algorithm to find the shortest path from the starting point to the ending point, and prints the path in the maze.

AI ants that try to find food and when they find, they leave a track so others can find the shortest path.

Simple roguelike/RPG library in C with an example game implementation.

This directory is for the purposes of finding the shortest hamiltonian path given a set of vertices and edges connecting them. It will handle an error if not given the proper format of veritces, edges, and names.