A project about A* and JPS pathfinding algorithms for the course: Aineopintojen harjoitustyö: Tietorakenteet ja Algoritmit, held by University of Helsinki.
-
Updated
Dec 20, 2019 - Java
A project about A* and JPS pathfinding algorithms for the course: Aineopintojen harjoitustyö: Tietorakenteet ja Algoritmit, held by University of Helsinki.
An application that demonstrates various pathfinding algorithms created in java
This folder contains all the search algorithm which is used in Artificial Intelligence field.
classical search algorithms are used in AI | AI course - Fall 2018
Using the A* algorithm, this project calculates if a prisoner could escape a labyrinth and find the exit before fire gets to them.
Maglev is a library that provides fast and generic solutions for shortest path problems (SPP)
A sliding puzzle game & AI solvers
Práctica de la asignatura Técnicas de los Sistemas Inteligentes
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 star Algorithm in Java
Graph demo applications. Path finding, space-filling curves.
A program that solves fifteen puzzle using bfs, dfs and astar heuristics. Prepared for Artificial Intelligence and Expert Systems classes on TUL.
An implementation of A* algorithm in Java
Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia
Jeu de type rogue-like/rythme inspiré du célèbre jeu Crypt of the NecroDancer.
Add a description, image, and links to the astar topic page so that developers can more easily learn about it.
To associate your repository with the astar topic, visit your repo's landing page and select "manage topics."