note
Limbic~Region
[pajout],
<br />
B can't be 4. A or E must be 4. Which ever one is 4, the other must be 2 but B can never be 4.
<p>
If I have understood the problem correctly, any time N variables can only be the same N values, they can be extracted from the matrix. This process is repeated until you are left with a "left over" matrix. Presumably this reduces the amount of brute force necessary to find values.
</p>
<p>
This also sounds like a job best solved by Prolog or some other logic programming language as we are trying to searching to satisfy constraints.
</p>
<div class="pmsig"><div class="pmsig-180961">
<p>
Cheers - [Limbic~Region|L~R]
</p>
</div></div>
600418
600426