Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities. 🇵🇸

classical search algorithms are used in AI | AI course - Fall 2018

UoE Informatics Large Practical Coursework 2 - Air Quality Map

Tugas Kecil 3 IF2211 Strategi Algoritma - Word Ladder Solver using UCS, GBFS, and A*

Project assignment of the "Optimization methods and algorithms" course focused on implementing a hybrid meta-heuristic algorithm to solve the optimal database design problem.

This program solves 2D maze using various uninformed and informed (heuristic) search strategies.

Finds the best solution path for a maze using artificial intelligence

Conducting and examining Search Algorithms within a basic testing environment.

Group project on Tree Search Algorithms for the Curricular Unit of "Artificial Intelligence" @ FCUP, Porto with @barbara-san and @Nia3324

Using search algorithms to find the best possible way for "n" people to cross a bridge (within some constraints)

Greedy Best First Search and A* Search implemented in Java

Pathfinding Visualizer is an interactive tool for java to demonstrate the differences between Breath First Search, Greedy Best First Search, and A*

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.