anchor.diff:    //  printfn "all children:\n%s\n*******" (String.concat "\n=======\n" lines)
     let allNodes = (List.concat revertedResult)
     let best = List.minBy snd allNodes
  -  reporter.finish allNodes best
  +  reporter.finish (allNodes |> List.length) best
     best
   
   type HashSet<'a> = System.Collections.Generic.HashSet<'a>
  
positive.code:           temprature <- temprature * 0.95
            (nextChild, nextChildCost) :: acc) [e, costModel e] range
    let best = (currentBest, currentBestCost)
    reporter.finish revertedResult best
    best
  
negative.code:     currentLevelNodes.UnionWith(nextLevelNodes)
  
    let best = allNodes |> Seq.minBy costModel
    let bestWithCost = best, costModel best
  
    reporter.finish (allNodes |> Seq.length) bestWithCost
  
    bestWithCost
  
  
  (* Beam Search Algorithm *)
  