The agent watches a complete badminton match broadcast, finds every rally of 20 strokes or more, and for each reports its start, stroke count and winner, and the state at three strokes: the fifth, the middle one and the last. Each state is the stroke number, who hit it, and three court zones (hitter, receiver, where the shuttle went). The reference holds 26 rallies and 78 checkpoints.
What a good answer has to get right, and how the verifier checks it
- The long rallies are found
- A reported rally is paired with a reference rally of the same set whose start is within 2 s, one to one, and only if it reports 20 strokes or more. This gives an F1 over rallies: a rally that is not long enough to qualify, or is missed, costs.
- Each rally is counted and decided
- For the paired rallies, the stroke count must be exact and the winner right. The two accuracies are averaged.
- Each checkpoint is timed
- The contact time of each checkpoint stroke must be within 1 s. This gives an F1 over the checkpoints of the paired rallies.
- The state at each checkpoint is right
- Five fields are each scored on their own with an F1: stroke number, hitter, hitter’s zone, receiver’s zone and destination zone, all exact. The five are averaged.
How the checks become one score
Score = rally F1 × mean of stroke-count and winner accuracy × checkpoint timing F1 × mean of the five field F1 values. The four parts are multiplied, so the score cannot be higher than the weakest part. Within the last part, a checkpoint with four of five fields right keeps four fifths of its credit.
What scores zero
No solution file or one that cannot be read, or any of the four parts at zero: no rally paired, no paired rally with the right stroke count or winner, no checkpoint within 1 s, or no state field right.
Outside the score: rallies shorter than 20 strokes are not part of the reference, and an entry for one counts as a wrong rally.