雙語暢銷書《艾倫圖靈傳》第5章:解謎接力賽(36)
Such analysis would be done by hand methods.
But in principle, a much more mechanical approach could be made, exploiting the fact that even a million possible rotor positions did not constitute a 'tremendously large number'.
但是在理論上，可以做出更機械化的方法，因爲就算有100萬個可能的盤位，也算不上是非常大的數字。Like the Polish Bombe, a machine could simply work through the possible positions one by one until it found one that transformed the cipher-text into the known plain-text.
就像波蘭的炸彈機，機器可以逐個逐個地嘗試每個可能的盤位，直到能夠將密文中的猜到的詞正確地轉換成已知的明文。
In the following diagrams, we forget the internal details of the basic Enigma, and think of it just as a box which transforms an input letter into an output letter.
在下面的圖表中，我們忽略基礎型謎機的內部細節，只將它看成是一個盒子，能把輸入字母轉換成輸出字母。The state of the machine is represented by three numbers, giving the positions of the rotors.
機器的狀態用三個數字表示，也就是盤位。(We also leave aside the problem that the middle and inner rotors may move, and assume them static;
我們忽略中間和最裏面的轉盤的轉動，假設它們是靜止的，in practice this would prove an important consideration in applying the method, but not affecting the principle.)
這在實踐中是很重要的，但並不影響基本原理。Now suppose it is known for certain that UILKNTN is the encipherment of the word GENERAL by an Enigma without plugboard.
假設已經知道，有一臺無配線板的謎機，能將GENERAL編碼成UILKNTN。This means that there exists a rotor position, such that U is transformed to G, and such that the next position transforms I to E, the next one taking L to N, and so forth.
這意味着存在着一個盤位，能將U轉換成G，轉動一格後，將U轉換成G，再轉一格後將I轉換爲E，然後是L轉換成N，依此類推。
