Expected value maximizing sequential search rules can be expressed in terms of reservation values. In search with learning the reservation value at any stage of the search is unknown until that stage is reached. Thus calculating ex ante (and subsequent) probabilities of search duration and the offer accepted is difficult if these probabilities are expressed in terms of reservation values. This paper shows, for a wide class of learning procedures, how re-expressing these probabilities in terms of fixed points allows their direct calculation and, thereby, calculation of the expected value of adaptive search. Examples and comparative statics results are presented.