The On-Line Encyclopedia of Bongard Problems

Search: keyword:preciseworld

Displaying 11-20 of 90 results found.

( prev | next ) page 1 2 3 4 5 6 7 8 9

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`

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`

BP557

Equal horizontal length vs. not

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

	COMMENTS	`All examples in this Problem are pairs of straight line segments.` `This problem communicates the idea of projected distance, in this case from 2D to 1D (x-axis).`
	CROSSREFS	`Adjacent-numbered pages: BP552 BP553 BP554 BP555 BP556 * BP558 BP559 BP560 BP561 BP562`
	KEYWORD	`nice, precise, allsorted, stretch, perfect, unorderedpair, preciseworld`
	CONCEPT	`projection (info \| search)`
	WORLD	`two_segments [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP558

Point sequence that is increasing or decreasing in height vs. point sequence that alternates in height

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

	COMMENTS	`All examples in this Problem are groups of 3 dots.` `Any example where 2 adjacent dots have the same height would be ambiguously sorted.`
	CROSSREFS	`Adjacent-numbered pages: BP553 BP554 BP555 BP556 BP557 * BP559 BP560 BP561 BP562 BP563`
	EXAMPLE	`Reading from right to left in the first box on the left hand side: the 2nd dot is higher than the 1st, and the 3rd is higher than the 2nd, so the sequence of dots is strictly increasing in height.`
	KEYWORD	`nice, precise, antihuman, orderedtriplet, preciseworld`
	CONCEPT	`coordinate (info \| search)`
	WORLD	`three_points [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

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`

BP569

Triangular number of dots vs. non-triangular number of dots

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

	COMMENTS	`All examples in this Problem are groups of black dots.` `The nth triangular number is the sum over the natural numbers from 1 to n, where n > 0. Note: 0 is the 0th triangular number. The first few triangular numbers are 0, 1, 3 (= 1+2) and 6 (= 1+2+3)`
	CROSSREFS	`Adjacent-numbered pages: BP564 BP565 BP566 BP567 BP568 * BP570 BP571 BP572 BP573 BP574`
	KEYWORD	`nice, precise, allsorted, notso, number, math, left-narrow, left-null, help, preciseworld`
	WORLD	`dots [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

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`

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`

BP856

Compound shape would hit the dot if rotated vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP851 BP852 BP853 BP854 BP855 * BP857 BP858 BP859 BP860 BP861`
	KEYWORD	`nice, precise, allsorted, left-narrow, preciseworld`
	CONCEPT	`imagined_motion (info \| search),` `collision (info \| search)`
	AUTHOR	`Leo Crabbe`

( prev | next ) page 1 2 3 4 5 6 7 8 9

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