Use visible clues to match three people with three snacks and three arrival slots.
Ari, Bo and Cam each bring one different snack: apples, bread or cheese. They arrive in slots 1, 2 and 3, one person per slot. Everyone brings exactly one snack and every snack is used once. Names are fictional labels. Place the five clue cards in view and keep the host answer separate. One to six people can solve a shared sheet.
Bo arrives second. The bread carrier arrives immediately before the cheese carrier. Ari does not bring bread. Cam does not bring cheese. Apples arrive last. “Immediately before” means consecutive arrival slots, not necessarily adjacent seats. Do not add assumptions about food preferences, names or who would normally arrive first. The puzzle uses only these printed facts.
Use one grid for people versus snacks and another for people versus slots. Put a cross for impossible pairs and a circle for confirmed pairs; every row and column ends with one circle. Start by circling Bo/2 and crossing Bo/1, Bo/3, Ari/2 and Cam/2. This opening is shown separately as a teaching example, not prefilled into the blank solving grids.
Bread and cheese must occupy slots 1–2 or 2–3. If bread were in slot 1, Bo would carry cheese in slot 2; Ari would then need apples, leaving Cam with bread in slot 1 and Ari in slot 3. Check every clue rather than stopping after one plausible row. The alternative puts cheese last, conflicting with apples arriving last; the host sheet explains both cases.
The unique solution is Cam: bread, slot 1; Bo: cheese, slot 2; Ari: apples, slot 3. Read each of the five clues back against the complete assignment. Stop when all pairs are checked or after the agreed fifteen minutes. Rotate the pencil among teammates, and offer to read the clues aloud. It is a fictional logic task, not a test of actual guests’ punctuality or eating habits.
Preview at 100% scale, with browser headers and footers off. Cut with suitable help. Keep host keys separate. This is a manual tabletop kit, not an online opponent, automatic judge or solver.
Each person has one different snack and one different arrival slot. Use all three of each.
Names: Ari, Bo, Cam. Snacks: apples, bread, cheese. Slots: 1,2,3.
| Person | apples | bread | cheese |
|---|---|---|---|
| Ari | |||
| Bo | |||
| Cam |
| Person | 1 | 2 | 3 |
|---|---|---|---|
| Ari | |||
| Bo | |||
| Cam |
Circle confirmed matches; cross impossible matches. One circle per row and column.
| Person | Snack | Slot |
|---|---|---|
| Cam | bread | 1 |
| Bo | cheese | 2 |
| Ari | apples | 3 |
Bread/cheese occupy 1/2 or 2/3. The 2/3 case puts cheese last, but apples must be last. So bread 1, cheese 2, apples 3. Bo 2 carries cheese; Cam cannot carry cheese and Ari cannot carry bread, leaving Cam 1 bread and Ari 3 apples.