Conjectures and sieve arguments predict a finite number of solutions.
If $x(x+1) = 2(n!)$, then for every prime power $p^a$ that exactly divides $2(n!)$, the value of $x$ modulo $p^a$ is either $0$ or $-1$. The "probability" of this is $\frac{2}{p^a}$ and the conditions are effectively independent of each other if the product of probabilities is taken for primes up to a cutoff $n^u$ for suitable $u<1$. The "expected number" of solutions (the sum of probabilities for all $n$) predicted in this way is a small finite number and therefore only a few solutions would be expected to exist.
This is also predicted by the ABC conjecture. $(x) + (1) = x+1$ is a decomposition of $x+1$, a number of size close to $\sqrt{2(n!)}$, into extremely smooth summands whose product of prime divisors is tiny in comparison.
None of this helps determine the precise set of solutions but they are presumed to be very rare.
According to the article
Florian Luca, THE DIOPHANTINE EQUATION P (x) = n! AND A RESULT OF M. OVERHOLT, GLASNIK MATEMATICˇKI Vol. 37(57)(2002), 269 – 273 ,
"finding all the solutions of the equation $x^2 − 1 = n!$ is a famously unsolved problem (see D25 in [R. Guy, Unsolved Problems in Number Theory]) which was first posed by Brocard in 1876 (see [3]) and also later by Ramanujan in 1913. Recent computations by Berndt and Galway (see [2]) showed that the largest value of n in the range n < 109 for which equation (2) has a positive integer solution x is n = 7."
There is no reason to think that $x(x+1)=2(n!)$ is easier to solve than $(x-1)(x+1)=n!$. In fact the Brocard/Ramanujan equation can be written as $y(y+4)=2(n!)$ with $y=2x-2$ and it would be very surprising if a method to solve one equation completely did not also solve the other.