This work calculates optimal strategies for variants of the card game Contract Whist. Specifically, we investigate strategies for a two-player zero-sum version known as Mercer Whist. Our approach employs a computational framework based on sequence form game representation and formulates the problem as a linear program (LP). By extending methods developed for simpler games such as Kuhn poker, we provide a foundation for exploring more complex game variants and briefly discuss the computational challenges associated with solving for strategies in such games. Finally, we propose directions for next expanding game complexity and suggest potential methods for managing computational constraints.