Given a set of cars (red, green, blue) that all start at a commmon location (center square), produce the shortest combined set of routes that visits all the ponits (circles) and returns to its original position. Current implementation uses steepest ascent hill climb.