Three Prisoners problem

The Three Prisoners problem is a classic problem in probability and decision theory that illustrates interesting aspects of conditional probability and the paradoxes that can arise in such situations. Here's a typical formulation of the problem: Three prisoners, A, B, and C, are each assigned a number (1, 2, or 3) by a warden, but they do not know their own numbers.