The On-Line Encyclopedia of Bongard Problems

Search: -meta:BP1139

Displaying 1-10 of 15 results found.

( next ) page 1 2

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

Empty image vs. non-empty image.

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

	COMMENTS	`The first Bongard Problem.` `All examples in this Bongard Problem are line drawings (one or more connected figures made up of curved and non-curved lines).`
	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 214.`
	CROSSREFS	`Adjacent-numbered pages: * BP2 BP3 BP4 BP5 BP6`
	EXAMPLE	`A circle fits on the right because it is not nothing.`
	KEYWORD	`easy, nice, precise, allsorted, unstable, world, left-narrow, left-finite, left-full, left-null, perfect, pixelperfect, finished, traditional, stableworld, deformstable, bongard`
	CONCEPT	`empty (info \| search),` `existence (info \| search),` `zero (info \| search)`
	WORLD	`zoom in left (blank_image) \| zoom in right (curves_drawing)`
	AUTHOR	`Mikhail M. Bongard`

Big vs. small.

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

	COMMENTS	`The meaning of "big" left intentionally vague. There are various specific ways to define size, such as diameter, minimum distance between points on edge, and size of smallest bounding circle.` `All examples in this Bongard Problem are single simple shapes, either outlines or solid black.` `All examples on the same side are approximately the same size.`
	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 214.`
	CROSSREFS	`Adjacent-numbered pages: BP1 * BP3 BP4 BP5 BP6 BP7`
	KEYWORD	`easy, nice, fuzzy, spectrum, size, stable, finished, traditional, continuous, bongard`
	CONCEPT	`size (info \| search)`
	WORLD	`outline_or_fill_shape [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

All shapes approximately the same size vs. shapes of different size.

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

	COMMENTS	`All examples in this problem include three or fewer outlines of circles, (near-square) quadrilaterals and (non-skinny) triangles.`
	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 221.`
	CROSSREFS	`Adjacent-numbered pages: BP17 BP18 BP19 BP20 BP21 * BP23 BP24 BP25 BP26 BP27`
	KEYWORD	`finished, traditional, bongard`
	CONCEPT	`all (info \| search),` `average (info \| search),` `size (info \| search)`
	WORLD	`circle_triangle_squareish_outlines [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

One vs. two figures.

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

	COMMENTS	`All examples in this Problem comprise one or two shape outlines.`
	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 221.`
	CROSSREFS	`Adjacent-numbered pages: BP18 BP19 BP20 BP21 BP22 * BP24 BP25 BP26 BP27 BP28`
	KEYWORD	`easy, nice, precise, number, world, gap, finished, traditional, bongard`
	CONCEPT	`number (info \| search),` `one (info \| search),` `two (info \| search)`
	WORLD	`outlines [smaller \| same \| bigger] zoom in left (shape_outline) \| zoom in right (two_outlines)`
	AUTHOR	`Mikhail M. Bongard`

There are no side branches of the second order vs. there are side branches of the second order.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 237.`
	CROSSREFS	`Adjacent-numbered pages: BP65 BP66 BP67 BP68 BP69 * BP71 BP72 BP73 BP74 BP75`
	KEYWORD	`nice, finished, traditional, bongard`
	CONCEPT	`recursion_number (info \| search),` `recursion (info \| search),` `tracing_line_or_curve (info \| search),` `trunk_of_tree (info \| search),` `two (info \| search)`
	WORLD	`curve_tree [smaller \| same \| bigger] zoom in left (curve_tree_one_level)`
	AUTHOR	`Mikhail M. Bongard`

Graph contains a "loop" a.k.a. cycle (cyclic) versus graph is acyclic.

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

	CROSSREFS	`Adjacent-numbered pages: BP783 BP784 BP785 BP786 BP787 * BP789 BP790 BP791 BP792 BP793`
	KEYWORD	`nice, precise, allsorted, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `loop (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Black shapes can be arranged such that they fit inside rectangular outline vs. not so.

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

	COMMENTS	`There is a slight ambiguity here regarding whether a shape could be placed within another shape's hole. This is a question of how one perceives the Problem: are we sliding shapes around on a table in 2D or are we allowed to 'lift' them in 3D space?`
	CROSSREFS	`Adjacent-numbered pages: BP887 BP888 BP889 BP890 BP891 * BP893 BP894 BP895 BP896 BP897`
	KEYWORD	`nice, precise, perfect, pixelperfect, help`
	CONCEPT	`rotation_required (info \| search),` `physically_fitting (info \| search)`
	AUTHOR	`Leo Crabbe`

Is exact specific image (EX6205) vs. is not.

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

	COMMENTS	`A spot-the-difference exercise.` `Arguably invalid (solution not simple).`
	CROSSREFS	`Adjacent-numbered pages: BP915 BP916 BP917 BP918 BP919 * BP921 BP922 BP923 BP924 BP925`
	KEYWORD	`less, precise, convoluted, arbitrary, stretch, unstable, left-finite, left-full, perfect, pixelperfect, experimental, funny`
	CONCEPT	`imperfection_small (info \| search),` `specificity (info \| search)`
	WORLD	`bmp [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`

Ball will reach edge of bounding box under gravity vs. not so.

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

	COMMENTS	`Strictly this Problem's solution is not actually about gravity, it is about a constant downwards force (the ball's time-independent path does not depend on the magnitude of the force, only direction). The phrasing for the solution is a shorthand that takes advantage of human physical intuition.`
	CROSSREFS	`Adjacent-numbered pages: BP928 BP929 BP930 BP931 BP932 * BP934 BP935 BP936 BP937 BP938`
	KEYWORD	`physics`
	CONCEPT	`bounding_box (info \| search),` `imagined_motion (info \| search),` `gravity (info \| search)`
	WORLD	`dot_with_lines_or_curves [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

( next ) page 1 2

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