The On-Line Encyclopedia of Bongard Problems

Search: all:new

Displaying 231-240 of 717 results found.

( prev | next ) page 1 ... 20 21 22 23 24 25 26 27 28 ... 72

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

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`

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`

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`

BP915

Finite number of dots vs. infinite number of dots.

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

	CROSSREFS	`Adjacent-numbered pages: BP910 BP911 BP912 BP913 BP914 * BP916 BP917 BP918 BP919 BP920`
	KEYWORD	`less, notso, spectrum, number, example, left-null, impossible, experimental`
	CONCEPT	`finite_infinite (info \| search)`
	WORLD	`dots [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP912

Imperfectly drawn shapes vs. perfectly drawn shapes.

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

	CROSSREFS	`Adjacent-numbered pages: BP907 BP908 BP909 BP910 BP911 * BP913 BP914 BP915 BP916 BP917`
	KEYWORD	`perfect, contributepairs`
	CONCEPT	`curve_texture (info \| search)`
	WORLD	`zoom in right (shape_outline)`
	AUTHOR	`Leo Crabbe`

BP911

Red shape vs. blue shape.

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

	CROSSREFS	`Adjacent-numbered pages: BP906 BP907 BP908 BP909 BP910 * BP912 BP913 BP914 BP915 BP916`
	KEYWORD	`easy, dual, arbitrary, color, experimental`
	AUTHOR	`Aaron David Fairbanks`

BP907

One dot cluster is the product of the other two vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP902 BP903 BP904 BP905 BP906 * BP908 BP909 BP910 BP911 BP912`
	KEYWORD	`unorderedtriplet`
	CONCEPT	`2_inputs_1_output (info \| search),` `product (info \| search)`
	WORLD	`3_dot_clusters [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

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`

BP904

Rows show all possible ways a certain number of dots can be divided between a certain number of bins vs. not so.

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

	COMMENTS	`The rows in the panels on the right hand side show all the ways you can divide a certain number of dots between a certain number of bins, ignoring which bins they are placed in.`
	CROSSREFS	`Adjacent-numbered pages: BP899 BP900 BP901 BP902 BP903 * BP905 BP906 BP907 BP908 BP909`
	KEYWORD	`solved, left-null, grid, left-listable, right-listable`
	CONCEPT	`permutation (info \| search)`
	AUTHOR	`Molly C Klenzak`

BP903

Sharp vs. blurry

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

	CROSSREFS	`Adjacent-numbered pages: BP898 BP899 BP900 BP901 BP902 * BP904 BP905 BP906 BP907 BP908`
	KEYWORD	`contributepairs`
	CONCEPT	`contrast (info \| search),` `curve_texture (info \| search)`
	AUTHOR	`Cameron Fetter`

( prev | next ) page 1 ... 20 21 22 23 24 25 26 27 28 ... 72

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