Searching with Local Constraints on Error Patterns

We give an asymptotically optimal algorithm of search for an unknown element in a finite set under the assumption that at most one error can occur in every sequence of r consecutive answers, where r ⩾ 3 is a constant.