in reply to Re: decomposing binary matrices

in thread decomposing binary matrices

pajout,

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.

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.

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.

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.

Cheers - L~R

Replies are listed 'Best First'. | |
---|---|

Re^3: decomposing binary matrices
by pajout (Curate) on Feb 16, 2007 at 14:04 UTC |

In Section
Seekers of Perl Wisdom

Comment onRe^2: decomposing binary matrices