anchor.diff:  
   Hard constraints:
   
  -* 2 patients must not be assigned to the same bed in the same night. Weight: ``-1000hard * conflictNightCount``.
  +* Two patients must not be assigned to the same bed in the same night. Weight: ``-1000hard * conflictNightCount``.
   * A room can have a gender limitation: only females, only males, the same gender in the same night or no gender limitation at all. Weight: ``-50hard * nightCount``.
   * A department can have a minimum or maximum age. Weight: ``-100hard * nightCount``.
   * A patient can require a room with specific equipment(s). Weight: ``-50hard * nightCount``.
  
positive.code: 
  * Use a chessboard of _n_ columns and _n_ rows.
  * Place _n_ queens on the chessboard.
  * No 2 queens can attack each other. A queen can attack any other queen on the same horizontal, vertical or diagonal line.
  
  This documentation heavily uses the 4 queens puzzle as the primary example.
  
  A proposed solution could be:
  
  .A Wrong Solution for the 4 Queens Puzzle
  image::UseCasesAndExamples/partiallySolvedNQueens04Explained.png[align="center"]
  
  The above solution is wrong because queens `A1` and `B0` can attack each other (so can queens `B0` and ``D0``). Removing queen `B0` would respect the "no 2 queens can attack each other" constraint, but would break the "place n queens" constraint.
  
  Below is a correct solution:
  
  .A Correct Solution for the 4 Queens Puzzle
  image::UseCasesAndExamples/solvedNQueens04.png[align="center"]
  
  All the constraints have been met, so the solution is correct.
  Note that most n queens puzzles have multiple correct solutions.
  We'll focus on finding a single correct solution for a given n, not on finding the number of possible correct solutions for a given n.
  
  
  [[nQueensProblemSize]]
  
negative.code: 
  Hard constraints:
  
  * Exam conflict: two exams that share students must not occur in the same period.
  * Room capacity: A room's seating capacity must suffice at all times.
  * Period duration: A period's duration must suffice for all of its exams.
  * Period related hard constraints (specified per dataset):
  ** Coincidence: two specified exams must use the same period (but possibly another room).
  ** Exclusion: two specified exams must not use the same period.
  ** After: A specified exam must occur in a period after another specified exam's period.
  * Room related hard constraints (specified per dataset):
  ** Exclusive: one specified exam should not have to share its room with any other exam.
  
  Soft constraints (each of which has a parametrized penalty):
  
  * The same student should not have two exams in a row.
  * The same student should not have two exams on the same day.
  * Period spread: two exams that share students should be a number of periods apart.
  * Mixed durations: two exams that share a room should not have different durations.
  * Front load: Large exams should be scheduled earlier in the schedule.
  * Period penalty (specified per dataset): Some periods have a penalty when used.
  * Room penalty (specified per dataset): Some rooms have a penalty when used.
  