Assume that the number of doors which conceal a prize each lead down a multitude of different paths. Imagine the Monty hall problem extended. version, where each door has a another set of n doors behind it.The initial probability of chosing the correct path on the first try should be 1/n with n representing the amount of finial doors which each path leads to.
My question is, assuming that the host reveals a incorrect path, where will it be most optimal to switch (or does it matter); meaning at which level should one switch at? Please include variables like if the host was to reavel a path in the domain [domain=level 1 doors: A,B,C,...,N] of your original guessed path, versus a seperate domain.