anchor.diff:  			stop -> exit(normal)
   		    end;
   		false ->
  -		    Prepare = fun(E) -> worker_prep(E, Opts) end,
  -		    IsNew = fun(E) -> is_new(E, Opts) end,
   		    NextEntries = next_entries(Env, FilteredState, Opts),
  -		    PrepedEntries = lists:map(Prepare, NextEntries),
  +		    PrepedEntries = [worker_prep(E, Opts) || E <- NextEntries],
   		    NewEntries =
   			case Opts#opts.precheck of
  -			    true  -> lists:filter(IsNew, PrepedEntries);
  +			    true  -> [E || E <- PrepedEntries, is_new(E, Opts)];
   			    false -> PrepedEntries
   			end,
   		    coordinator ! {entries, NewEntries, self()},
  
positive.code: 		false -> Moves
  	    end;
  	false ->
  	    IsNew = fun(E) -> is_new(E, Opts) end,
  	    CompressEntry = fun(E) -> compress_entry(E, Opts) end,
  	    Entries = next_entries(Env, State, Opts),
  	    Entries2 = case Opts#opts.solution of
  			   true  -> Entries;
  			   false -> [trim_backstep(E) || E <- Entries]
  		       end,
  	    NewEntries = lists:filter(IsNew, Entries2),
  	    CompNewEntries = lists:map(CompressEntry, NewEntries),
  	    hash_insert(CompNewEntries),
  	    NewStates = [get_state(E) || E <- NewEntries],
  	    bfs_serial(Moves, Env, Rest, NewStates ++ NextOpen, Opts)
  
negative.code: 		    _ ->
  			States
  		end,
  	    NewEntries = [E || E <- Entries, is_new(E, Opts)],
  	    PrepedNewEntries = [coord_prep(E, Opts) || E <- NewEntries],
  	    hash_insert(PrepedNewEntries),
  	    NewStates = [get_state(E) || E <- NewEntries],
  	    NumNewStates = length(NewStates),
  