So now we need to get the intersection of the site, little mappings into a little mapping salon and
let the mapping do now will pass them into the Intersect mapping function.
So for that in the interactive shell, he'll let us in sort see in dissected
mapping is equal to the simple stuff heco dot.
Now, let us first of all, open the simplest function in notepad and let us find out the actual material
in the SEC to mappings that as mapping one.
So now if you'll let us just copy paste the Intersect mappings one.
And now here we are going to pass letter mapping one and letter mapping to in this case.
And then if we try to say intersected mapping, we get both the things combined together.
So now the list of potential decryption letters for any cipher letter in the intercepted mappings should
be only the potential decryption letters that are in both letter mappings, one and two.
So, for example, in the list of intercepted mappings, you can see for Z GUI it is just because in
your letter mappings had envie, but that the mapping still had only so that it will build the thing
so commonly those would be intercepted mappings.
So now we will repeat the steps of the preceding step for them to decipher also which we have.
So over here we would create Silvy letter mappings three and that is equal to we are using again.
So simple sub hackle dot get the
blank side for letter mapping one.
That is a huge difference in capital and look is so simple, we will just say copy paste it so that
out there, OK.
Then again, let's take Watpac two, which is equal to now.
Let's take the makework battle.
Or rather, let us cooperate on the whole thing and the only thing we will have to change is the vote.
So now we will take the total vote in this case.
OK, so let's copy paste that word here and then recreate the candidate as which is equal do.
So let us take the vote patterns from.
And let's put here, but now we will change this to walk back to OK, now, after that let's run will
say even in the range, and we would go on for length of your candidate SDR and here we would take Sillitoe.
Mapping is equal to Symbol's Hucko Dot.
Now you have the matter that is Dolittle's mapping.
And then here we would be passing the little mapping one sorry, three in this case, the voter and
candidate.
S.G. are.
At the index, I so let us face the same war here.
And let's execute this fall, so Novacek, our letter mapping three, we get the values printed.
OK, so now again, we have to call for an intercepted mappings because the intercepted mappings is
already there with us.
So now what we would do is, let's see, intercepted
mapping.
One is equal to let's take a simple sub hackl.
But now here we have already used the intercepted mappings and here we would pass the initial intercepted
mappings that we have is this one.
So let's pass that on.
The second one, we have this little.
Mapping three, the current one.
OK, so now if we try to see intersected mapping one, so we get this mapping system.
So in this example, we are able to find a solution for the geese that have only one value in the list.
For example, decrypts to Vibert, that aim would be Krypto in this case already because we know that
the key decrypts to eight, we can reduce that gate or the geek must to Krypto and not a so after all,
if it is solved that those are used by one side FALLETTA, it can be used by another because a simple
substitution cipher and a plain text letter.
Exactly.
One cipher little.
So now let's have a look at the remove solve letters from mapping function and find the solve letters
and remove them from the list of potential decryption letters.
We will need the intersected map that we have just created so we will not lose.
This interactive shit is coming to the identifying solve letters and mapping.
You have to remove some of the tools from mapping function.
So just for any cipher letters in the letter mappings that have only one potential decryption letters.
So these letters are considered solved, which means that they are or any other cipher letter.
Which of a disabled veteran?
The list of potential decryption letters can't possibly decrypt this letter.
So this could cause a chain of chain reaction because one potential decryption letter is removed from
other list of potential decryption letters holding just two letters.
The result could be a new cipher.
OK, so the program handles the situation by looping and removing the newly solved letter from the entire
cipher letter mapping.
Now.
Let us do one thing, let us open our.
Simple Subiaco function.
So let's go to a record on this one.
OK, so now here, if we go for the removal of letters from up, you can see this.
OK, so over here we are having the loop.
They invited this loop again is true.
We are assuming that this will not go against making this false here.
It's not because the difference for dictionaries pass with the little mappings parameter that the dictionary
will contain the changes made in the functions.
Even after the function returns.
It creates a loop again variable that holds a boolean value, which determines that the code needs to
loop again when it finds another source of letters.
So if the loop again variable is set to truly program execution and does the VI loop at the beginning
of the loop, it sets the loop again to force.
And the code assumes that this is the last iteration through the value and the loop.
Again, variable is only set to true if the program finds a new SÖLVI for later during the iteration.
Now the next part of the code over here, OK, it creates a list of cipher letters that have exactly
one potential decryption letters.
And these are the sort of letters that will be removed from the mappings.
So this is all letters.
One, if create value for, say, for little ones in your letter are if the length of this is equal
to one, then you're appending it to solve letters dot append method that the letter mappings with the
index of five four.
Letter zero.