The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP693

Displaying 1-2 of 2 results found.

page 1

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

Dark figures can be divided from outline figures by a straight line vs. convex hulls of filled and outlined figures overlap.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 240.`
	CROSSREFS	`Adjacent-numbered pages: BP76 BP77 BP78 BP79 BP80 * BP82 BP83 BP84 BP85 BP86`
	KEYWORD	`finished, traditional, bongard`
	CONCEPT	`convex_hull (info \| search),` `separable_entangled (info \| search),` `sides_of_line (info \| search),` `feature_cluster (info \| search),` `cluster_of_one (info \| search),` `cluster (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search),` `objects_overlap (info \| search),` `overlap (info \| search)`
	AUTHOR	`Mikhail M. Bongard`

BP144

Two clusters of three and two: different features (including clustering) yield different 3-2 splits vs. two clusters of three and two: different features yield the same 3-2 split.

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

	CROSSREFS	`Adjacent-numbered pages: BP139 BP140 BP141 BP142 BP143 * BP145 BP146 BP147 BP148 BP149`
	KEYWORD	`nice, traditional, miniworlds`
	CONCEPT	`and (info \| search),` `number (info \| search),` `separable_entangled (info \| search),` `feature_cluster (info \| search),` `shape_cluster (info \| search),` `cluster (info \| search),` `two (info \| search),` `three (info \| search)`
	AUTHOR	`Douglas R. Hofstadter`

page 1

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