﻿ Atlantis — Keep Talking and Nobody Explodes Module

On the Subject of Atlantis

a

The module presents eight buttons arranged in a circle and a trident in the middle. Words made up of Greek letters are shown on these buttons.

All words could be Caesar shifted forward X times, where X is minimized, such that Y, the number of times the letter Alpha (α) appears across all the words, is maximized.

To solve the module, find the positive difference between this X and Y, and count that many times around the buttons clockwise, starting from the button pointed by the trident. Press this landed button to solve the module.

To Caesar shift forward a word a number of times (let’s call this number N), firstly convert each letter into a number (using Appendix A), add N to each number, modulo 24, then convert each new number back to a letter (using Appendix A).

For the ones who want a bigger challenge, hold any button and let it guide you deeper...

Appendix A: Greek Letters

No.Letter nameLetter
1Alphaα
2Betaβ
3Gammaγ
4Deltaδ
5Epsilonε
6Zetaζ
7Etaη
8Thetaθ
9Iotaι
10Kappaκ
11Lambdaλ
12Muμ
No.Letter nameLetter
13Nuν
14Xiξ
15Omicronο
16Piπ
17Rhoρ
18Sigmaσ
19Tauτ
20Upsilonυ
21Phiφ
22Chiχ
23Psiψ
24Omegaω

On the Subject of The Deeper Atlantis

α

The module presents eight buttons arranged in a circle and a trident in the middle. Words made up of Greek letters are shown on these buttons.

Observe the table below:

 X+2 2X-1 3X-1 2X+1 X X-1 3X X+1 2X
• Take the digital root of the sum of the serial number digits and take the cell counted this many times in reading order, starting from the top left cell being 1.
• Treating this cell as the center, the buttons on the module are each assigned a function relative to the positions of the cells around this taken cell. The table wraps around.
• All words can be Caesar shifted a number of times equal to the result of their respective assigned functions of value X, where X is minimized and less than 24 at all times, such that Y, the number of times the letter Alpha (α) appears across all the words, is maximized.

To solve the module, add the values of X and Y together and count that many times around the buttons clockwise starting from the pointed button, then press this landed button.