The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP929

Displaying 1-10 of 14 results found.

( next ) page 1 2

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

BP350

Some quantity keeps increasing from left to right vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP345 BP346 BP347 BP348 BP349 * BP351 BP352 BP353 BP354 BP355`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules`
	CONCEPT	`size_increase_decrease (info \| search),` `iteration (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`quantity_vary_seq_noise_allowed [smaller \| same \| bigger] zoom in left (quantity_change_seq_increase_right_noise_allowed)`
	AUTHOR	`Aaron David Fairbanks`

BP351

Discrete quantity vs. continuous quantity.

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

	CROSSREFS	`See BP873 for the version with Bongard Problems.` `Adjacent-numbered pages: BP346 BP347 BP348 BP349 BP350 * BP352 BP353 BP354 BP355 BP356`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules`
	CONCEPT	`size_increase_decrease (info \| search),` `discrete_continuous (info \| search),` `iteration (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`constant_change_seq_increase_right [smaller \| same \| bigger] zoom in left (constant_change_discrete_seq_increase_right)`
	AUTHOR	`Aaron David Fairbanks`

BP352

Increasing quantity has no lower (or upper) bound (and gives a representation of negative numbers) vs. increasing quantity has lower (and/or upper) bound.

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

	COMMENTS	`All left examples have a clear "zero" value, but it may be unclear which side is meant to be positive and which side is meant to be negative (See BP893^left for quantities without clear notion of increase/decrease.)`
	CROSSREFS	`See BP353^left for looping quantities; these do not clearly represent positive and negative numbers, but they can likewise unboundedly decrease and increase.` `Adjacent-numbered pages: BP347 BP348 BP349 BP350 BP351 * BP353 BP354 BP355 BP356 BP357`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules`
	CONCEPT	`size_increase_decrease (info \| search),` `iteration (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`constant_change_seq_increase_right [smaller \| same \| bigger] zoom in right (constant_change_seq_increase_right_lower_bound)`
	AUTHOR	`Aaron David Fairbanks`

BP353

Increasing quantity loops back to starting value vs. increasing quantity cannot loop back to starting value.

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

	CROSSREFS	`Adjacent-numbered pages: BP348 BP349 BP350 BP351 BP352 * BP354 BP355 BP356 BP357 BP358`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules, miniworlds`
	CONCEPT	`iteration (info \| search),` `loop (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`constant_change_seq_increase_right [smaller \| same \| bigger] zoom in left (constant_change_seq_loop_right)`
	AUTHOR	`Aaron David Fairbanks`

BP354

Increasing quantity is angular vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP349 BP350 BP351 BP352 BP353 * BP355 BP356 BP357 BP358 BP359`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules, miniworlds`
	CONCEPT	`angle (info \| search),` `loop (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`constant_change_seq_increase_right [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP355

Fractal iteration based on 2-D (shapes) vs. fractal iteration based on 1-D (line segments).

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

	CROSSREFS	`Adjacent-numbered pages: BP350 BP351 BP352 BP353 BP354 * BP356 BP357 BP358 BP359 BP360`
	KEYWORD	`creativeexamples, structure, sequence, traditional, rules`
	CONCEPT	`fractal (info \| search),` `iteration (info \| search),` `tracing_line_or_curve (info \| search)`
	WORLD	`constant_change_seq_fractal_iterate_right [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

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`

BP931

Some number labels its own position in the sequence from left to right vs. not so.

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

	COMMENTS	`Right examples are called "derangements".`
	CROSSREFS	`Adjacent-numbered pages: BP926 BP927 BP928 BP929 BP930 * BP932 BP933 BP934 BP935 BP936`
	KEYWORD	`handed, leftright, sequence, traditional, left-listable, right-listable`
	CONCEPT	`number (info \| search),` `dot (info \| search),` `self-reference (info \| search)`
	WORLD	`dot_clusters_sequence_horizontal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

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`

BP986

Palindromes vs. not palindromes.

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

	COMMENTS	`All examples in this Problem are sequences of graphic symbols. In this Problem, a "palindrome" is taken to be an ordered sequence which is the same read left-to-right as it is read right-to-left. A more formal solution to this Problem could be: "Sequences which are invariant under a permutation which swaps first and last entries, second and second last entries, third and third last entries, ... and so on vs. sequences which are not invariant under the aforementioned permutamation."`
	CROSSREFS	`Adjacent-numbered pages: BP981 BP982 BP983 BP984 BP985 * BP987 BP988 BP989 BP990 BP991`
	KEYWORD	`nice, precise, allsorted, notso, sequence, traditional`
	CONCEPT	`element_wise_symmetry (info \| search),` `identical (info \| search),` `sequence (info \| search),` `same_shape (info \| search),` `same (info \| search),` `symmetry (info \| search)`
	WORLD	`zoom in left \| zoom in right`
	AUTHOR	`Jago Collins`

( next ) page 1 2

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