The A* (A-Star) search algorithm.
-
Updated
Nov 12, 2021 - Java
The A* (A-Star) search algorithm.
A limited-capacity rescue boat rescues passengers, retrieves black boxes, and drops off passengers at a station with 5 actions (Pick-up, Drop, Retrieve, Movement) using BFS, DFS, Iterative deepening, Greedy with 2 heuristics, and A* with 2 admissible heuristics.
Saving Westros with searching algorithms.
Usage of A*/Astar algorithm
A SAT Solver Using Search Algorithms (DFS, BFS and A*) and Metaheuristic (genetic algorithm and PSO) in JAVA
this app can use by universities and schools .first , you will enter the students and subjects data in file data/data .like : subject number, the number of students in single lecture , the times that each student prefer ,the times that each student not prefer and the days student can't come .after that the app will make a schedule for all subjec…
The projects are part of the course CSE-402 : Artificial Intelligence Sessional in 7th semester @buet
Implemented the projects in this repo as a part of course CS 6364 at UT Dallas
8 puzzle BFS in Java
Implementation of Bread First Search, Depth First Search, A Star Search and different Heuristics for PACMAN
Java and Python implementations of the A* (A Star) path planning algorithm. Includes example test driver command line program.
Repository for the programming exercises of the Intelligent Agents course (CS-430) at EPFL.
Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia
Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing
Add a description, image, and links to the astar-search-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the astar-search-algorithm topic, visit your repo's landing page and select "manage topics."