For this issue the puzzle is to determine the smallest number of rounds in a tournament in which each player plays every other exactly once. Note that no one can play two opponents at the same time and an odd number of participants will mean someone has to sit out each round. Find the smallest number of rounds needed for tournaments with 6, 7, and 8 players.