Hex-grid utilities for board and strategy games with path-finding, field-of-view, and more
-
Updated
Dec 20, 2019 - C#
Hex-grid utilities for board and strategy games with path-finding, field-of-view, and more
A* search algorithm in TypeScript
A visualizer for the core search algorithms used in AI and game development. Special thanks to Amit Patel and his cool tutorials for providing me with the inspiration. #MadeWithUnity
A route planner using the A* algorithm (uses Open Street Map data)
Find the shortest route using A* algorithm and graphs (Route Planner application)
A grid geometry toolkit for A* pathfinding and 2D sprite motion.
A Hybrid-A* planner with early stopping for efficient path planning and extended motion primitives to account for the motion capabilities of the U-Shift II vehicle. Author: Oliver Schumann
A small demo for the A* Pathfinding algorithm in unity3d. Characters in this scene act "turn based" walking one at a time to wherever you point them to
A simple fastest route finder written in Java includes BFS, Djikstra(Speed limits included) and A* Algortihms also has the feature of visualization of visited nodes.
Top-Down Roguelite Game
Implement a navigational robot that performs global planning using A* and local planning using Vector Field Histogram (VFH) to help navigate the robot from start to end for a given map.
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! 它在离散动作空间领域有着与连续动作空间一样的出色表现。
A* Algorithm with a scalable GUI, "GPS" Find the shortest between X given Nodes, in order, like google maps steps
A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency
Rescue 1122 Route Planner is a Artificial Intelligence project which implements the A-star algorithm using Python and the simulation is done using Pygame.
A small simulation of the A* Algorithm fused with steering behaviours to make a car find an optimal path and move from start to goal, avoiding obstacles.
Example implementation of A* algorithm in JavaScript with an accompanying YouTube explanation video!
A* Path finding algorithm java implemantation
AI for Snake game using A star algorithm
CentA*, an A* algorithm extension, revolutionizes NPC pathfinding in Unreal Engine 5. Optimal start and end node selection improves efficiency. Developed with Blueprints and C++, it introduces diverse enemy behaviors via a behavior tree. Balancing accuracy and efficiency accommodates obstacles, dynamic environments, and multiple agents.
Add a description, image, and links to the a-star-path-finding topic page so that developers can more easily learn about it.
To associate your repository with the a-star-path-finding topic, visit your repo's landing page and select "manage topics."