On a Problem in Shuffling

Upper and lower bounds are obtained for the number of shuffles necessary to reach the “furthest” two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2 n)/2 and log log n, respectively.