Retrograde Analysis has been an important algorithm used for solving games by building a database of state-value pairs. The recent Setrograde Analysis algorithm builds a database of set-value pairs. For the game of Bridge, the results for computing the 32-card database using Setrograde Analysis are reported, showing a reduction of six orders of magnitude over Retrograde Analysis. The computation was performed using as many as 20,000 cores over several weeks. This paper discusses the issues of maximizing the parallelism, ensuring the accuracy of the results, and minimizing the human effort required to complete the computation. The results provide new insights into the requirements to complete the 52-card database.