An optimum search strategy for PN acquisition, i. e. maximum probability search strategy, is analysed in this paper.

Not only can we never find the "perfect" punishment, our search for optimum penalties is complicated by our desire for fairness: to let the punishment fit the crime.

The adoption of remembrance-guided search method emphasizes local optimum value in each remembrance segment, which avoids the blindness of global search.