You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
An implementation of the SAS+ planning language in Java, as described in Malte Helmert's paper "A Planning Heuristic Based on Causal Graph Analysis", and the latter "Unifying the Causal Graph and Additive Heuristics" with Hector Geffner.
This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.
🔢 N-Puzzle solver built up on A* (with modifications), Greedy and Uniform Cost search algorithms. Available Heuristics are one of Manhattan, Hamming and Euclidean
A Java desktop application that demonstrates the A* pathfinding algorithm. The user can draw the terrain, set a start and end point, and the program will visually show the pathfinding process and move the sprite from start to end point.