The On-Line Encyclopedia of Bongard Problems

Search: -meta:BP550

Displaying 351-360 of 420 results found.

( prev | next ) page 1 ... 32 33 34 35 36 37 38 39 40 41 42

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

BP386

Lower shape can be used as a tile to build the upper one vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP381 BP382 BP383 BP384 BP385 * BP387 BP388 BP389 BP390 BP391`
	KEYWORD	`nice, precise, allsorted, left-narrow, perfect, pixelperfect, orderedpair, traditional, preciseworld, left-listable, right-listable`
	CONCEPT	`tiling (info \| search)`
	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`

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	`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`

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`

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`

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`

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`

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`

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`

BP523

Same amount of black in any vertical slice vs. varying amounts of black in vertical slices.

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

	CROSSREFS	`Adjacent-numbered pages: BP518 BP519 BP520 BP521 BP522 * BP524 BP525 BP526 BP527 BP528`
	KEYWORD	`nice, precise, rotate, stretch, unstable, perfect, pixelperfect, traditional`
	WORLD	`shapes_can_touch_box [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

( prev | next ) page 1 ... 32 33 34 35 36 37 38 39 40 41 42

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