Poll
| 25 votes (47.16%) | ||
| 17 votes (32.07%) | ||
| 7 votes (13.2%) | ||
| 4 votes (7.54%) | ||
| 12 votes (22.64%) | ||
| 4 votes (7.54%) | ||
| 6 votes (11.32%) | ||
| 5 votes (9.43%) | ||
| 12 votes (22.64%) | ||
| 10 votes (18.86%) |
53 members have voted
May 8th, 2026 at 6:42:03 PM
permalink
Quote: Wizard
p.s. Why am I advised to capitalize Googleplex?
link to original post
I think "googolplex" is the number, and "Googleplex" is Alphabet City.
May the cards fall in your favor.
May 8th, 2026 at 9:19:01 PM
permalink
I think that the answer depends on how the location of the portal is chosen. I assume that either path is equally likely but the probability distribution of the distance along the correct path is important (and without a rigorous definition of this we can't calculate the expected distance traveled, so we can't minimize it).
The probability distribution can't be uniform because there can't be a uniform probability distribution over an unbounded set (you can have one over an infinite set, like all the real numbers between 0 and 1, but it needs to be bounded -- there's no uniform probability distribution over all the positive reals)
The probability distribution can't be uniform because there can't be a uniform probability distribution over an unbounded set (you can have one over an infinite set, like all the real numbers between 0 and 1, but it needs to be bounded -- there's no uniform probability distribution over all the positive reals)
May 8th, 2026 at 10:46:55 PM
permalink
This problem has already been posted twice before and never answered. Even the “googleplex” term was used. Formerly it was framed as an evil wizard in an infinite “but not completely infinite” desert. Don’t waste your time on itQuote: WizardAn Evil Wizard transports you to a distant planet, where you are placed at the beginning of two different paths. As in the Led Zeppelin song, there are two paths you may go down and there's always time to go back and switch to the other path any time you wish as many times as you wish.
Somewhere, on one of the paths, is a portal taking you back home.
The path with the portal has a finite but unknown distance (for example, an inch or a Googleplex light years). The other is infinitely long.
What strategy should you take to minimize the expected walking time to find the portal?
p.s. Why am I advised to capitalize Googleplex?
link to original post
It’s all about making that GTA

