The expected number of pairwise comparisons needed to learn a partial order on n elements is shown to be at least /4 − (), and an algorithm is given that needs only /4 + () comparisons on average. In addition, the optimal strategy for learning a poset with four elements is presented