Constraint-based Round Robin Tournament Planning
Martin Henz · The MIT Press eBooks · 1999
Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this work, it is shown that all three phases can be solved using finite-domain constraint programming. The design of Friar Tuck, a generic constraint-based round robin planning tool, is outlined. New numerical results on round robin tournaments obtained with Friar Tuck underline the potential of constraints over finite domains in this area. 1 Introduction In a sport competition, n given teams play against each other over a period of time according to a certain scheme. The round robin scheme is popular in many team sports like football and basketball. It determines that every team t plays against ever...