Scrapebox V 2.1.0.25
My settings for Custom or detailed harvester
1 thread, no proxies, 20 second delay

I have tried with several simple keywords eg Ford Explorer, University Entrance

I have tried Google, Bing and Yahoo.

I get zero results.

Even with just one keyword in the keywords list.

Same searches in my browser return results as expected – no captcha request form google.

Broken link checker with 1 thread returns hundreds of results in seconds

Any suggestions?

======
Also tried several times with “use server proxies” which returns ~”no proxies found”

## How to the plot results of a differential equation

Please help me to plot the solution of a differential equation as a parameter of Delta. Here is what I’ve tried.

``(**Constants**)  tin := -50; tfin := 50; t := 0.05; v := 1;  (**Solve differential equation**)  sol = NDSolve[Delta == Module[{x0},   Table[x0, {x0, 0, 10}]],   {I y1'[t] == v t y1[t] +     Delta y2[t], I y2'[t] == -v t y2[t] + Delta y1[t], y1[tin] == 1, y2[tin] == 0}, {y1, y2}, {t, tin, tfin}];  (**Probability**)  Prob1[t_] :=        Re[Evaluate[y1[t] /. sol]]^2 + Im[Evaluate[y1[t] /. sol]]^2;  (**we need to plot this result as a function of delta**)  a = Plot[{Prob1[t]}, {Delta, -10, 10}] ``

## Postprocessing the results of NDSolve for analysis of structures

So, I get the deformations on solving a model of a structure using NDSolve. Now, does Mathematica have post-processors to retrieve the strains and stresses or is it up to me to implement that part?

I could not find anything about retrieving the stresses in the documentation. Am I missing something?

## Need help with my risk game program – i need to insert 2 players, throw x number of dices, order them and confront the results of the 2 players

