Substrate Chains .NET API Extensions for Relay-, Para- and Solochains in the Substrate ecosystem

HTFramework AI

A fast 2D path finding library based on the A* algorithm. Works with both grids and graphs. Supports any .NET variant that supports .NETStandard 2.0 or higher. This library has no external dependencies. The library is licensed under the MIT license.

➡️ dotnet pathfinding : A*, JPS(Jump Point Search) ,JPS(with Orthogonal), JPS+

A C# WinForms application to visualize and explore pathfinding algorithms

Prisma is a 2D multiplayer game with tile-based world exploration, crafting, and a creative mode. Players can interact with and modify tiles, trade in a virtual shop, and battle both online opponents and advanced AI-controlled zombies. It features player stats management and utilizes PUN 2 for multiplayer and A* pathfinding for enemy AI.

A-star and SubGoal Graph pathfinding in CSharp

Simulation of path planning for self-driving vehicles in Unity. This is also an implementation of the Hybrid A* pathfinding algorithm which is useful if you are interested in pathfinding for vehicles.

A oceanic physics simulation demonstrating graph and artificial potential field based path planners.

Generic search algorithms for Unity

A 2D implementation of the Astar Pathfinding algorithm using Tilemaps in Unity

Unity client navmesh export to server for pathfinding

Library with realization of AStar algorithm

Simple and fast A* pathfinder .NET c# implementation.

Generic pathfinding tool for Godot engine 3.5 using CSharp. Includes both A* and Dijkstra algorithms working with different world representations.

A collection of simple A* pathfinding implementations that I am writing for different languages. This was intended as a personal learning project. However if you stumble upon this, feel free to use it. Any feedback would be primo.

An optimized C# HPA* Pathfinder

C# desktop maze playground! You can generate and edit a maze, change all sorts of visual settings and then export it into a picture. Also, you can choose a start/end node and visualize three different algorithms for finding the shortest path. Additionally, walls of each node are also editable.

Path search algorithms