olymmath

ToT 2021-fall JO5

    There were 20 participants in a chess tournament. Each of them played with each other twice: once as white and once as black. Let us say that participant XX{} is no weaker than participant YY{} if XX{} has won at least the same number of games playing white as YY{} and also has won at least the same number of games playing black as YY{} . Do there exist for sure two participants AA{} and BB{} such that AA{} is not weaker than BB{} ?

    Boris Frenkin

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator tot/2021-fall/jo5 · Tag F228MANPJV · Edit this page on GitHub · Keys: j next, k previous