A map method, similar to Boolean-algebra-type truth maps, is presented for solving probability combinatorial problems. This map technique is shown to be of universal application and simplicity, being equally useful for both series-parallel and nonseries-parallel types of probability combinations. Moreover, it is extendable, in two dimensions, to any finite number of variables.