This code implements a genetic algorithm for solving the Traveling Salesman Problem (TSP) on a set of cities from a distance matrix, utilizing techniques such as tournament selection, PMX crossover, inversion and exchange mutations, and elitism to optimize the route and minimize total distance.

This project explores the monochromatic triangle problem, leveraging genetic algorithms to find optimal solutions. It includes a visualization component to illustrate the problem and solution.

Evolutionary algorithms written in c++: a target string guesser and a maximum value calculator

Host p5js_sketch with githubpages