anchor.diff:  
   The problem is defined by http://en.wikipedia.org/wiki/Travelling_salesman_problem[Wikipedia].
   It is http://www.math.uwaterloo.ca/tsp/[one of the most intensively studied problems] in computational mathematics.
  -Yet, in the real world, it's often only part of a planning problem, along with other constraints, such as employee shift rostering constraints.
  +Yet, in the real world, it is often only part of a planning problem, along with other constraints, such as employee shift rostering constraints.
   
   
   [[tspProblemSize]]
  
positive.code: Hard constraints:
  
  * *No unassigned shifts* (built-in): Every shift need to be assigned to an employee.
  * **Shift conflict**: An employee can have only 1 shift per day.
  
  Soft constraints:
  
  
negative.code: [[tennisProblemDescription]]
  ==== Problem Description
  
  Every week the tennis club has four teams playing round robin against each other.
  Assign those four spots to the teams fairly.
  
  Hard constraints:
  
  