Mystery Letter

natural language coding: performance objective

Given … ( preparation )

  • Three decks of alphabet cards, each deck consisting of twenty six index cards with letters of the alphabet, one per card.
  • One deck for each of two players, with the cards of one deck spread face-up in front of Player 1 and a second deck spread face-up in front of Player 2. 
  • The third deck shuffled and, from it, one card dealt face-down to Player 1 and another card dealt face-down to Player 2 and the remainder of cards in this deck set aside, face-down. 

The participant will … ( performance )

Play the Mystery Letter game with one other player [Target of achievement] to infer a strategy for winning by being first to discover the face-down mystery letter of the other player [Degree of achievement].

By … ( procedure )

Taking turns asking “is your mystery letter in [any word of agreed length]” and sorting as follows.

  • If yes, then turn face-down all letters in your deck of alphabet cards except for the letters in the asked word. 
  • If not, then turn face-down all letters in your deck of alphabet cards that are in the asked word. 

Example: Is your letter in LIFE? 

  • If yes, turn face-down all letters except L I F and E.
  • If not, turn face-down the L I F and E cards. 

About Me

Roger Kenyon was North America’s first lay canon lawyer and associate director at the Archdiocese of Seattle. He was involved in tech (author of Macintosh Introductory Programming, Mainstay) before teaching (author of ThinkLink: a learner-active program, Riverwood). Roger lives near Toronto and offers free critical thinking and character development courses online.

“When not writing, I’m riding—eBike, motorbike, and a mow cart that catches air down the hills. One day I’ll have Goldies again.”