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

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.

Host p5js_sketch with githubpages