I had this question pop into my head a few days ago and I've been thinking about it since. It has a fairly simple set up: you have 52 cards.
Take the amount of "shuffling" to be the average distance between where each card started, and where it ended up after the shuffle. For example, given $N$ cards, the maximum shuffling would be decided as:
$$\text{maximum shuffling} = \max \Bigg\{ \sum_{n=1}^{N} \frac{|\text{new}_n - \text{old}_n|}{N} \Bigg\}.$$
The old positioning of the card is arbitrary, they must simply be different, so I came up with:
$$\text{maximum shuffling} = \max \Bigg\{ \sum_{n=1}^{N} \frac{|f(n, N) - n|}{N} \Bigg\}.$$
Such that $f(n, N):(\mathbb{N} \leq N)\times \mathbb{N} \to \mathbb(\mathbb{N} \leq N)$ is bijective.
For $N=1$, the maximum shuffling is $0$. For $N=2$, the maximum shuffling is $1$. For $N=3$, the maximum shuffling is $\frac{5}{3}$.
I do not know what it is for $N=4$. My goal is to find $N=52$.
How would I go about this?