~dieggsy/chicken-genann

0486c1ff2c8ba0121c3c1c87d1a4547a67b7a05f — dieggsy 3 years ago 9777268 + 4f72209
Merge github.com:codeplea/genann
2 files changed, 3 insertions(+), 3 deletions(-)

M README.md
M example1.c
M README.md => README.md +2 -2
@@ 11,7 11,7 @@ functions and little extra.

## Features

- **ANSI C with no dependencies**.
- **C99 with no dependencies**.
- Contained in a single source code and header file.
- Simple.
- Fast and thread-safe.


@@ 105,7 105,7 @@ backpropogation.

A primary design goal of Genann was to store all the network weights in one
contigious block of memory. This makes it easy and efficient to train the
network weights using direct-search numeric optimizion algorthims,
network weights using direct-search numeric optimization algorthims,
such as [Hill Climbing](https://en.wikipedia.org/wiki/Hill_climbing),
[the Genetic Algorithm](https://en.wikipedia.org/wiki/Genetic_algorithm), [Simulated
Annealing](https://en.wikipedia.org/wiki/Simulated_annealing), etc.

M example1.c => example1.c +1 -1
@@ 23,7 23,7 @@ int main(int argc, char *argv[])
    genann *ann = genann_init(2, 1, 2, 1);

    /* Train on the four labeled data points many times. */
    for (i = 0; i < 300; ++i) {
    for (i = 0; i < 500; ++i) {
        genann_train(ann, input[0], output + 0, 3);
        genann_train(ann, input[1], output + 1, 3);
        genann_train(ann, input[2], output + 2, 3);