The On-Line Encyclopedia of Bongard Problems

Search: all:new

Displaying 801-810 of 1198 results found.

( prev | next ) page 1 ... 77 78 79 80 81 82 83 84 85 ... 120

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

BP398

Objects share a feature in spatially separated groups vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP393 BP394 BP395 BP396 BP397 * BP399 BP400 BP401 BP402 BP403`
	KEYWORD	`notso, traditional`
	AUTHOR	`Harry E. Foundalis`

BP397

Objects share a feature in & out of dot-made closed curve vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP392 BP393 BP394 BP395 BP396 * BP398 BP399 BP400 BP401 BP402`
	KEYWORD	`notso, traditional`
	AUTHOR	`Harry E. Foundalis`

BP396

Objects share a feature in two regions of an open curve vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP391 BP392 BP393 BP394 BP395 * BP397 BP398 BP399 BP400 BP401`
	KEYWORD	`notso, traditional`
	AUTHOR	`Harry E. Foundalis`

BP395

Objects share a feature inside & outside of a closed curve vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP390 BP391 BP392 BP393 BP394 * BP396 BP397 BP398 BP399 BP400`
	KEYWORD	`notso, traditional`
	AUTHOR	`Harry E. Foundalis`

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`

( prev | next ) page 1 ... 77 78 79 80 81 82 83 84 85 ... 120

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