Due to practical reasons the search was interrupted after a maximum of ??? Iterations. The question arises how to make a good estimation for the average resources necessary for a successful search when you have a dataset that contains searches that where interrupted. For this purpose we make the approximate assumption that there is a constant success probability for each search iteration.

...

(See [[subtopic-tree-average-number-of-viewed-terms-per-search-evaluation]])