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，依此类推。