anchor.diff:              end;
           false ->
               lager:debug("claimv3: Not enough nodes to run (have ~p need ~p), diagonalized\n",
  -                        [length(Claiming), TN]),
  +                        [length(Claiming), TN+1]),
               claim_diagonal(Wants, Owners, Params)
       end.
  -                
  +
   %% Claim diversify tries to build a perfectly diverse ownership list that meets
   %% target N.  It uses wants to work out which nodes want partitions, but does
   %% not honor the counts currently.  The algorithm incrementally builds the ownership
   %% list, updating the adjacency matrix needed to compute the diversity score as each
   %% node is added and uses it to drive the selection of the next nodes.
   claim_diversify(Wants, Owners, Params) ->
  -    TN = proplists:get_value(target_n_val, Params, 4),
  +    TN = proplists:get_value(target_n_val, Params, ?DEF_TARGET_N),
       Q = length(Owners),
       Claiming = [N || {N,W} <- Wants, W > 0],
       {ok, NewOwners, _AM} = riak_core_claim_util:construct(
  
positive.code: %% Claim nodes in seq a,b,c,a,b,c trying to handle the wraparound
  %% case to meet target N
  claim_diagonal(Wants, Owners, Params) ->
      TN = proplists:get_value(target_n_val, Params, 4),
      Claiming = lists:sort([N || {N,W} <- Wants, W > 0]),
      S = length(Claiming),
      Q = length(Owners),
  
negative.code: %% Lower diversity score is better, 0 if nodes are perfectly diverse.
  %%
  claim_v3(Wants, Owners, Params) ->
      TN = proplists:get_value(target_n_val, Params, ?DEF_TARGET_N),
      Q = length(Owners),
      Claiming = [N || {N,W} <- Wants, W > 0],
      Trials = proplists:get_value(trials, Params, 100),
  