Abstract: Recently the problem of determining the minimum number of parity tests for finding two defectives remains open.This is a surprisingly difficult combinatorial problem.In this paper,we give three procedures(H-P,A-H-P and U-P)ard solve this problem perfectly.

Key words: model P, test-set, optimal scheme, information-theoretic bound