Tverberg's theorem is a celebrated result in geometric combinatorics relating to the intersection of convex hulls of points in space. It has been made colorful, topological, dualized, and generalized in various other ways throughout the years. In this talk we go over some of these versions and explore the methods used to prove them, as well as some of the constraints that arise in the process.