anchor.diff:    for I := 0 to Length(StartPolygons) - 1 do
     begin
       StartPolygon[0] := StartPolygons[I];
  -    if aClean AND (I = 0) then // First start polygon of first player
  +    if (aClean OR (Length(fQueueArray) <= 0)) AND (I = 0) then // First start polygon of first player
         InitQueue(0, StartPolygon)
       else
       begin
  
positive.code: var
    K,L: Integer;
  begin
    Result := Length(aStartPolygons) > 0;
    for K := Length(aStartPolygons)-1 downto 0 do
      for L := 0 to fAllDefLines.count-1 do
        if (aStartPolygons[K] = fAllDefLines.Lines[L].Polygon) then
  
negative.code:         SetLength(aStartPolygons, Length(aStartPolygons)-1);
          break;
        end;
    Result := Length(aStartPolygons) > 0;
  end;
  
  
  