anchor.diff:  ** Configure a <<partitionedSearch,Partitioned Search>>.
   * *Multithreaded incremental solving*: solve 1 dataset with multiple threads without sacrificing <<incrementalScoreCalculation, incremental score calculation>>.
   ** Donate a portion of your CPU cores to Planner to scale up the score calculation speed and get the same results in fraction of the time.
  +** Configure <<multithreadedIncrementalSolving,multithreaded incremental solving>>.
   
   image::OptimizationAlgorithms/multiThreadingStrategies.png[align="center"]
   
  
positive.code: <moveThreadCount>4</moveThreadCount>
  ----
  +
  This can be `1` to enforce running the multithreaded code with only 1 move thread.
  * JavaScript formula: Formula for the number of move threads to run in parallel. It can use the variable ``availableProcessorCount``. For example:
  +
  [source,xml,options="nowrap"]
  
negative.code: <moveThreadCount>(availableProcessorCount / 2) + 1</moveThreadCount>
  ----
  
  It is counter-effective to set a `moveThreadCount`
  that is higher than the number of available CPU cores,
  as that will slow down the score calculation speed.
  One good reason to do it anyway, is to reproduce a bug of a high-end production machine.
  
  