bnurbekov/local_search_genetic_algorithm_practice

This project was completed on September 30, 2015. The goal of the project was to implment local search using Genetic Algorithms for three different puzzle (the most notable out of all three is finding the optimal structure for a tower).

AI-HW2

Running program:

ga.py takes 3 command-line arguments:

1. Which puzzle it is solving (1, 2, or 3)
2. The name of the file it should read in that contains the puzzle information
3. How many seconds it has to work on a solution

Example: ga.py 3 input/puzzle3_input 1

Output:

Program prints out:

1. The best solution it found
2. The best solution's score
3. How many generations it ran for
4. At what generation it found its best solution

Also, the program creates output folder where it writes data for plotting.