Academic coursework completed as a Computer Science Student
MazeScape is a high-speed maze escape challenge with procedurally generated levels and relentless AI ghosts using the A* pathfinding algorithm. Grab powerups like Speed Surge, Ghost Freeze, and Wall Breaker to outsmart your pursuers, and race against time to reach the golden exit before they catch you!
visualizes five pathfinding algorithms and maze generation algorithms.
C++ A* pathfinding library
A pathfinding simulator that uses the A* algorithm to find the shortest path
A* pathfinder algorithm in JavaScript with an user friendly UI
Portfolio of AI projects developed during my Udacity AI Nanodegree, covering Planning AI, Constraint Satisfaction, Hidden Markov Models, and Search algorithms.
A website made to calculate shortest path using uniform cost search and A* algorithm
Using the A* algorithm to solve the Npuzzle problem.
Visualizer for some search algorithms — currently A* and Dijkstra's algorithms — using JavaScript, jQuery, HTML, CSS, and some third party JS libraries.
This is a web application that gets user's input location and find shortest path to the nearest hospital using A* algorithm and also show it visually through graph by networkx library
The A* (A-star) algorithm is a powerful and efficient pathfinding and graph traversal algorithm commonly used in robotics and artificial intelligence. This implementation is specifically designed for drone navigation, enabling autonomous drones to determine the optimal path from a starting point to a target location while avoiding obstacles.
use es6; firefox>=53 chrome>=56 tested
Applying A start algorithm to find optimal path between two given places in hyderabad
About SmartXNavigator is an advanced route planning tool that leverages geographic and traffic data to provide optimized travel routes. Utilizing Pathfinding algorithms, it calculates the shortest or quietest paths based on user preferences.
This is real time implementation for applying a star algorithm in graph database [Neo4j].
nextdataAI: a Python library for solving mazes using classical algorithms (A*, BFS, DFS, Dijkstra, Greedy), reinforcement learning (QLearning, QTable, QNN, QLSTM), and novel pseudo-heuristics. Features include a neural network-based heuristic approximating Manhattan distance (NNHeuristic) and a custom SManhattan heuristic, a dataset gener
Add a description, image, and links to the astar-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the astar-algorithm topic, visit your repo's landing page and select "manage topics."