Given a square grid of size $n \times n$, how many paths are there from one corner to a diagonally opposite corner?
I searched OEIS but was only able to find this. The numbers there reflect only non-intersecting paths. I'm interested in all paths.
A path may not traverse any edge it has previously traversed.
Only rook moves allowed.