anchor.diff:              #delay_bounded{bound = Bound};
             none ->
               case ?opt(dpor, Options) =:= optimal of
  -              false -> {recursive, branch};
  +              false -> {recursive, one_step};
                 true -> {recursive, tree}
               end;
             _ ->
  
positive.code:                 {ok, More} -> [L|More]
                end,
              Sum = lists:sum(AllExplored),
              Average = Sum / length(AllExplored),
              AllPlanned =
                case dict:find(M, Planned) of
                  error -> 0;
                  {ok, P} ->
                    Mult =
                      case Subtree of
                        branch -> P;
                        tree -> math:log(P) + 1
                      end,
                    Mult * Average
                end,
              Sum + AllPlanned
          end,
  
negative.code: 
  -type estimation_style() ::
          {'hard_bound', pos_integer(), estimation_style()} |
          {'recursive', 'one_step' | 'tree'} |
          #delay_bounded{} |
          'unknown'.
  
  