Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^2: decomposing binary matrices

by Limbic~Region (Chancellor)
on Feb 16, 2007 at 13:58 UTC ( #600431=note: print w/replies, xml ) Need Help??


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.

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
    Thanks, I have not seen the 'each property have a distinct value' constraint... :>)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://600431]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2021-10-20 07:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My first memorable Perl project was:







    Results (79 votes). Check out past polls.

    Notices?