Problem

Source: Moldova TST 2021

Tags: combinatorics, game, Moldova



There are $14$ players participating at a chess tournament, each playing one game with every other player. After the end of the tournament, the players were ranked in descending order based on their points. The sum of the points of the first three players is equal with the sum of the points of the last nine players. What is the highest possible number of draws in the tournament.(For a victory the player gets $1$ point, for a loss $0$ points, in a draw both players get $0,5$ points.)