namespace ConsoleApp8 { class Program { static List names; static List dices; // [2, 3] static List player1Dices = new List(); static List player2Dices = new List();

``    static List<string> PromptNames()     {         Console.Write("Nome del primo giocatore: ");         string player1 = Console.ReadLine();         Console.Write("Nome del secondo giocatore: ");         string player2 = Console.ReadLine();          List<string> names = new List<string>();          names.Add(player1);         names.Add(player2);         return names;     }      static int GetDieValue(string x, string msg)     {         Console.Write("{0}, {1} ", x, msg);         string rawDie = Console.ReadLine();         int parsedDie;         // qui devi usare do, while perché non sai a priori quante volte un giocatore potrebbe inserire un valore sbagliato         if (!Int32.TryParse(rawDie, out parsedDie))         {             Console.WriteLine("Meti un numero");             return GetDieValue(x, msg);         }         return parsedDie;     }      static List<int> PromptDices()     {         int p1Dices = GetDieValue(names[0], "con quanti dadi vuoi attaccare?");         int p2Dices = GetDieValue(names[1], "con quanti dadi ti vuoi difendere?");          return new List<int>() { p1Dices, p2Dices };     }     static void Play()     {         Console.WriteLine("{0} attacca con {1} dadi", names[0], dices[0]);         Console.WriteLine("{0} difende con {1} dadi", names[1], dices[1]);         CalculateResult();      }     static void CalculateResult()     {         System.Random random = new System.Random();         for (int i = 0; i <= dices.Count; i++)         {             player1Dices.Add(random.Next(1, 7));         }         Console.WriteLine("Prima: {0}{1}{2}", player1Dices[0], player1Dices[1], player1Dices[2]);         player1Dices = player1Dices.OrderByDescending(x => x).ToList();         Console.WriteLine("Dopo: {0}{1}{2}", player1Dices[0], player1Dices[1], player1Dices[2]);           for (int i = 0; i <= dices.Count; i++)         {             player2Dices.Add(random.Next(1, 7));         }         Console.WriteLine("Prima: {0}{1}{2}", player2Dices[0], player2Dices[1], player2Dices[2]);         player2Dices = player2Dices.OrderByDescending(x => x).ToList();         Console.WriteLine("Dopo: {0}{1}{2}", player2Dices[0], player2Dices[1], player2Dices[2]);      }         private static void PlayAgain(string x)     {         Console.WriteLine("Se vuoi finire il gioco scrivi Exit");         string Exit = x;         do         {             RunGame();             player1Dices.Clear();             player2Dices.Clear();         }         while (x != Console.ReadLine());                }      static void RunGame()     {         names = PromptNames();         dices = PromptDices();         CalculateResult();         Play();         PlayAgain();                          // generate random numbers - and sort them         // display results - compare dices         // repeat or quit?     }      private static void PlayAgain()     {         throw new NotImplementedException();     }      static void Main(string[] args)     {         RunGame();         Console.WriteLine("Thanks for playing");         Console.ReadKey();     } } ``

}

## How to conduct SEO Audit of website to get more accurate results?

I want to analyze and to get the worth of this website > https://www.cpstest.us/

My concern is to evaluate this site for earning potential as well as to analyze which tool is a better performer. As there are 11 tools available on this website. I want to start with the most useful tool to build a website like this one. unfortunately, I’m not an SEO expert and don’t know which tool is providing accurate results. I tried many online websites in order to get the desired result. But these results are far more different from each other which making me more confused. If anyone can help in this regard that would be highly appreciated. Thanks in Anticipation

## Intermediate results from SatisfiabilityInstances

I have a large logical expression, with roughly 100 boolean variables. I am interested in the solution with the smallest numbers of `True`. It seems there is no such option, thus I use `SatisfiabilityInstances`, searching for a large number of instances:

`sf = SatisfiabilityInstances[FinalExpression, BooleanVariables[FinalExpression], 100000, Method -> "SAT"];`

Afterwards, I search manually for the instance with the smallest number of True.

Question1: Is there a way to obtain the solution with smallest number of True in a more efficient way?

Question2: Is there a way to monitor the intermediate results of `SatisfiabilityInstances`? For instance, that it periodically prints how many solutions its already found (and its truth values)

## How “Serious” is the Core Web Vitals update? All my competitors have the same results

I know that Google algo (publicly released) updates are just recommendations but how "seriously" are you taking Core Web Vitals update May 1st?

This is a rolling-update spread over a month, but my question is this: all our competitors (we are in mass/large-scale eCommerce) hover at the same bad results, basically all performing "badly" in the results (GMetrix and Google PageSpeed)….

Now, I know that there is a difference between "Lab" and "Field" data but still – how seriously should we be taking this?

We rank for half a million keywords and I can’t imagine us being knocked down the rankings because we score low on a lab-testing machine?

## Users (erroneously) type a short URL in the Google search box instead of the address bar. How to make it navigate instead of showing search results?

I’m using a URL shortener to publish pronounceable URLs for my pages so I can tell people something like, "Visit mydomain.com/slug to solve that problem." If people go to the address bar of their browser and enter mydomain.com/slug URL there, then the shortened URL works, and it redirects them to the intended destination page. But if a non-technical user goes to the Google search page and enters mydomain.com/slug into the search box there, apparently, Google apparently isn’t smart enough to recognize that they typed in a URL. It tries instead to search for the URL as keywords and comes back with a list of search results.

When I click "New Tab" in my browser, I know the difference between the address bar and the search box, but many non-technical users don’t, and Google gives the same instructions in both places. Both locations claim to accept both search terms and URLs, but apparently they have different logic for determining which is which. For them to behave differently and not follow the URL when it’s typed into the search box instead of the browser address bar seems to be a fatal flaw in the entire concept of shortened URLs – unless there’s something else I can do to make them work regardless of which field someone types them into. Certainly I can’t be the only one facing this.

What can I do to teach Google that my shortened URL is indeed a URL and when someone types it in the search box, it should go to the place where that URL redirects to?

## When does google remove an entire domain from search results?

What I need to know is that, what does a certain website have to violate in order to get its domain removed completely from Google Search?

I am asking because I’ve seen websites infringing on DMCA protected content (Books, Movies, etc) having their domain removed from google, so they purchase another one and redirect the old domain to the new one.

But at the other hand, there are many websites of such type never got their entire domain removed from Search Results (Only infringing URLs got removed) although they’ve been running their sites for years, have a lot of popularity and there are tons of DMCA reports filed against them monthly.

So can you please explain how does Google behave in matters of domain removals?

## Page Scanner is not recording Results

Basically, I’ve created some footprints and the Page Scanner scans and says it’s completed but there are no results.

Here’s a video with more details: https://share.getcloudapp.com/7KupZAge

As far as I can tell, I’ve set everything up correctly.