![]() |
Bongard Problems - Printable Version +- One Man Left Studios Community Forums (http://www.onemanleft.com/forums) +-- Forum: General (/forumdisplay.php?fid=1) +--- Forum: Poppycock (/forumdisplay.php?fid=2) +--- Thread: Bongard Problems (/showthread.php?tid=3267) |
RE: Bongard Problems - TheGreatErenan - 03-13-2014 07:06 AM Well, I'm not, like, the boss or anything, but in my opinion, pretty much the only rule that really matters is that the correct solution should be plainly the correct intended solution more than any other potential solution. For instance, with this one: Group A: banana color belvedere hindsight humbug pascal Group B: tricycle balrog minus random wellington kangaroo There is the trivial solution that Group A contains words that are members of the set {banana, color, belvedere, hindsight, humbug, pascal}, whereas Group B contains words that are not members of that set. But obviously if you make up a puzzle with a solution like that, then you're kind of missing the point. So I'd say, yes, you can have multiple parameters, but I would advise caution. Here are some notes from http://www.foundalis.com/res/invalBP.html:
RE: Bongard Problems - [PETA] Doodat - 03-13-2014 10:04 AM In words starting with A, only the letter A can be 3 in a row (AAA), and it must end in the letter O. In words starting with V, only the letter V can be 3 in a row (VVV), and it must end in the letter X. How is this? RE: Bongard Problems - TheGreatErenan - 03-13-2014 11:22 AM (03-13-2014 10:04 AM)[PETA] Doodat Wrote: In words starting with A, only the letter A can be 3 in a row (AAA), and it must end in the letter O. Well, it is true that every member of Group A satisfies those rules, and every member of Group B does not. However, there is a much simpler rule that I had intended as the solution. So here, let me add some more members that violate your rules but which satisfy mine. Group A: AAVAO AAAO VAVAX AVAVAO VVVAX VAAVAVX VVVAAAAO AVX Group B: VAAAX VVAAO VO AVAX AAAVVVO AAVAAAVX AAAVVVVO AVVO RE: Bongard Problems - Flarp55 - 03-13-2014 11:27 AM If there are more As than Vs then it must end in O. Otherwise it must end in X. RE: Bongard Problems - [PETA] Doodat - 03-13-2014 11:31 AM Derp. Nice job. RE: Bongard Problems - Flarp55 - 03-13-2014 11:34 AM (03-13-2014 11:31 AM)[PETA] Doodat Wrote: Derp. Nice job. Actually I had gotten the same answer as you to start with. I only realized it after he had posted the extra answers. RE: Bongard Problems - TheGreatErenan - 03-13-2014 12:14 PM Yup. That's it. Group A: The word ends in O if and only if there are more A's than V's. Group B: The word ends in O if and only if there are at least as many V's as A's. RE: Bongard Problems - .Memories. - 03-14-2014 11:56 AM More please? ![]() RE: Bongard Problems - Demon - 03-14-2014 12:32 PM Here's one for math types, though this might be too much Group A 1331 1943 5337 1703 0547 Group B 6553 4697 2690 1573 6479 RE: Bongard Problems - TheGreatErenan - 03-14-2014 01:12 PM The only thing I can think of, though I really doubt this is the correct solution, is that if you treat them as hexadecimal numbers and convert to binary, then the number of 1's is divisible by 3 in Group A but not in Group B. |