Problem #PRU-64487

Problems Fun Problems Word Problems Tables and tournaments Methods Examples and counterexamples. Constructive proofs Tournament tables Pigeonhole principle Pigeonhole principle (other)

Problem

In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).