algorithms – When is the expected time of a move to front list equal to that of an optimal list


When is the expected time of a move-to-front list equal to that of an optimal list?

My thinking is that it is when the move-to-front list happens to be arranged as an optimal list, but since the expected time takes the average over multiple times, this doesn’t really make sense. My only other thinking was the trivial case when the list has only one element.