In the game of spades, a standard deck is shuffled then all the cards are dealt in a clockwise manner until each of the 4 players has 13 cards. The first play of the game is for each player to throw their lowest club (clubs are ordered from low to high: 2,3,4,...,Queen,King,Ace).
When all four lowest clubs are on the table, the player who threw the highest of those four cards wins the "trick" but if a player has no clubs, he or she must play a heart or a diamond, and that card has no chance of winning the trick. If a player has no clubs, no hearts, and no diamonds, then the player must play a spade, and will be guaranteed to win the trick.
I simulated this game by counting how many times a specific card won and I divided it by the number of tricks and I got a winning probability of 0 with the card 2 of Clubs, I got an approximate probability of 9.15 with 10 of Clubs, 3.59 with King of Clubs, and 11.98 with 9 Clubs but now I want to solve it mathematically. I think simulation is way too complicated because I have simulate 1,000,000 tricks or more to get closer to the true value.