The On-Line Encyclopedia of Bongard Problems

Search: author:Aaron David Fairbanks

Displaying 141-150 of 232 results found.

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

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

Complete finite collection versus incomplete infinite collection.

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

	COMMENTS	`Related to BP379 and BP380.` `EX10061 can ambiguously be taken to be self-referential as the set of left-hand examples (which would make the right hand solution only "incomplete sets") or the class of finite sets.`
	CROSSREFS	`Adjacent-numbered pages: BP787 BP788 BP789 BP790 BP791 * BP793 BP794 BP795 BP796 BP797`
	KEYWORD	`abstract, creativeexamples, rules, miniworlds, collection`
	CONCEPT	`completeness (info \| search),` `finite_infinite (info \| search)`
	WORLD	`collection_of_objects_same_type [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP791

The leftmost two angles measured from thin line add to the rightmost versus no two angles add to a third.

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

	COMMENTS	`This answer is independent of whether angles are measured clockwise or counter-clockwise; only a consistent choice must be made.`
	CROSSREFS	`Adjacent-numbered pages: BP786 BP787 BP788 BP789 BP790 * BP792 BP793 BP794 BP795 BP796`
	KEYWORD	`math, structure, orderedtriplet, traditional`
	CONCEPT	`addition (info \| search),` `2_inputs_1_output (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP790

The leftmost two add (as vectors) to the right versus no two add to a third.

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

	CROSSREFS	`Adjacent-numbered pages: BP785 BP786 BP787 BP788 BP789 * BP791 BP792 BP793 BP794 BP795`
	KEYWORD	`math, structure, orderedtriplet, traditional`
	CONCEPT	`addition (info \| search),` `2_inputs_1_output (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP788

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`

BP576

Vertices may be partitioned into two sets such that no two vertices in the same set are connected versus not so.

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

	COMMENTS	`Left examples are called "bipartite graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP571 BP572 BP573 BP574 BP575 * BP577 BP578 BP579 BP580 BP581`
	KEYWORD	`precise, allsorted, notso, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP570

Shape outlines that aren't triangles vs. black shapes that aren't squares.

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

	COMMENTS	`An example of an overriddensolution.`
	CROSSREFS	`Adjacent-numbered pages: BP565 BP566 BP567 BP568 BP569 * BP571 BP572 BP573 BP574 BP575`
	KEYWORD	`less, example, overriddensolution, experimental, funny, neither`
	WORLD	`outline_or_fill_shape [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP562

There exists a closed trail that hits each vertex exactly once vs. not so.

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

	COMMENTS	`Left examples are called "Hamiltonian graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP557 BP558 BP559 BP560 BP561 * BP563 BP564 BP565 BP566 BP567`
	KEYWORD	`math, traditional`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP560

There exists a closed trail that hits each edge exactly once vs. not so.

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

	COMMENTS	`Left examples are called "Eulerian graphs."` `A connected graph is Eulerian if and only if each vertex is incident to an even number of edges.`
	CROSSREFS	`Adjacent-numbered pages: BP555 BP556 BP557 BP558 BP559 * BP561 BP562 BP563 BP564 BP565`
	KEYWORD	`precise, allsorted, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `all (info \| search),` `even_odd (info \| search),` `existence (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP555

Black and white photograph versus drawing.

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

	COMMENTS	`Although the images here are related to culture (BP521^left), the solution of this Bongard Problem is about the visual style of the images.`
	CROSSREFS	`Adjacent-numbered pages: BP550 BP551 BP552 BP553 BP554 * BP556 BP557 BP558 BP559 BP560`
	KEYWORD	`less, culture, experimental`
	WORLD	`zoom in left (black_and_white_photograph)`
	AUTHOR	`Aaron David Fairbanks`

BP548

Due to pixelation, it is ambiguous whether the middle small shape is a resized version of the left shape or the right shape vs. there is a clear choice.

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

	COMMENTS	`A strange Problem relying on pixelation of digital images.`
	CROSSREFS	`Adjacent-numbered pages: BP543 BP544 BP545 BP546 BP547 * BP549 BP550 BP551 BP552 BP553`
	KEYWORD	`less, creativeexamples, pixelperfect, structure, orderedtriplet, experimental`
	CONCEPT	`imperfection_small (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

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

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