Let n and ℓ be positive integers. Recent papers by Kreher, Stinson, Veitch have explored variants of the problem ordering points in a triple system (such as Steiner [STS], directed system, or Mendelsohn system) on so that no block occurs segment consecutive entries (thus is locally block-avoiding). We describe greedy algorithm which shows such an exists, provided sufficiently large when compare...