Still trying to figure out how to do this....

I crunched some numbers and figured out that if I tried to compare every possible combination of crowdedness to every possible combination of influences, I'd have over 30,000 examples to look at.   Fortunately, a lot of them are invalid under the rules of sudoku, and a lot of them I can figure out without actually doing the comparison.

	A	B+	B	C+	C	D+	D	E+	E
I	100%	100%	100%	100%	100%	100%	100%	100%	100%
II	100%	100%	100%	100%	100%	100%	100%	100%	100%
III	100%	100%	100%					0%	0%
IV	100%	100%	100%					0%	0%
V	100%	100%	100%					0%	0%
VI	100%	100%	100%					0%	0%
VII	100%	100%	100%					0%	0%
VIII	100%	100%	100%					0%	0%
IX	100%	100%	100%	0%	0%	0%	0%	0%	0%

For example, in the last entry I pointed out that we know the results for four influences (A) and for three influences (B or B+), and we also know the results for squares with only one or two remaining spaces.

At the other end of the spectrum, we can guarantee that when there is no influence (E or E+), we'll get neither a hit nor a pair in any square that has three spaces or more.  We can also guarantee that a square which starts with nine spaces won't have any results at all until there are at least 3 influences.  So now our chart has filled in somewhat, without doing any actual work.

So now I need a model for testing comparisons.  Here's what it looks like at first:

									t
									m
									b
l	c	r

The shaded square at the top left is where all the action happens.  That's where we'll put in Xs to indicate spaces that are occupied by symbols from other arrays.

We don't actually need the other squares as squares, but they're useful for reminding us how influences work. We'll keep them through our first set of examples, and then modify how we use them a little later on.