In this puzzle, you're given ten lists of words. In each list, all the words are related in some way. I've then taken each list and dropped a letter from each. In a specific list, the dropped letter is always in the same position in each word. The position changes from list to list. I then put the list into alphabetical order based on the new strings that are formed. And finally, one word in each list has been replaced by a number telling you how many letters are in the removed word (after removing one letter). Your goal is to determine the missing word in each list, which themselves are all related to each other. The dropped letters from the ten missing words will spell how I hope you don't feel after solving this puzzle.

ins01.gif

Author

Scott Weiss
Mount St. Mary's University
16300 Old Emmitsburg Road
Emmitsburg, MD 21727
[email protected]

Copyright held by author/owner

The Digital Library is published by the Association for Computing Machinery. Copyright © 2022 ACM, Inc.

Contents available in PDF
View Full Citation and Bibliometrics in the ACM DL.

Comments

There are no comments at this time.

 

To comment you must create or log in with your ACM account.