anchor.diff:    </constructionHeuristic>
   ----
   
  -[NOTE]
  -====
  -If the <<initializingScoreTrend,InitializingScoreTrend>> is ``ONLY_DOWN``, this algorithm is faster: for an entity, it picks the first move for which the score does not deteriorate the last step score, ignoring all subsequent moves.
  -====
  -
  -For advanced configuration, see <<allocateEntityFromQueue,Allocate Entity From Queue>>.
  +Advanced configuration:
  +
  +[source,xml,options="nowrap"]
  +----
  +  <constructionHeuristic>
  +    <constructionHeuristicType>FIRST_FIT_DECREASING</constructionHeuristicType>
  +    <...MoveSelector/>
  +    <...MoveSelector/>
  +    ...
  +  </constructionHeuristic>
  +----
  +
  +For scaling out, see <<scalingConstructionHeuristics,scaling construction heuristics>>.
  +For a very advanced configuration, see <<allocateEntityFromQueue,Allocate Entity From Queue>>.
   
   
   [[weakestFit]]
  
positive.code: 
  The `entitySorterManner` and `valueSorterManner` options are described in <<allocateEntityFromQueue,Allocate Entity From Queue>>.
  
  Advanced detailed configuration.
  For example, a Cheapest Insertion configuration for a single entity class with a single variable:
  
  [source,xml,options="nowrap"]
  ----
  
negative.code:   </constructionHeuristic>
  ----
  
  Advanced configuration:
  
  [source,xml,options="nowrap"]
  ----
    <constructionHeuristic>
      <constructionHeuristicType>STRONGEST_FIT_DECREASING</constructionHeuristicType>
      <...MoveSelector/>
      <...MoveSelector/>
      ...
    </constructionHeuristic>
  ----
  
  For scaling out, see <<scalingConstructionHeuristics,scaling construction heuristics>>.
  For a very advanced configuration, see <<allocateEntityFromQueue,Allocate Entity From Queue>>.
  
  
  [[allocateEntityFromQueue]]
  