The object of the game is to remove play solitaire free pairs of cards that add up to the total of the highest card in the deck from a Pyramid arrangement of 28 cards. We’ve selected an example from our collection of different styles of solitaire rings. E.g., My own solver can play about 500 full games per second on fairly old hardware, so that’s probably the easiest way (programming effort-wise) to do it. I’m just guessing, though. But a much…