This project allows you to construct triples from a set of people, so that each person is included in a triple with every other person only once.
One example of it is a Kirkman's schoolgirl problem, where it's required to set up daily walks for 15 schoolgirls in triples so that each schoolgirl would walk with every other schoolgirl exactly once.
Another example is setting up a tournament for a 3-player game, such as: Preferans and other card games, multi-player games like Monopoly, or one of 3-Player online games.
Other applications: Cooperative learning strategy for increasing interaction within classroom teaching, Progressive dinner party designs, Speed Networking events, Sports Competitions.