There are N options, the host removes one option with the (presumed) constraint that they only can remove one of n-1 options which aren’t true. What’s the remaining probability? Monty has a further constraint that he can’t remove the one you picked, but it’s very a similar underlying calculation.
Also identical in that common formulations are ambiguous about the rules for guard/monty to eliminate an option, leading to irksome and unnecessary controversy.
The whole thing is basically the Monty Hall problem.
How is it related to Monty Hall?
There are N options, the host removes one option with the (presumed) constraint that they only can remove one of n-1 options which aren’t true. What’s the remaining probability? Monty has a further constraint that he can’t remove the one you picked, but it’s very a similar underlying calculation.
Also identical in that common formulations are ambiguous about the rules for guard/monty to eliminate an option, leading to irksome and unnecessary controversy.