The On-Line Encyclopedia of Bongard Problems

Search: keyword:nice

Displaying 131-140 of 185 results found.

( prev | next ) page 1 ... 9 10 11 12 13 14 15 16 17 18 19

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

BP896

Filled completely by fluid poured into gap (assuming there is already air) vs. not so.

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

	COMMENTS	`For a non-physics-based solution, "there exists a never-vertically-increasing path starting from the opening to each point in the interior vs. not so." - Aaron David Fairbanks, Aug 01 2020`
	CROSSREFS	`Adjacent-numbered pages: BP891 BP892 BP893 BP894 BP895 * BP897 BP898 BP899 BP900 BP901`
	KEYWORD	`nice, handed, updown, physics`
	CONCEPT	`liquid_flow (info \| search),` `gravity (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Zane Fry`

BP899

Regions in drawing (ignore background) can be coloured using three or fewer colours such that no adjacent regions are coloured the same colour vs. four colours are required.

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

	COMMENTS	`This Problem is related to the four colour theorem.`
	CROSSREFS	`Adjacent-numbered pages: BP894 BP895 BP896 BP897 BP898 * BP900 BP901 BP902 BP903 BP904`
	KEYWORD	`hard, nice, math`
	CONCEPT	`separated_regions (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

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`

BP917

Reversible transformations vs. non-reversible transformations.

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

	COMMENTS	`All examples depict a process that transforms one object into another (two example input-output pairs are provided in every panel). In left-sorted examples, each input corresponds to a unique output, whereas in right-sorted examples, different inputs could potentially lead to the same output. There is a sense in which all the processes described on the right "lose" some amount of the input's information.`
	REFERENCE	`https://en.wikipedia.org/wiki/Injective_function`
	CROSSREFS	`Adjacent-numbered pages: BP912 BP913 BP914 BP915 BP916 * BP918 BP919 BP920 BP921 BP922`
	KEYWORD	`nice, abstract, creativeexamples, structure, rules, miniworlds`
	CONCEPT	`convey_enough_information (info \| search),` `function (info \| search)`
	AUTHOR	`Leo Crabbe`

BP924

Polygons where all sides are different lengths vs. Polygons where not all sides are different lengths.

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

	COMMENTS	`All examples in this Problem are outlines of convex polygons.` `This is a generalisation of scalene triangles to any polygon.`
	CROSSREFS	`The left side implies the right side of BP329 (regular vs. irregular polygons), but the converse is not true.` `The left side of BP329 implies the right side, but the converse is not true.` `Adjacent-numbered pages: BP919 BP920 BP921 BP922 BP923 * BP925 BP926 BP927 BP928 BP929`
	EXAMPLE	`Any scalene triangle will fit on the left, because no two sides are equal.` `However, any regular polygon will not fit on the left, because all of its sides are equal.` `A random convex polygon will "almost surely" fit on the left.`
	KEYWORD	`nice, stretch, right-narrow, traditional`
	CONCEPT	`all (info \| search)`
	WORLD	`polygon_outline [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP926

Numbers of dots in ascending order from left to right vs. numbers of dots neither in ascending nor descending order from left to right.

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

	CROSSREFS	`Adjacent-numbered pages: BP921 BP922 BP923 BP924 BP925 * BP927 BP928 BP929 BP930 BP931`
	KEYWORD	`nice, math, sequence, traditional, left-listable, right-listable`
	CONCEPT	`number (info \| search),` `dot (info \| search)`
	WORLD	`dot_clusters_sequence_horizontal [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`

BP946

Can be constructed using 2 identical copies of an image (full overlapping not allowed) vs. not so.

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

	COMMENTS	`"Full overlapping not allowed" means you cannot overlay an image onto itself without moving it; if this were allowed all images would be sorted on the left. The copies can be moved around (translated) in 2D but can not be flipped or rotated.` `There are examples on the right drawn with thick lines, and these could be created by copying an image with slightly thinner lines and moving it over a tiny amount. If you fix this issue by saying "the copy has to be moved over more than a tiny amount" then the Bongard Problem is perfect but not precise, but if you fix this issue by saying "interpret the figures as made up of (infinitesimally) thin lines" then it's precise but not perfect. - Aaron David Fairbanks, Jun 17 2023`
	CROSSREFS	`Adjacent-numbered pages: BP941 BP942 BP943 BP944 BP945 * BP947 BP948 BP949 BP950 BP951`
	KEYWORD	`nice, notso, creativeexamples`
	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`

BP953

Image of this Bongard Problem vs. empty image.

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

	COMMENTS	`"Image of Bongard Problem with solution X vs. empty image" where X is the phrase in quotes.`
	CROSSREFS	`See BP959, BP902.` `Adjacent-numbered pages: BP948 BP949 BP950 BP951 BP952 * BP954 BP955 BP956 BP957 BP958`
	KEYWORD	`nice, precise, meta (see left/right), miniproblems, overriddensolution, right-full, right-null, perfect, infinitedetail, experimental, funny`
	CONCEPT	`fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`zoom in left (bp953_image) \| zoom in right (blank_image)`
	AUTHOR	`Leo Crabbe`

( prev | next ) page 1 ... 9 10 11 12 13 14 15 16 17 18 19

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