The round-robin tournaments is a common tournament format.The main work of this paper is to study the optimal schedule and prediction of round-robin tournaments.For the optimal schedule,this paper implements an algorithm based on satisfi-ability modulo theories(SMT),which can set various constraints and be easily updated and modified at any time.For result predic-tion,this paper proposes an approximate algorithm based on a recent fixed-parameter algorithm.The experimental results show that the algorithm can get the result with high accuracy in a short time.
schedulingresult predictionround-robin tournamentssatisfiability model theory(SMT)
国家科技期刊平台
NSTL
万方数据
