The On-Line Encyclopedia of Bongard Problems

Search: keyword:both

Displaying 1-6 of 6 results found.

page 1

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

All sides are equal vs. all angles are equal.

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

	CROSSREFS	`Adjacent-numbered pages: BP323 BP324 BP325 BP326 BP327 * BP329 BP330 BP331 BP332 BP333`
	KEYWORD	`nice, stretch, left-narrow, right-narrow, traditional, finishedexamples, both`
	CONCEPT	`angle (info \| search),` `length_line_or_curve (info \| search),` `same_feature (info \| search),` `same (info \| search)`
	WORLD	`polygon_outline [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Union of left sets is right set vs. intersection of left sets is right set.

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

	CROSSREFS	`Adjacent-numbered pages: BP334 BP335 BP336 BP337 BP338 * BP340 BP341 BP342 BP343 BP344`
	KEYWORD	`math, structure, orderedtriplet, traditional, both, neither`
	CONCEPT	`set_intersection (info \| search),` `left_right (info \| search),` `set_union (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

Intersection of circle and square vs. union of circle and square.

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

	COMMENTS	`An image of only a circle or of only a square would be ambiguously categorized.`
	CROSSREFS	`Adjacent-numbered pages: BP340 BP341 BP342 BP343 BP344 * BP346 BP347 BP348 BP349 BP350`
	KEYWORD	`nice, left-narrow, right-narrow, traditional, both`
	CONCEPT	`set_intersection (info \| search),` `set_union (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search),` `overlap (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections).

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

	COMMENTS	`Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).` `Left examples are called "fully connected graphs." Right examples are called "cycle graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP927 BP928 BP929 BP930 BP931 * BP933 BP934 BP935 BP936 BP937`
	KEYWORD	`precise, left-narrow, right-narrow, both, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `all (info \| search),` `loop (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Includes itself on the left vs. includes itself on the right.

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

	COMMENTS	`Some examples are Bongard Problems with this solution.`
	CROSSREFS	`Adjacent-numbered pages: BP956 BP957 BP958 BP959 BP960 * BP962 BP963 BP964 BP965 BP966`
	KEYWORD	`nice, precise, dual, handed, leftright, perfect, infinitedetail, both, neither, preciseworld`
	CONCEPT	`fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

Axis of symmetry along the NW/SE diagonal vs. axis of symmetry along the NE/SW diagonal

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

	CROSSREFS	`Adjacent-numbered pages: BP1208 BP1209 BP1210 BP1211 BP1212 * BP1214 BP1215 BP1216 BP1217 BP1218`
	KEYWORD	`stub, dual, handed, leftright, updown, rotate, stretch, left-narrow, right-narrow, traditional, both`
	CONCEPT	`diagonal (info \| search),` `symmetry_axis (info \| search),` `symmetry (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

page 1

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