The malicious host: a minimax solution of the Monty Hall problem

The classic solution of the Monty Hall problem tacitly assumes that, after the candidate made his/her first choice, the host always allows the candidate to switch doors after he/she showed to the candidate a losing door, not initially chosen by the candidate. In viewof actualTV shows, it seems a more credible assumption that the host will or will not allow switching. Under this assumption, possible strategies for the candidate are discussed, with respect to a minimax solution of the problem. In conclusion, the classic solution does not necessarily provide a good guidance for a candidate on a game show. It is discussed that the popularity of the problem is due to its incompleteness.