An A* Pathfinding implementation in Actionscript 3 (using Flashpunk for basic graphical display)

Data Structures & Algorithms Assessment 2

Projeto do NetBeans contendo uma aplicação que permite ao usuário testar o algoritmo A*. O A* é um algoritmo de busca de caminho entre dois pontos a partir de uma malha definida. Nesta aplicação é utilizado o método de Manhattan para realizar o cálculo da heurística.

A* Pathfinder

Another Astar implementation in C++, intended for use in embedded devices

March 2017 -- 7 Day Rogue-Like

A game concept for AI - A* work.

This repo was a short term project for CSCI 4511W (Artificial Intelligence) that uses a custom implementation of Pac-Man to compare different pathfinding algorithms.

A star Algorithm in Java

GUI app to find and display shortest distance between two locations and compare different graph algorithms.

Place rat in the maze. Place cheese in the maze. Put some obstacles and let the fun begin.

My own take on A*/Dijkstra Pathfinding. Its a generalization to permit all implementations while using any data-structures and heuristic functions regardless of whether or not the "map" fits in memory.

Trying the shortest path algorithms (Dijkstra, A*) in Unity for a route planning game prototype.

CSE537 under IV Ramakrishnan

Basic implementation that visuals how A* works. astar a*

Short A* Pathfinding Tutorial project

a 2d HTML5 canvas based tanks game made with createjs suite

Android App for simulating Dijkstra and A* algorithms through intuitive animations

Automated Snake Game Solvers using AI Search Algorithms

A* pathfinding implementation in C++