Project of Heuristics and Search Methods course at UGent
This project contains implementation of classical algorithms like Depth First Search (DFS), Dynamic Programming (DP) and Simulated Annealing (SA).
The goal was to find a path from an initial state to a final state in a 2D grid world in order to maximize harvesting rewards along the path.