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 010 (Social Golfer Problem) — Constraint detection

The coordinator of a local golf club has come to you with the following problem . In her club , there are 32 social golfers , each of whom play golf once a week , and always in groups of 4 . She would like you to come up with a schedule of play for these golfers , to last as many weeks as possible , such that no golfer plays in the same group as any other golfer on more than one occasion . The problem can easily be generalized to that of scheduling $ m $ groups of $ n $ golfers over $ p $ weeks , such that no golfer plays in the same group as any other golfer twice -LRB- i.e. maximum socialisation is achieved -RRB- .

Problem 010 (Social Golfer Problem) — Detection of the decisions and objects to be modeled

The coordinator of a local golf club has come to you with the following problem . In her club , there are 32 social golfers , each of whom play golf once a week , and always in groups of 4 . She would like you to come up with a schedule of play for these golfers , to last as many weeks as possible , such that no golfer plays in the same group as any other golfer on more than one occasion . The problem can easily be generalized to that of scheduling $ m $ groups of $ n $ golfers over $ p $ weeks , such that no golfer plays in the same group as any other golfer twice -LRB- i.e. maximum socialisation is achieved -RRB- .

Back to list