The On-Line Encyclopedia of Bongard Problems

Search: keyword:preciseworld

Displaying 21-30 of 93 results found.

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

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

BP891

Dots can be connected to create one triangle within another vs. not so.

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

	COMMENTS	`Or equivalently, "3 dots within boundary of convex hull vs. not so". - Leo Crabbe, Aug 01 2020`
	CROSSREFS	`Adjacent-numbered pages: BP886 BP887 BP888 BP889 BP890 * BP892 BP893 BP894 BP895 BP896`
	KEYWORD	`nice, precise, allsorted, preciseworld`
	CONCEPT	`convex_hull (info \| search),` `triangle (info \| search)`
	WORLD	`6_dots [smaller \| same \| bigger]`
	AUTHOR	`Cameron Fetter`

BP897

Wide angles connected to narrow angles vs. not so.

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

	COMMENTS	`Another solution is that right examples can be folded down flat onto one isosceles triangle while left examples cannot.` `All examples in this Problem feature four isosceles triangles connected by corners and/or edges.`
	CROSSREFS	`This was conceived as a false solution for BP898.` `Adjacent-numbered pages: BP892 BP893 BP894 BP895 BP896 * BP898 BP899 BP900 BP901 BP902`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`triangle (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Molly C Klenzak, Aaron David Fairbanks`

BP898

Can fold into tetragonal disphenoid ("isosceles tetrahedron") vs. cannot.

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

	COMMENTS	`Which two sides are the long sides and which side is the short side, or equivalently which angles are the wider angles and which angle is the narrower angle, is the only relevant information to consider for each triangle. Triangles are all assumed isosceles and congruent to one another.` `All examples in this Problem feature four of these triangles connected by corners and/or edges.`
	CROSSREFS	`BP897 was conceived as a false solution for this.` `Adjacent-numbered pages: BP893 BP894 BP895 BP896 BP897 * BP899 BP900 BP901 BP902 BP903`
	KEYWORD	`hard, precise, allsorted, notso, math, preciseworld`
	CONCEPT	`triangle (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Molly C Klenzak`

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`

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`

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`

BP956

Nested pairs of brackets vs. other arrangement of brackets (some open brackets are not closed or there are extra closing brackets).

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

	COMMENTS	`Examples on the left are also known as "Dyck words".`
	REFERENCE	`https://en.wikipedia.org/wiki/Dyck_language`
	CROSSREFS	`Adjacent-numbered pages: BP951 BP952 BP953 BP954 BP955 * BP957 BP958 BP959 BP960 BP961`
	KEYWORD	`easy, nice, precise, allsorted, unwordable, notso, sequence, traditional, inductivedefinition, preciseworld, left-listable, right-listable`
	CONCEPT	`recursion (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

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

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