Harmony Search is a Metaheuristic method which draws inspiration from the musical process of searching for a perfect state of harmony. In this project such algorithms are developed and performed on benchmark functions and real optimization problems.

Implementing CSP with Forward Checking constraint propagation on the example of solving Binary and Futoshiki puzzle

This Tree-Based Search Algorithms for Pathfinding implement DFS, BFS, RS, A*, and GBFS algorithms. The project assesses performance, heuristics, and optimizations while visually demonstrating algorithm behaviour.

Heuristic methods and growth, yield, and cost models for silvicultural optimization using Organon.

O projeto foi um trabalho acadêmico de Inteligência artificial, tem como objetivo solucionar o problema 8-Puzzle. Confira o vídeo demonstrativo.

Solve 8-Puzzle with A* algorithm in C# Form App.

A visually interactable implementation of the Game of Othello that is playable with either a second player or an AI opponent. This is a solo project developed as part of an Artificial Intelligence class.

Solve 8-Puzzle with A* algorithm in C# Console App.

Knight's Tour Windows Form Application: implementation of Non Intelligent and Heuristics Methods.

This repository accompanies a 3-part lecture series: Introduction to Pathfinding

Bachelor's thesis project on solving Solo Chess puzzles using heuristics and backtracking.