MathDB
MMO 305 Moscow MO 1955 25 in a chess tournament

Source:

August 17, 2019
minimumcombinatoricsTournament

Problem Statement

2525 chess players are going to participate in a chess tournament. All are on distinct skill levels, and of the two players the one who plays better always wins. What is the least number of games needed to select the two best players?