Monthly Archives: October 2015

This week I used the improved code from last week to solve a 16×15 grid with good success. I compared the performance of simulated annealing versus genetic algorithms at performing this task, running each 4 times: 16×15 completion time (in … Continue reading →

This week I fundamentally changed how my code works to store the colored grids. Before, grids would be stored in a 2D-array of ints, with each int representing the color of that cell. Now, grids are stored as a 2D-array … Continue reading →

This week I spent some time looking at my genetic algorithm code and seeing if there was anything I could improve. There was indeed quite a bit of bloat. A lot of overhead was spent storing data about each generation … Continue reading →

This week I realized that a bit of my genetic algorithm is non-standard compared to how people usually implement one. The standard implementation is a bit simpler than the one I’ve been using, so I decided to refactor the code a bit … Continue reading →