Dot Path Finding AI

A simple path finding artificial intelligence with a genetic algorithm. Each generation improves on the last generation by taking best and mutating it a little for the following generation.

Details

Dots "die" when they run into the edge of the screen or when they hit an obstacle. Dots "succeed" when they run into the red goal dot at the top of the screen. See an example in the screenshot below.

Fitness function

public void calculateFitness(Pair<Integer, Integer> goalPosition){
    if(goalReached){
        fitness = 1.0 / 16.0 + 10000.0 / Math.pow(brainStep, 2);
    } else {
        double distanceToGoal = calcDistanceToGoal(goalPosition);
        fitness = 1.0 / Math.pow(distanceToGoal, 2);
    }
    if(fitness == Double.POSITIVE_INFINITY) {
        fitness = 1;
    }
}

Credits

A simple path finding artificial intelligence with genetic algorithm based on the tutorial originally written in Processing by CodeBullet.