循环赛赛程安排及赛程结果预测  

Round Robin Schedule and Result Prediction

作　　者：吴咏君 陈寅[1,2] WU Yongjun;CHEN Yin(School of Computer Science,South China Normal University,Guangzhou 510000;School of Artificial Intelligence,South China Normal University,Foshan 528225)

机构地区：[1]华南师范大学计算机学院,广州510000 [2]华南师范大学人工智能学院,佛山528225

出　　处：《计算机与数字工程》2024年第10期3172-3178,共7页Computer & Digital Engineering

摘　　要：循环赛(round-robin tournaments)是一种常见的比赛赛制。论文的主要工作是研究循环赛的最优赛程安排和结果预测。对于最优赛程安排,论文实现了一个基于可满足性模理论(Satisfiability Modulo Theories,SMT)的求解算法,可以设置各种约束条件并方便随时进行更新和修改。对于结果预测,论文在一个最新的固定参数算法(fixed-parameter algorithm,FPT)基础上进行了改进,并实现了一个近似算法。实验结果表明,表明该算法可以较高的准确度以及较短的求解时间来得出结果。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.

关 键 词：赛程安排 结果预测 循环赛 可满足性模理论 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]