What you are looking for is called the secretary problem [0]. This states that in a search like yours, you can determine beforehand how often you are willing to

What you are looking for is called the secretary problem [0]. This states that in a search like yours, you can determine beforehand how often you are willing to press "another", and after 37% of attempts, you pick the first one that's better than the best one so far. [0] https://en.m.wikipedia.org/wiki/Secretary_problem https://en.m.wikipedia.org/wiki/Secretary_problem