The On-Line Encyclopedia of Bongard Problems

Search: keyword:precise

Displaying 51-60 of 169 results found.

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 17

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

BP905

Graph can be redrawn such that no edges intersect vs. not so.

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

	COMMENTS	`A graph is a collection of vertices and edges. Vertices are the dots and edges are the lines that connect the dots. On the left, all edges can be redrawn (curved lines are allowed and moving vertices is allowed) such that no edges cross each other and each vertex is still connected to the same other vertices. These graphs are called planar.`
	CROSSREFS	`Adjacent-numbered pages: BP900 BP901 BP902 BP903 BP904 * BP906 BP907 BP908 BP909 BP910`
	KEYWORD	`nice, precise, allsorted, notso, math, left-null, preciseworld`
	CONCEPT	`graph (info \| search),` `topological_transformation (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Molly C Klenzak`

BP920

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`

BP922

One row is rearranged to make the other by swapping an odd number of object pairs vs. one row is rearranged to make the other by swapping an even number of object pairs.

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

	COMMENTS	`The mathematical terms for these operations are even and odd permutations.`
	CROSSREFS	`Adjacent-numbered pages: BP917 BP918 BP919 BP920 BP921 * BP923 BP924 BP925 BP926 BP927`
	KEYWORD	`precise, allsorted, math, left-narrow, right-narrow, unorderedpair, preciseworld, left-listable`
	CONCEPT	`even_odd (info \| search),` `permutation (info \| search)`
	AUTHOR	`Leo Crabbe`

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`

BP935

Shapes have equal area vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP930 BP931 BP932 BP933 BP934 * BP936 BP937 BP938 BP939 BP940`
	KEYWORD	`nice, precise, allsorted, unstable, left-narrow, perfect, pixelperfect, unorderedpair`
	CONCEPT	`area (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP937

Shapes have equal perimeter vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP932 BP933 BP934 BP935 BP936 * BP938 BP939 BP940 BP941 BP942`
	KEYWORD	`precise, allsorted, unstable, left-narrow, perfect, unorderedpair`
	CONCEPT	`perimeter (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP941

JPEG image vs. PNG image.

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

	COMMENTS	`Evidently this solution is stretching the idea of what makes images "different". Each corresponding pair of panels would be parsed as identical in any other case. It is worth noting that if you view this Problem on a template, the solution no longer applies at all.`
	CROSSREFS	`Adjacent-numbered pages: BP936 BP937 BP938 BP939 BP940 * BP942 BP943 BP944 BP945 BP946`
	KEYWORD	`less, precise, dual, antihuman, contributepairs, invalid, experimental, funny`
	AUTHOR	`Leo Crabbe`

BP942

Square bounding box vs. oblong rectangular bounding box.

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

	CROSSREFS	`Adjacent-numbered pages: BP937 BP938 BP939 BP940 BP941 * BP943 BP944 BP945 BP946 BP947`
	KEYWORD	`precise, stretch, boundingbox, invalid, experimental, preciseworld`
	CONCEPT	`bounding_box (info \| search),` `square (info \| search)`
	WORLD	`rectangular_arrangement_of_white_pixels [smaller \| same \| bigger] zoom in left (square_arrangement_of_white_pixels) \| zoom in right (oblong_rectangular_arrangement_of_white_pixels)`
	AUTHOR	`Leo Crabbe`

BP945

Cube number of dots vs. non-cube number of dots.

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

	CROSSREFS	`Adjacent-numbered pages: BP940 BP941 BP942 BP943 BP944 * BP946 BP947 BP948 BP949 BP950`
	KEYWORD	`precise, allsorted, number, left-null, help, preciseworld`
	CONCEPT	`cube (info \| search)`
	WORLD	`dots [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP949

Two unique distances between points vs. three unique distances between points.

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

	CROSSREFS	`Adjacent-numbered pages: BP944 BP945 BP946 BP947 BP948 * BP950 BP951 BP952 BP953 BP954`
	KEYWORD	`nice, precise, allsorted, stretch, perfect, traditional, preciseworld`
	CONCEPT	`two (info \| search),` `three (info \| search)`
	WORLD	`3_or_4_points [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 17

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