Automating the matching of a tournament based on shortest travel distance

Abstract: The matching of a tournament could be a tedious task, especially if there are many teams takingpart. To combat this difficult task this thesis evaluates if, by creating a method, there is a wayto automate this matching. The method proposed is based on only two parameters, shortestdistance and whether the teams have faced each other already. By being based on shortestdistance the method could not only shorten the planning time but also shorten the distance thatthe participants have to travel.To test the proposed method and validate whether it would give a sufficiently good matching itis applied to an already played Bridge tournament. The tournament was played in 2019 andincluded 365 teams and 7 rounds. This tournament was matched manually based partly ondistance and whether the teams have faced each other. Teams were split into clusters andrandomly matched each other within those. Thus, the teams did not often play against the closestteam but never a team very far away. Results are given in the form of maps for each round anda table which compares the distances for both the methods.The method was applied successfully, and each round was, as excepted, a shorter distance thanthe original matching. Thus, proving that an automatic tournament matching can be done. Thereare some improvement and alteration that can be done in the future to find a matching that morelifelike.