anchor.diff:    end;
   
   
  -// Fast flood algorithm (Queue + for cycle instead of recursion)
  +  // Fast flood algorithm (Queue + for cycle instead of recursion)
     TKMQuickFlood = class
     private
       fStartQueue, fEndQueue: PElement;
  
positive.code:     procedure SearchAround(aX,aY: SmallInt); virtual;
    public
      constructor Create(const aScanEightTiles: Boolean = False); virtual;
      destructor Destroy(); override;
      procedure QuickFlood(aX,aY: SmallInt); virtual;
    end;
  
  
negative.code: 
  procedure TKMQuickFlood.QuickFlood(aX,aY: SmallInt);
  begin
    MakeNewQueue;
    if CanBeVisited(aX, aY) then
      InsertInQueue(aX, aY);
    while not IsQueueEmpty do
  