Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 026 (Sports tournament scheduling) — Constraint detection

The problem is to schedule a tournament of $ n $ teams over $ n-1 $ weeks , with each week divided into $ n/2 $ periods , and each period divided into two slots . The first team in each slot plays at home , whilst the second plays the first team away . A tournament must satisfy the following three constraints : every team plays once a week ; every team plays at most twice in the same period over the tournament ; every team plays every other team .

Problem 026 (Sports tournament scheduling) — Detection of the decisions and objects to be modeled

The problem is to schedule a tournament of $ n $ teams over $ n-1 $ weeks , with each week divided into $ n/2 $ periods , and each period divided into two slots . The first team in each slot plays at home , whilst the second plays the first team away . A tournament must satisfy the following three constraints : every team plays once a week ; every team plays at most twice in the same period over the tournament ; every team plays every other team .

Back to list