The On-Line Encyclopedia of Bongard Problems

Search: user:Jago Collins

Displaying 31-40 of 43 results found.

( prev | next ) page 1 2 3 4 5

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

BP551

Unstable balance vs. not

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

	REFERENCE	`https://en.wikipedia.org/wiki/Stability_theory`
	CROSSREFS	`Adjacent-numbered pages: BP546 BP547 BP548 BP549 BP550 * BP552 BP553 BP554 BP555 BP556`
	EXAMPLE	`The classic example is a pendulum with a solid rod (instead of a string) which has a stable balance point at the bottom of its swing, where if you move the pendulum slightly it will swing back towards that balanced state. However, theoretically the pendulum can also be balanced pointing directly up. In this case, if you move the pendulum slightly it will swing down away from that upwards balanced state.`
	KEYWORD	`updown, rotate, physics, anticomputer, perfect`
	CONCEPT	`tumbles_or_stays_put (info \| search),` `gravity (info \| search)`
	AUTHOR	`Jago Collins`

BP540

Objects define a map from the top row of boxes to the bottom row of boxes vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Map_(mathematics)`
	CROSSREFS	`Adjacent-numbered pages: BP535 BP536 BP537 BP538 BP539 * BP541 BP542 BP543 BP544 BP545`
	AUTHOR	`Jago Collins`

BP394

For each colored square only, there exists a path starting on it that covers each square of the figure exactly once vs. there is no path that starts on a colored square and covers each square of the figure exactly once.

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

	CROSSREFS	`Adjacent-numbered pages: BP389 BP390 BP391 BP392 BP393 * BP395 BP396 BP397 BP398 BP399`
	KEYWORD	`hard, nice, solved, traditional, dithering, left-listable, right-listable`
	CONCEPT	`existence (info \| search),` `path (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	AUTHOR	`Jago Collins`

BP393

Correct vs. incorrect.

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

	COMMENTS	`"True" vs. "false."`
	CROSSREFS	`Adjacent-numbered pages: BP388 BP389 BP390 BP391 BP392 * BP394 BP395 BP396 BP397 BP398`
	KEYWORD	`nice, fuzzy, abstract, collective, contributepairs, traditional, rules, miniworlds, dithering`
	CONCEPT	`categorization (info \| search),` `true_false (info \| search)`
	AUTHOR	`Jago Collins`

BP392

Exponential increase vs. linear increase.

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

	CROSSREFS	`Adjacent-numbered pages: BP387 BP388 BP389 BP390 BP391 * BP393 BP394 BP395 BP396 BP397`
	KEYWORD	`contributepairs, traditional`
	CONCEPT	`acceleration (info \| search),` `exponential (info \| search)`
	AUTHOR	`Jago Collins`

BP391

There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2.

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

	CROSSREFS	`Adjacent-numbered pages: BP386 BP387 BP388 BP389 BP390 * BP392 BP393 BP394 BP395 BP396`
	KEYWORD	`nice, precise, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `existence (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP390

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

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

	CROSSREFS	`Adjacent-numbered pages: BP385 BP386 BP387 BP388 BP389 * BP391 BP392 BP393 BP394 BP395`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `self-reference (info \| search),` `topological_transformation (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP389

Loops are entangled (in 3-D) vs. loops can be separated (in 3-D).

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

	CROSSREFS	`Adjacent-numbered pages: BP384 BP385 BP386 BP387 BP388 * BP390 BP391 BP392 BP393 BP394`
	KEYWORD	`nice, precise, allsorted, contributepairs, traditional`
	CONCEPT	`knot (info \| search),` `topological_transformation (info \| search),` `imagined_motion (info \| search),` `motion (info \| search)`
	WORLD	`link_two_knots [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP388

White dot can see (in straight lines) all black points vs. white dot cannot see (in straight lines) all black points.

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

	CROSSREFS	`See BP368 for whether ALL points can see all points.` `Adjacent-numbered pages: BP383 BP384 BP385 BP386 BP387 * BP389 BP390 BP391 BP392 BP393`
	KEYWORD	`nice, traditional`
	CONCEPT	`all (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	WORLD	`fill_shape_white_dot [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP387

Dots can be shared equally between figures vs. dots cannot be shared equally between figures.

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

	CROSSREFS	`Adjacent-numbered pages: BP382 BP383 BP384 BP385 BP386 * BP388 BP389 BP390 BP391 BP392`
	KEYWORD	`nice, traditional`
	CONCEPT	`division (info \| search)`
	AUTHOR	`Jago Collins`

( prev | next ) page 1 2 3 4 5

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