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