Small updates

ZviRosenfeld · Dec 19, 2020 · 09601d1 · 09601d1
1 parent d018e11
commit 09601d1
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/GeneticAlgorithm/GeneticAlgorithm.nuspec b/GeneticAlgorithm/GeneticAlgorithm.nuspec
@@ -2,7 +2,7 @@
 <package >
   <metadata>
     <id>GeneticAlgorithm</id>
-    <version>1.3.5</version>
+    <version>1.3.6</version>
 	<title>A parallel Genetic Algorithm Engine</title>
     <description>A parallel Genetic Algorithm Engine. GeneticAlgorithm was created to be easily customized and simple to use.</description>
     <authors>Zvi Rosenfeld</authors>

diff --git a/README.md b/README.md
@@ -248,7 +248,7 @@ Existing SelectionStrategies:
 - [RouletteWheelSelection](/GeneticAlgorithm/SelectionStrategies/RouletteWheelSelection.cs): With RouletteWheelSelection, the chance of choosing a chromosome is equal to the chromosome's fitness divided by the total fitness. In other words, if we have two chromosomes, A and B, where A.Evaluation == 6 and B.Evaluation == 4, there's a 60% change of choosing A, and a 40% change of choosing B.
 - [TournamentSelection](/GeneticAlgorithm/SelectionStrategies/TournamentSelection.cs): With TournamentSelection, we choose a random n chromosomes from the population, and of then select the chromosome with the highest evaluation. In TournamentSelection, selection pressure will grow as the tournament size grows. See [this](https://en.wikipedia.org/wiki/Tournament_selection) link for more information.
 - [StochasticUniversalSampling](/GeneticAlgorithm/SelectionStrategies/StochasticUniversalSampling.cs): StochasticUniversalSampling (SUS) is very similar to RouletteWheelSelection. For more information look [here](https://en.wikipedia.org/wiki/Stochastic_universal_sampling).
-- [RankSelection](/GeneticAlgorithm/SelectionStrategies/RankSelection.cs): RankSelection firsts ranks the chromosomes based on their evaluation. The worst will have fitness 1, second worst 2 etc. and the best will have fitness N (number of chromosomes in population). RankSelection is very similar to RouletteWheelSelection, but can lead to slower convergence, because the best chromosomes do not differ so much from other ones.
+- [RankSelection](/GeneticAlgorithm/SelectionStrategies/RankSelection.cs): RankSelection firsts ranks the chromosomes based on their evaluation. The worst will have fitness 1, second worst 2 etc. and the best will have fitness N (number of chromosomes in population). RankSelection is very similar to RouletteWheelSelection, but can lead to slower convergence, because the best chromosomes do not differ so much from other ones. (Available since 1.3.6.)
 
 You can find examples of ISelectionStrategies [here](/GeneticAlgorithm/SelectionStrategies).