|
It seemed to be clear to everyone else
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
Ok, wow ... ummmm, your welcome?
|
|
|
|
|
have you tried a Karnaugh map?
Frank
|
|
|
|
|
You mean like Member 4190501 suggested over 10 hours ago. If you also read the responses you would see the problem was solved long ago.
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
result = ((f&&f1) || (d&&d1) || (r&&r1)) && (f||f1) && (d||d1) && (r||r1)
|
|
|
|
|
incorrect, none of the test cases have (f||f1) true.
|
|
|
|
|
result = ((f&&f1) || (d&&d1) || (r&r1)) && (f==f1) && (d==d1) && (r==r1);
|
|
|
|
|
Is it simply the number of TRUE arguments passed?
No TRUE args ==> FALSE
even no of TRUE args ==> TRUE
Otherwise ==> FALSE
Tadeusz Westawic
Sum quid sum.
|
|
|
|
|
What are you confused about? Perhaps you are confused that the problem had been solved 18 days ago by people how were not confused.
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
There are unanswered posts of my own that are months old and I would still appreciate any other point of view as long as it is mathematically valid and programmable. Are you saying my post is illegal?
Take off that heavy badge once in a while.
Tadeusz Westawic
Sum quid sum.
|
|
|
|
|
Tadeusz Westawic wrote: There are unanswered posts of my own
There is the difference. This post was answered by several people quite a long time ago.
Tadeusz Westawic wrote: Are you saying my post is illegal?
losen up and perhaps vist more often
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
( ( d && dl ) && ( r && rl ) ) || ( (d && dl) && ( !r && !rl) ) || ( (!d && !dl) && ( r && rl ) )
I wasn't, now I am, then I won't be anymore.
|
|
|
|
|
Only 18 days after everyone else. Glad it wasn't urgentz
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
 I didn't even notice that. Man, do I suck... 
I wasn't, now I am, then I won't be anymore.
|
|
|
|
|
private void Logic( bool f1, bol f2, bool f3, bool f4, bool f5, bool f6, bool expected)
{
bool result = ((!f1) && (!f2) && f5 && f6 && ( ((!f3) && (!f4)) || ( f3 && f4 )));
System.Diagnostics.Debug.Assert( result == expected, "Does not match expected results" );
}
|
|
|
|
|
yeah I know it was answered a while ago but here is a slightly more elegant algorithm
bool result = (f == fl) && (d == dl) && (r == rl) ? f | d | r : false;
or in a less descriptive form
bool result = f == fl && d == dl && r == rl && f | d | r;
modified on Tuesday, November 9, 2010 6:28 PM
|
|
|
|
|
Such a timely response 
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
Well I teach at college so I didn't want to think I was doing your homework for you. 
|
|
|
|
|
Robert Croll wrote: Well I teach at college
What course do you teach, procrastination?
I know the language. I've read a book. - _Madmatt
|
|
|
|
|
Can I get back to you on that?
|
|
|
|
|
Anyone here a member of arXiv.org, preferably the math/math.NT forum?
Thanks!
|
|
|
|
|
Hi
Expert,
I want to create a game to generate random Crossword with only Word and Clue,
Please do let me know, if you have any Algorithm, Code or Reference link.![Rose | [Rose]](https://codeproject.global.ssl.fastly.net/script/Forums/Images/rose.gif)
Thanks,
Imdadhusen
sunaSaRa Imdadhusen
+91 99095 44184
+91 02767 284464
|
|
|
|
|
It is unlikely that there is a simple algorithm for such a situation, for example take a look at this clue[^], any algorithm to solve it would have to be very complicated indeed.
Just say 'NO' to evaluated arguments for diadic functions! Ash
|
|
|
|
|
I think he's talking about a program to build a crossword puzzle, given a database of clues and answers. Not one to solve the puzzle.
|
|
|
|
|
Yes, the word "Algorithm" threw me.
Just say 'NO' to evaluated arguments for diadic functions! Ash
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
