🌐 Create and customize landing pages easily with Oito, your AI-driven solution for seamless web development and design.

🔍 Optimize wind farm inspection routes using TSP for order and A* for pathfinding, ensuring efficient and clear navigation for multiple turbines.

Nelder-Mead is a heuristic optimization algorithm, based on simplex navigation over the objective function.

This project, Reversi (also known as Othello), is a robust implementation of the classic 8x8 board game developed in Java. It is a continuation of my work from a previous programming course and now serves as a platform to integrate and test various Artificial Intelligence strategies.

Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems while incorporating formal logic.

MATLAB-based heuristic algorithm for GrVRP-PCAFS with segmentation and local search.

♟️ a Java chess engine with a JavaFX GUI, featuring full chess rules and a Minimax-based AI for single-player games

The ML-Based Medical Chatbot is an AI-powered healthcare assistant designed to predict diseases and suggest appropriate medicines based on user symptoms. It uses Machine Learning (ML) and Natural Language Processing (NLP) techniques to interpret natural language queries and generate intelligent responses

Proiect Licenta, Anul 3, Facultatea de Matematica si Informatica, Universitatea din Bucuresti

2048 solver using expectimax algorithm with rank-weighted heuristics. It consistently reaches 2048

Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

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

deep (Dynamic Epistemic logic-basEd Planner) is a multi-agent epistemic planner that operates over the full scope of mA*, leveraging optimized search algorithms and heuristics.

Balloon Loop Heuristic (BLH) — A constructive near-optimal approach for the Traveling Salesman Problem (TSP) combining geometric loop generation and 2-opt refinementStefan Fey, 2025. "A Balloon Loop Heuristic for the Traveling Salesman Problem". arXiv preprint.

Implementing A* to find the most optimal path to the exit while collecting at least 5 treasure points.

A Python project with GUI and visualization that implements the Simulated Annealing algorithm for optimization. Built with Tkinter and Matplotlib, it lets users configure parameters, run the algorithm, and see results in real-time.

Code and data for "Fast heuristics for minimizing the makespan in non-permutation flow shops"

Learning Discrete World Models for Heuristic Search

A chess engine written in C++

A*(Star) search algorithm to solve a 3×3 sliding puzzle with tiles 1–7 and two empty slots. The system explores the state space using a Manhattan distance heuristic and reconstructs the solution path with move counts and maximum queue size.