The On-Line Encyclopedia of Bongard Problems

Search: ex:EX10165

Displaying 1-1 of 1 result found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

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

(edit; present; nest [left/right]; search; history)

	COMMENTS	`All left-sorted examples have 2^n distinct white regions (counting the background), where n is the number of shapes in the image.`
	REFERENCE	`https://en.wikipedia.org/wiki/Venn_diagram`
	CROSSREFS	`Similar solution to BP1262, except there overlaps do not have to be unique.` `Adjacent-numbered pages: BP1256 BP1257 BP1258 BP1259 BP1260 * BP1262 BP1263 BP1264 BP1265 BP1266`
	KEYWORD	`notso, left-narrow, left-null, perfect`
	CONCEPT	`exists_one (info \| search)`
	AUTHOR	`Leo Crabbe`

page 1

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