In decision theory this cornfield has a formal name: the secretary problem (optimal stopping). Let N ears arrive in random order, with the first r observed only. If the overall biggest sits at position k (k > r), you pick it only if the biggest of the first k−1 falls inside the observation window — probability r/(k−1).
Summing over positions: P(r) = Σₖ (1/N)·(r/(k−1)), for k from r+1 to N.
Let x = r/N. For large N the sum becomes an integral: P(x) = −x·ln x.
Set the derivative to zero: −ln x − 1 = 0, so x = 1/e ≈ 36.8%, and the success probability is also 1/e ≈ 37% — the global maximum.
The strategy cannot guarantee the biggest ear. But under "decide on sight, no walking back", it pushes your odds to the theoretical ceiling.