Simple and reliable optimization with local, global, population-based and sequential techniques in numerical discrete search spaces.

🎯 A comprehensive gradient-free optimization framework written in Python

An algorithm for creating a good timetable for the Faculty of Computing. The algorithm is based on evolutionary strategies, more precisely on the 1+1 evolutionary strategy and Shotgun hill climbing.

Implementation of metaheuristic optimization methods in Python for scientific, industrial, and educational scenarios. Experiments can be executed in parallel or in a distributed fashion. Experimental results can be evaluated in various ways, including diagrams, tables, and export to Excel.

Discrete Optimization for Unsupervised Sentence Summarization with Word-Level Extraction

All exercises for the course Elements of AI - Building AI

Using Simulated Annealing, Hill Climbing, and Genetic Algorithms to recreate images using shapes 🤖 🧬

This is a n-queen problem solver using local search algorithms.

Twitter bot for Geometrize, a tool for geometrizing images into geometric primitives

Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics

Python bindings for OptFrame C++ Functional Core

Implementation of Late Acceptance Hill Climbing (lahc) algorithm

Travelling Salesman Problem implementation with Hill Climbing Algorithm

Various AI algorithm implementations.

A Python implementation of Hill-Climbing for cracking classic ciphers

Code implementations based on the book "Inteligencia Artificial. Fundamentos, práctica y aplicaciones", 2nd. Edition, by Alberto García Serrano.

An attempt to create the perfect AI for the Snake game 🐍

Python development to solve the 0/1 Knapsack Problem using Markov Chain Monte Carlo techniques, dynamic programming and greedy algorithm.

ANFIS PSO Curve Fitting Solver

8-Queens puzzle implementation with Hill Climbing(Random Restart) Algorithm