 Let us apply this solution concept to Selten’s Horse. Consider again the NE (R, r2, r3). Suppose that Player III assigns pr(1) to her belief that if she gets a move she is at node 13. Then Player I, given a consistent μ(I), must believe that Player III will play l3, in which case her only SE strategy is L. So although (R, r2, l3) is a NE, it is not a SE. 