Honestly, I am just plain stuck, I have been hitting my head against it for $2$ days straight. I know the solution should be $2^{-2}$ but...
Help would be appreciated. If anyone has a Wolfram Alpha PRO account I am sure that thing churns out the solution as it is something quite basic I just don't see it and its driving me crazy.
Edit: Stacks seemed to correct my formating from this sloppy one "Limit[(2 n)! n^n (E^n/(n! (2 n)^(2 n))), n -> Infinity]" $\displaystyle\lim_{n \to \infty} \frac{(2 n)! e^n (n)^n}{n! (2 n)^{2 n}}$
to this one $\displaystyle\lim_{n \to \infty} \frac{(2 n)! (n)^n}{n! (2 n)^{2 n}}$ somewhere dropping the $e^n$ term. I should have learned to propperly use latex in stackexchange first.
When I see a problem of limits with factorials, I immediately think about Stirling approximation
$$\log(p!)=p (\log (p)-1)+\frac{1}{2} \left(\log (2 \pi )+\log \left(p\right)\right)+O\left(\frac{1}{p}\right)$$
$$A_n=\frac{(2 n)! (n)^n}{n! (2 n)^{2 n}}\implies \log(A_n)\sim\log((2n)!)+n\log(n)-\log(n!)-2n\log(2n)$$ Applying the formula and simplifying leads to $$\log(A_n)\sim \frac{\log (2)}{2}-n$$ from which you can easily conclude.