Re: decomposing binary matrices

Can you be more specific? I don't understand what is the goal and where is the issue... For instance, your two (split?) tables do not contain 1 for B4... For me it is possible to represent that structure as

$possible_values = {A=>[2,4],B=>[3,4,5],...,E=>[2,4]};
[download]

but it could mean nothing for your problem.

Comment on Re: decomposing binary matrices Download Code

Replies are listed 'Best First'.
Re^2: decomposing binary matrices by Limbic~Region (Chancellor) on Feb 16, 2007 at 13:58 UTC
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. 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	[reply]
Re^3: decomposing binary matrices by pajout (Curate) on Feb 16, 2007 at 14:04 UTC
Thanks, I have not seen the 'each property have a distinct value' constraint... :>)	[reply]


We don't bite newbies here... much
	PerlMonks