anchor.diff:          begin
             Dec(FI.Count);
             FI.Forests[K] := FI.Forests[ FI.Count ];
  -          break;
  +          Break;
           end;
     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:     begin
        X := aLoc.X + Tiles[K].X;
        Y := aLoc.Y + Tiles[K].Y;
        Tree := Tree + Ord(gTerrain.ObjectIsChopableTree(KMPoint(X,Y), [caAge1, caAge2, caAge3, caAgeFull]));
        Road := Road + Ord(tpWalkRoad in gTerrain.Land^[Y, X].Passability);
      end;
    Result := Tree * AI_Par[PLANNER_ObstaclesInHousePlan_Tree] + Road * AI_Par[PLANNER_ObstaclesInHousePlan_Road];
  end;
  