In a multinomial setting with a fixed number k of cells. the problem of screening out cells to find the "best" cell, i.e., the one with the smallest cell probability, or looking for a (small) subset of cells containing the best cell is revisited. An inverse sampling procedure is used, unlike past work on this problem ([l], [2], [3], and [4]). Finding the cell with the smallest cell probability is clearly more difficult than finding the one with the argest cell probability. The proposed procedure takes one observation at a time (as usual) and igns a zero to all those (and only those) k - 1 cells into which the observation does not fall Sampling continues sequentially and stops as soon as any one cell has accumulated r zeros.