返回题库

游戏之夜!

Game Night!

专题
Algorithmic Programming / 算法编程
难度
L6

题目详情

这是 Codenames 与文字游戏结合的谜题。题面给出三张 Codenames 棋盘和若干提示,需要判断提示命中的单词,把选中模式转成编码信息,并经过多轮筛选得到最终单词答案。

英文原题

The three best first plays from our recurring Codenames game night are pictured above: one matched eleven words and the other two matched nine each! We looked at the boards over and over again and decided that when the clues encode the target words in such a binary fashion you can get impressive results.

[The answer to this puzzle is a single word.]

解析

先从三张 Codenames 棋盘中找出各提示词命中的卡片。把每一行中“被选中/未选中”转成 5 位二进制数,再用 1=A 的编码读出 SCRABBLESUMODD,提示下一轮选择 Scrabble 分值为奇数的词。重复同样流程得到 LONGERTHANFIVE,再得到 MIDDLELETTEROF。最后一行所有词长度为奇数,取中间字母读出 SIEVE,作为最终答案线索。


英文解析

We were presented three Codenames boards with exceptionally high-scoring plays. A natural first step is to find the correct cards grouped by each clue, these words are

Clothing 9: POLO DRESS TUXEDO SHOE SHORTS BOOT CAP GLOVE SUIT

Animal 11: DUCK SCORPION OCTOPUS CUCKOO PENGUIN RABBIT SHARK DOG TURTLE REINDEER EAGLE

Food 9: SOUP CHEESE POTATO PIE SALAD CARROT PIZZA HAMBURGER BISCUIT

Then, using some flavor clues, you may notice that you can convert each row into a binary number (where a selected word is represented by 1 and an unselected word represented by 0) between 0 and 31, which can conveniently be converted to a letter with the standard 1=A, 2=B, 3=C cipher. For example, the first row of

POLO ENGLAND SKYSCRAPER DRESS TUXEDO

has POLO, DRESS, and TUXEDO selected, and ENGLAND and SKYSCRAPER unselected, so would convert to the binary number 10011, or 19 in decimal, which converts to ‘S’.

Reading these rows down the puzzle you get SCRABBLESUMODD_ (the final row gives 00000 which doesn’t convert to a letter). We can read this as “Scrabble sum odd,” a new property we can use to select and unselect words on the board (the flavor text also suggests recursively looking at the board over and over). So we go about the same procedure but now select words with odd scrabble sum. For example, in the first row, the scrabble sums are 6, 9, 21, 6, and 14, so the binary digits we get for which of these are odd are 01100, which is 12 in decimal, giving an ‘L’.

Reading these rows down the puzzle gives LONGERTHANFIVE_ (again the final row gives 00000), and we have yet another condition for words having more than five letters. Recurring yet again, (now the first row gives 01101=13=’M’), we read off MIDDLELETTEROF_

Now we don’t have an obvious condition, but the final row failing to match any of the previous clues is starting to stick out. All of the words in this final row are odd in length, and thus have a well defined middle letter, which read from left to right SIEVE, the somewhat appropriate answer to the puzzle!

Congrats to the solvers that successfully navigated the series of clues!