Pathfinding-Algorithms

An simple and optimized grid pathfinding

A* search algorithm in TypeScript

Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

An A* pathfinding implementation with PCG (Procedural Content Generation) to generate custom splines in unreal engine between two points

Implementation of the A*-Algorithm in Unity3D

A react Application Used to visualize classical path finding algorithms like BFS, DFS, Dikstra's, A-star

A grid geometry toolkit for A* pathfinding and 2D sprite motion.

Using deep reinforcement learning to play Snake game. The used algorithm is PPO for discrete! It has the brilliant performance in the field of discrete action space just like in continuous action space. You just need half an hour to train the snake and then it can be as smart as you.|使用深度强化学习玩蛇游戏。 使用的算法是离散的 PPO！ 它在离散动作空间领域有着与连续动作空间一样的出色表现。

An implementation of the A-Star pathfinding algorithm tailored for traversing a bespoke collection of weighted hexagons. It's intended to calculate the most optimal path to a target hexagon where you are traversing from the centre of one hexagon to the next along a line orthogonal to a hexagon edge

Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.