How to solve Pyramid solitaire (work in progress)

How to solve Pyramid solitaire (work in progress)

There are 52 cards in the pyramid solitaire, out of which 28 are in visible in the form of a pyramid, while the remaining 24 are stacked together in an unknown order. So, by looking at the visible cards, we can know what is there in the stacked ones.

The version of Pyramid Solitaire that I am interested in right now is where it is possible to go through the stacked cards three times.

Now, A can annihilate Q, 2 can annihilate J and so on. In good interest, one wants to annihilate the cards already in the pyramid with each other, so that the stacked cards options don't get exhausted.

Here is the instruction to solve or find whether the card stack is solvable or not-

1. Make a list of A, 2, 3,... , Q and note how many of these cards are there in the pyramid.
2. If there are x A's and y Q's in the pyramid, then there has to be at least $z=x+y-4$ links between A and Q within the pyramid, which means that at least z number of pairs of A and Q must annihilate themselves within the pyramid itself. This restriction for all the other pairs puts an upper limit to the score in the solitaire as well as reducing the possible solution space to be scanned.
3. Note that it is possible for a pyramid to compulsorily have no links within if sum of each of its pairs is 4 and there are also 4 kings in the pack, which will add up to 28. Also note that if there are less than 4 kings, then at least one compulsory interlink exists.