I saw a different video about cracking the Enigma recently and learned something new about it. It's basically a Rube Goldberg substitution cypher - each character is encoded in a cypher and then advanced to another cypher. There were two consequences of that.

'A' would never map to 'A'. So any message with a known plaintext of local weather conditions, or like in The Imitation Game, "Heil Hitler", you could test the plain text at each position of the encoded message and know that the message did not contain the known plaintext because none of the letters could match in sequence. If 'ei' or 'e_____t' existed in the cipher then the input could not contain the same. So selection of the candidate messages for cracking first culled any messages that definitely did not contain the known plain text.

Additionally, the breadboard part of the cipher was static throughout any given day, and reciprocal. That is, if A was currently mapped to B, then B also mapped to A, which is not usually the case with Caesar. That caused the breadboard stages between the wheels to cancel each other out, because A at the output of wheel 1 would change to B and then back to A for the input to wheel 2. That dropped the number of substitutions per character on the 3 wheel Enigma from 9 to 5, and thus reducing the exponent of the problem space, and the complexity of The Bombe.