Function main

examples/machine_learning/geneticalgorithm.cpp:160–190

}

int main(int argc, char** argv) {
    bool console       = false;
    const int n        = 32;
    const int nSamples = 16;
    if (argc > 2 || (argc == 2 && strcmp(argv[1], "-"))) {
        printf("usage: %s [-]\n", argv[0]);
        return -1;
    } else if (argc == 2 && argv[1][0] == '-') {
        console = true;
    }

    try {
        af::info();
        printf(
            "** ArrayFire Genetic Algorithm Search Demo **\n\n"
            "Search for trueMax in a search space where the objective "
            "function is defined as :\n\n"
            "SS(x ,y) = min(x, n - (x + 1)) + min(y, n - (y + 1))\n\n"
            "(x, y) belongs to RxR; R = [0, n); n = %d\n\n",
            n);
        if (!console) {
            printf(
                "The left figure shows the objective function.\n"
                "The right figure shows current generation's "
                "parameters and function values.\n\n");
        }
        geneticSearch(console, nSamples, n);
    } catch (af::exception& e) { fprintf(stderr, "%s\n", e.what()); }

    return 0;
}