The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP508

Displaying 21-30 of 169 results found.

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 17

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

BP344

Shape can tile itself vs. shape cannot tile itself.

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

	COMMENTS	`Left examples are sometimes called "rep-tiles."` `The tiles all must be the same size. More specifically, all left examples can tile themselves only using scaled down and rotated versions of themselves with all tiles the same size. Right examples cannot tile themselves using scaled down rotated versions of themselves or even reflected versions of themselves with all tiles the same size.` `Without the puzzle piece-like shape EX4120 on the right side the current examples also allow the solution "shape can tile with itself so as to create a parallelogram vs. shape cannot tile with itself so as to create a parallelogram."`
	CROSSREFS	`See BP532 for a version with fractals.` `Adjacent-numbered pages: BP339 BP340 BP341 BP342 BP343 * BP345 BP346 BP347 BP348 BP349`
	EXAMPLE	`Go to https://oebp.org/files/yet.png for an illustration of how some left-sorted shapes tile themselves.`
	KEYWORD	`hard, precise, notso, unstable, math, hardsort, creativeexamples, proofsrequired, perfect, traditional`
	CONCEPT	`recursion (info \| search),` `self-reference (info \| search),` `tiling (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`shape [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP348

Shape on the right is the convex hull of shape on the left vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP343 BP344 BP345 BP346 BP347 * BP349 BP350 BP351 BP352 BP353`
	KEYWORD	`precise, unstable, perfect, orderedpair, traditional`
	CONCEPT	`convex_hull (info \| search)`
	WORLD	`2_fill_shapes [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP367

Center of mass within the black area of the shape vs. center of mass out of the black area of the shape.

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

	CROSSREFS	`Adjacent-numbered pages: BP362 BP363 BP364 BP365 BP366 * BP368 BP369 BP370 BP371 BP372`
	KEYWORD	`precise, unstable, physics, perfect, pixelperfect, traditional`
	CONCEPT	`inside (info \| search),` `center_of_mass (info \| search)`
	WORLD	`shape [smaller \| same \| bigger] zoom in left (shape_center_of_mass_falls_inside)`
	AUTHOR	`Aaron David Fairbanks`

BP368

There is a point that can see (in straight lines) all points vs. there is no point that can see (in straight lines) all points.

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

	COMMENTS	`Left examples are called "star domains."`
	CROSSREFS	`See BP388 for whether a distinguished point can see all points.` `Adjacent-numbered pages: BP363 BP364 BP365 BP366 BP367 * BP369 BP370 BP371 BP372 BP373`
	KEYWORD	`nice, precise, unstable, perfect, traditional`
	CONCEPT	`all (info \| search),` `existence (info \| search),` `imagined_point (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	WORLD	`shape [smaller \| same \| bigger] zoom in left (fill_shape_with_seeing_point)`
	AUTHOR	`Aaron David Fairbanks`

BP376

A "chess piece" that moves as shown may reach every square vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP371 BP372 BP373 BP374 BP375 * BP377 BP378 BP379 BP380 BP381`
	KEYWORD	`precise, allsorted, notso, left-finite, right-finite, traditional, fixedgrid, preciseworld`
	CONCEPT	`all (info \| search),` `chess-like (info \| search),` `imagined_motion (info \| search),` `motion (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP384

Square number of dots vs. non-square number of dots.

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

	COMMENTS	`All examples in this Problem are a collection of dots.` `An equivalent solution is "Dots can be arranged into a square lattice whose convex hull is a square vs. not so". - Leo Crabbe, Aug 01 2020`
	CROSSREFS	`Adjacent-numbered pages: BP379 BP380 BP381 BP382 BP383 * BP385 BP386 BP387 BP388 BP389`
	EXAMPLE	`A single dot fits because 1 = 11.` `A pair of dots does not fit because there is no integer x such that 2 = xx.`
	KEYWORD	`nice, precise, allsorted, number, math, left-narrow, left-null, help, traditional, preciseworld, collection`
	CONCEPT	`square_number (info \| search)`
	WORLD	`dots [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

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`

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`

( prev | next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 17

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