Code for "Heuristic Search Methods" course assignments.
- "SAT" folder contains the code for SAT problem resolution (GSAT, WalkSAT, GRASP, Tabu Search, Ant Colony, and Knuth algorithms).
- "MST" folder contains the code for Minimum Spanning Tree problem resolution (Kruskal and local search methods, as well as A* and DFS for analysis of local search paths).
- "Fast-Downward" contains the final project's code, which is the generation of pattern database collection with hillclimbing search: https://www.aaai.org/Papers/AAAI/2007/AAAI07-160.pdf.