I've recently written a paper (accepted to ModRef 2024) on this exact topic. We used a programming technique called constraint progamming to find "blocked" layouts - a provably unsolvable layout requiring a card to move before itself (impossible). This can generate some quite complex layouts which are provably unsolvable:
In the above, assume that the four kings and two black sixes are available to be played in the stock. The seven piles in the top of the image represent the tableau. Relevant face-down cards have been shown as face-up for clarity (e.g. 7 of hearts).
We estimated the upper bound for the number of games of non-thoughtful (position of the face-down cards is unknown) deal-3 Klondike solitaire to have a 95% confidence interval of 81.942 ± 0.081%. This is the "most popular" variant of Solitaire.
This suggests 18.058 ± 0.081% cannot be solved, regardless of the moves made.