Problem #PRU-64487

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

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).