We consider the problem of self-organizing a linear list when the list is subjected to a random number of requests. Three separate move-to-front heuristics are considered. The difference between them lies in whether the items in the requested set are moved to the front in random order, or the same order as they were in originally, or in the order opposite to the one they were in originally. The eigenvalues of the transition probability matrices corresponding to the three heuristics are explicitly derived.
