Skip to content

Commit 7f8af7c

Browse files
Updated documentation.
1 parent a9f8576 commit 7f8af7c

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

docs/xor_example.rst

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -24,13 +24,13 @@ are not important, only their relative values.
2424

2525
In this example, we create a feed-forward neural network based on the genome, and then for each case in the
2626
table above, we provide that network with the inputs, and compute the network's output. The error for each genome
27-
is :math:`1 - \sum_i (e_i - a_i)^2` between the expected (:math:`e_i`) and actual (:math:`a_i`) outputs, so that if the network produces exactly
28-
the expected output, its fitness is 1, otherwise it is a value less than 1, with the fitness value decreasing the more
29-
incorrect the network responses are.
27+
is :math:`1 - \sum_i (e_i - a_i)^2` between the expected (:math:`e_i`) and actual (:math:`a_i`) outputs, so that if the
28+
network produces exactly the expected output, its fitness is 1, otherwise it is a value less than 1, with the fitness
29+
value decreasing the more incorrect the network responses are.
3030

31-
This fitness computation is implemented in the ``eval_fitness`` function. The single argument to this function is a list
32-
of genomes in the current population. neat-python expects the fitness function to calculate a fitness for each
33-
genome and assign this value to the genome's ``fitness`` member.
31+
This fitness computation is implemented in the ``eval_genomes`` function. This function takes two arguments: a list
32+
of genomes (the current population) and the active configuration. neat-python expects the fitness function to calculate
33+
a fitness for each genome and assign this value to the genome's ``fitness`` member.
3434

3535
Running NEAT
3636
------------

0 commit comments

Comments
 (0)