Editing Tournament selection (section)

== Variants ==
Deterministic tournament selection selects the best individual (when ''p'' = 1) in any tournament. 

A 1-way tournament (''k'' = 1) selection is equivalent to random selection. 

There are two variants of the selection: ''with'' and ''without'' replacement. The variant without replacement guarantees that when selecting ''N'' individuals from a population of ''N'' elements, each individual participates in exactly ''k'' tournaments. 
An algorithm is proposed in.<ref>{{cite journal|first1=David E.|last1=Goldberg|first2=Bradley|last2=Korb|first3=Kalyanmoy|last3=Deb|title=Messy Genetic Algorithms: Motivation, Analysis, and First Results|journal=Complex Systems|date=1989|volume=3|issue=5|pages=493–530|url=https://wpmedia.wolfram.com/uploads/sites/13/2018/02/03-5-5.pdf}}</ref> Note that depending on the number of elements selected, selection ''without'' replacement does ''not'' guarantee that no individual is selected more than once. It just guarantees that each individual has an equal chance of participating in the same number of tournaments.