anchor.diff:    for HT := HOUSE_MIN to HOUSE_MAX do
       for K := 0 to fPlannedHouses[HT].Count - 1 do
         with fPlannedHouses[HT].Plans[K] do
  -        House := gHands.GetHouseByUID( Cardinal(House) );
  +        House := gHands.GetHouseByUID(Cardinal(House));
   end;
   
   
  
positive.code:       with fPlannedHouses[HT].Plans[I] do
          if (House <> nil) then
            gHands.CleanUpHousePointer(House);
    fRoadPlanner.Free;
    fRoadShortcutPlanner.Free;
    fFieldEval.Free;
    inherited;
  end;
  
  
negative.code:                   //+ Byte(IsRoad(AvoidBuilding,Point)) * GA_PLANNER_SnapCrit_SnapToRoads;
        end;
    Output := Output
              - Ord(IsReservedField( gAIFields.Influences.AvoidBuilding[aLoc.Y+1,aLoc.X] )) * AI_Par[PLANNER_SnapCrit_ObstacleInEntrance]
              + Ord(IsRoad( gAIFields.Influences.AvoidBuilding[aLoc.Y+1,aLoc.X], aLoc )) * AI_Par[PLANNER_SnapCrit_RoadInEntrance];
    Result := Output;
  end;
  
  