This paper first defines the bridge club scheduling problem that was presented to the author and then explores the meaning of an optimal solution. Next, an analytical solution is sought based on the classification of the problem as a resolvable partially balanced incomplete block design. Finally, four increasingly sophisticated techniques of discrete optimization are examined. (16 references) (Author/JJK)