The current state of knowledge concerning the existence of blocking set free configurations is given together with a short history of this problem which has also been dealt with in terms of digraphs without even dicycles or 3-chromatic hypergraphs. The question is extended to the case of nonsymmetric configurations (vr, b3). It is proved that for each value of r ≥ 3 there are only finitely many values of v for which the existence of a blocking set free configuration is still unknown.
