Chess Tournament: Review the Rating Evidence

• ○A. The organizer has data for the whole population of interest.
• ○B. The organizer can use these records to describe all chess players.
• ○C. The organizer has a random sample because ratings are numbers.
• ○D. The organizer must select a sample before describing the entrants.

• ○A. The number of moves in all games played at other clubs.
• ○B. The number of moves in games played at this tournament.
• ○C. The current ratings of everyone who plays chess in town.
• ○D. The current ratings of players entered in this tournament.

• ○A. Update the list to include everyone before selecting randomly.
• ○B. Select more names at random from the early-registration list.
• ○C. Use only the early registrants with the most recent ratings.
• ○D. Ask the early registrants to suggest players for the sample.

• ○A. Select the 16 IDs belonging to the highest-rated entrants.
• ○B. Draw 16 different IDs randomly from all 96 possible IDs.
• ○C. Select IDs 1 through 16 because they are easy to locate.
• ○D. Draw 16 different IDs randomly from IDs 1 through 48.

The sample can include both lower-rated and higher-rated entrants.The sample must contain the tournament's highest-rated entrant.The sample's average rating must equal the full roster's average rating.The method avoids choosing entrants because of their ratings.

• ○A. The remaining group represents everyone because losses are recorded.
• ○B. The remaining group improves the sample because fewer records remain.
• ○C. The remaining group may favor stronger players because losses affect inclusion.
• ○D. The remaining group is still random because the first step was random.

• ○A. Many lower-rated entrants cannot be selected from the directory.
• ○B. Every higher-rated entrant will automatically enter the sample.
• ○C. A directory cannot be used for any kind of random selection.
• ○D. The two rating groups must have equal numbers of entrants.

• ○A. Prize winners cannot answer questions about their opponents.
• ○B. Random selection requires using game records instead of people.
• ○C. A sample must include every entrant to provide useful evidence.
• ○D. Entrants who won no prize have no chance of being represented.

• ○A. The results prove that every entrant used a rating to set a goal.
• ○B. The results prove that entrants with higher ratings set better goals.
• ○C. The results suggest that many tournament entrants found ratings useful.
• ○D. The results establish how every chess club member sets tournament goals.

Put one identical slip per tournament win into a container, mix thoroughly, and draw one slip.Put one identical slip per entrant into a container, mix thoroughly, and draw 15 slips without replacement.Use a computer to choose 15 distinct IDs randomly from the complete entrant roster.Invite entrants to volunteer and use the first 15 volunteers.

• ○A. Chance selection makes the smallest sample identical to the population.
• ○B. Chance selection ensures that every rating appears equally often.
• ○C. Chance selection prevents any unusual group from entering the sample.
• ○D. Chance selection avoids systematically favoring entrants with particular traits.