3 ms·
I am oddly reminded of Pollard's rho algorithim[1], you start with a base image and only choose the first image that comes up in the result, in the end we will
by shubhamjain 11y ago
I am oddly reminded of Pollard's rho algorithim[1], you start with a base image and only choose the first image that comes up in the result, in the end we will eventually return to an image that we have already traversed. I wish someone could find the base images that result in the shortest and longest cycles.
[1]: https://upload.wikimedia.org/wikipedia/commons/4/47/Pollard_rho_cycle.jpg https://upload.wikimedia.org/wikipedia/commons/4/47/Pollard_...
- accounthere 11y agoMy guess is the shortest would usually be the very next one since Google Image is good at finding the same image file in different websites. There would have to be a constrain for how close to the last image the next one is or you'd end up in a one image loop.