anchor.diff:      X,Y: SmallInt;
       Next: TElementPointer;
     end;
  +
   
   // Fast flood algorithm (Queue + for cycle instead of recursion)
     TKMQuickFlood = class
  
positive.code:   procedure TKMQuickFlood.MakeNewQueue();
    begin
      new(fStartQueue);
      fEndQueue := fStartQueue;
    end;
  
  
negative.code:   constructor TKMQuickFlood.Create(const aScanEightTiles: Boolean = False);
    begin
      fScanEightTiles := aScanEightTiles;
      fStartQueue := nil;
      fEndQueue := nil;
    end;
  
    destructor TKMQuickFlood.Destroy();
  