A prize is behind one of d doors, each equally likely; you pick door 1. The host opens doors that you did not pick and offers a switch to the door left closed. Whether switching helps depends on the host's rule, because the rule decides the probabilities of the outcomes ω = (prize door, door left closed). The table lists that sample space; what you see (which door was opened, and that it was empty) is an event, and conditioning on it is all there is to the problem.
You always pick door 1. Standard host: he knows where the prize is and opens every other door except one, never the prize; when the prize is behind door 1 he leaves one of the others closed at random. Preferring host (three doors): the same, but with the prize behind door 1 he opens door 2 with probability q. Ignorant host: he leaves a random other door closed and opens the rest; games in which he reveals the prize are dropped, so we condition on seeing only empty doors.
code/ch01_probability.py (monty_exact, which lists the sample space with exact fractions, and monty_demo_sim).