login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)

Revision history for BP1261

Displaying 1-15 of 15 results found. page 1
     Edits shown per page: 25.
BP1261 on 2024-10-04 05:38:26 by Aaron David Fairbanks                approved
CROSSREFS

Similar solution to BP1262, except there overlaps do not have to be unique.

BP1261 on 2024-10-04 05:38:19 by Aaron David Fairbanks                approved
CROSSREFS

Similar solution to BP1261, except there overlaps do not have to be unique.

BP1261 on 2024-10-03 05:35:55 by Aaron David Fairbanks                approved
+DATA

 

EX10073
 

-DATA

 

EX10074
 

REMOVE

 

EX10072
 

BP1261 on 2024-10-03 05:31:37 by Aaron David Fairbanks                approved
-DATA

 

EX10072
 

BP1261 on 2024-10-03 05:24:40 by Aaron David Fairbanks                approved
+DATA

 

EX10071
 

REMOVE

 

EX10069
 

BP1261 on 2024-10-03 05:20:41 by Aaron David Fairbanks                approved
+DATA

 

EX10069
 

-DATA

 

EX10070
 

BP1261 on 2024-10-02 20:02:23 by Leo Crabbe                approved
COMMENTS

All left-sorted examples have 2^n distinct white regions, where n is the number of shapes in the image.

BP1261 on 2024-09-30 17:41:40 by Leo Crabbe                approved
NAME

Exactly one connected white region for each possible way shapes can overlap vs. not so.

BP1261 on 2024-09-30 17:40:33 by Leo Crabbe                approved
NAME

Exactly one connected white region for each possible overlap of shapes vs. not so.

REFERENCE

https://en.wikipedia.org/wiki/Venn_diagram

AUTHOR

Leo Crabbe

+DATA

 

EX8381
   

EX10064
   

EX10065
   

EX10066
 

-DATA

 

EX8379
   

EX8385
   

EX10067
   

EX10068
 


Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary