The On-Line Encyclopedia of Bongard Problems

Search: keyword:both

Displaying 1-7 of 7 results found.

page 1

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

BP328

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`

BP339

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`

BP345

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`

BP932

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`

BP961

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`

BP1108

Solid chunk of black space in neighborhood of any point of the fractal vs. solid chunk of white space in any neighborhood.

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

	CROSSREFS	`Adjacent-numbered pages: BP1103 BP1104 BP1105 BP1106 BP1107 * BP1109 BP1110 BP1111 BP1112 BP1113`
	KEYWORD	`right-null, perfect, infinitedetail, assumesfamiliarity, both, neither`
	CONCEPT	`topological_density (info \| search),` `fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`fractal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1242

Tiled by pair of fractals including itself such that both tile the other vs. tiled by pair of fractals including itself such that the other tiles itself.

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

	COMMENTS	`Proofs still needed that all the examples on the left hand side cannot fit on the right hand side as well, and that EX9881 cannot fit on the left hand side as well.`
	CROSSREFS	`The left hand side implies the left hand side of BP1116.` `The right hand side does not imply the right hand side of BP1116. (EX9881 is meant to be a counterexample.)` `Adjacent-numbered pages: BP1237 BP1238 BP1239 BP1240 BP1241 * BP1243 BP1244 BP1245 BP1246 BP1247`
	KEYWORD	`unwordable, overriddensolution, perfect, infinitedetail, both, missingproofs`
	CONCEPT	`fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search),` `tiling (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

page 1

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