Hi, I'm trying to solve this puzzle I've come against, and I'm not quite sure what the best way to go about it is. Here's the question.

So, it seems to me that the first thing you'd do is take the maximum number of combinations, which I'm guessing should be 2^4036, due to there being 4036 boxes that each have a possible 2 combinations. Let's take the example with A and B, since the top row is 1 in both boxes, A cannot equal B. Therefore, if A = 0, B has to be equal to 1, or vice versa. By that logic, that takes two possible combinations out of a 4x4 block, making the block instead of having 2^4 possibilities, it now has 2^3 possible combinations. By that logic, there should be 2^(3027) possible numbers.

I feel though that I've missed a good number of constraints. What do you guys think?

Thanks.