Xiang Qi tournament algorithm applying Swiss pairing system

Abstract

Xiang Qi association in the world has quite large members, so that when organizing a tournament with many participants caused a scheduling problem. Round-robin system which is commonly used in tournament cannot be efficiently used regarding to the number of participant. The higher the number of participant, the longer and the more exhausted the players. This paper suggests Swiss pairing system to do scheduling in Xiang Qi tournament. The capacity of the tournament can be increased, but the player can still compete with the optimal result. The pairing function considers the player's record, the ‘bye’ notes, the player's color preferences, and the origin of the player's club. The time complexity of Swiss pairing and Round-robin is shown in the evaluation where the Swiss-pairing is more efficient than Round-robin system.