The On-Line Encyclopedia of Bongard Problems

Search: all

Displaying 991-1000 of 1161 results found.

( prev | next ) page 1 ... 96 97 98 99 100 101 102 103 104 ... 117

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

Considering only the ways they are connected, anything that can be said about a given node can be said about every other node vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Vertex-transitive_graph`
	CROSSREFS	`Adjacent-numbered pages: BP1094 BP1095 BP1096 BP1097 BP1098 * BP1100 BP1101 BP1102 BP1103 BP1104`
	KEYWORD	`precise, allsorted, notso, math, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP1100

There is a path between any two nodes vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Graph_theory` `https://en.wikipedia.org/wiki/Connectivity_(graph_theory)`
	CROSSREFS	`Adjacent-numbered pages: BP1095 BP1096 BP1097 BP1098 BP1099 * BP1101 BP1102 BP1103 BP1104 BP1105`
	KEYWORD	`precise, allsorted, world, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `connected_component (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left (connected_graph) \| zoom in right (disconnected_graph)`
	AUTHOR	`Leo Crabbe`

BP1101

Each node is connected to the same number of nodes by straight lines vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Regular_graph`
	CROSSREFS	`Any left example of BP1099 will be a left example for this BP.` `Adjacent-numbered pages: BP1096 BP1097 BP1098 BP1099 BP1100 * BP1102 BP1103 BP1104 BP1105 BP1106`
	KEYWORD	`precise, allsorted, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP1102

Nodes share the same edge connections as the vertices of a cube vs. not so.

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

	REFERENCE	`https://mathworld.wolfram.com/CubicalGraph.html`
	CROSSREFS	`Adjacent-numbered pages: BP1097 BP1098 BP1099 BP1100 BP1101 * BP1103 BP1104 BP1105 BP1106 BP1107`
	KEYWORD	`precise, allsorted, arbitrary, help, preciseworld`
	CONCEPT	`graph (info \| search),` `cube (info \| search),` `distinguishing_crossing_curves (info \| search),` `topological_transformation (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1103

Bongard Problem with solution relating to concept: cube vs. Bongard Problem unrelated to this concept.

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

	CROSSREFS	`Adjacent-numbered pages: BP1098 BP1099 BP1100 BP1101 BP1102 * BP1104 BP1105 BP1106 BP1107 BP1108`
	KEYWORD	`meta (see left/right), links, metaconcept`
	CONCEPT	`This MBP is about BPs that feature concept: "cube"`
	WORLD	`bp [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1104

Vertically centered versus horizontally centered

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

	COMMENTS	`It is easier to notice that the left examples are vertically centered than that the right examples are horizontally centered. - Aaron David Fairbanks, Dec 27 2022`
	CROSSREFS	`Adjacent-numbered pages: BP1099 BP1100 BP1101 BP1102 BP1103 * BP1105 BP1106 BP1107 BP1108 BP1109`
	KEYWORD	`easy, nice, precise, minimal, boundingbox, perfect, pixelperfect, traditional, finishedexamples, preciseworld, absoluteposition, unstableworld`
	CONCEPT	`center_bounding_box (info \| search),` `center (info \| search)`
	WORLD	`horizontal_line_segment [smaller \| same \| bigger]`
	AUTHOR	`Widad Dabbas`

BP1105

Maze object features multiple branching paths vs. one path in maze object.

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

	COMMENTS	`This was created as an example of a distractingworld Bongard Problem. Each example shows a distractingly detailed scene, irrelevant to the solution.` `Despite this distraction, the keyword noisy does not fit this Bongard Problem because only details relevant to the solution change between examples.`
	CROSSREFS	`Adjacent-numbered pages: BP1100 BP1101 BP1102 BP1103 BP1104 * BP1106 BP1107 BP1108 BP1109 BP1110`
	KEYWORD	`easy, nice, arbitrary, example, distractingworld, experimental`
	AUTHOR	`Aaron David Fairbanks`

BP1106

Bongard Problem with solution relating to concept: turning black regions white & white regions black vs. Bongard Problem unrelated to this concept.

BP556

BP948

BP1093

BP1107

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

	CROSSREFS	`Adjacent-numbered pages: BP1101 BP1102 BP1103 BP1104 BP1105 * BP1107 BP1108 BP1109 BP1110 BP1111`
	KEYWORD	`meta (see left/right), links, metaconcept`
	CONCEPT	`This MBP is about BPs that feature concept: "black_white_inversion"`
	WORLD	`bp [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1107

Contains smaller copy of self with black and white inverted vs. not so.

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

	COMMENTS	`There are various problematic cases left out. Are black and white to be inverted within a fractal's convex hull or its outermost outline?` `Must this outline be preserved around the smaller inverted version of the fractal, or is it allowed to bleed into other white areas?` `No examples have been included in this Bongard Problem whose placement depends on these questions.`
	CROSSREFS	`Adjacent-numbered pages: BP1102 BP1103 BP1104 BP1105 BP1106 * BP1108 BP1109 BP1110 BP1111 BP1112`
	KEYWORD	`perfect, infinitedetail`
	CONCEPT	`black_white_inversion (info \| search),` `fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`fractal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1108

Solid chunk of black space in neighborhood of any point of the fractal vs. solid chunk of white space in any neighborhood.

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

	CROSSREFS	`Adjacent-numbered pages: BP1103 BP1104 BP1105 BP1106 BP1107 * BP1109 BP1110 BP1111 BP1112 BP1113`
	KEYWORD	`right-null, perfect, infinitedetail, assumesfamiliarity, neither`
	CONCEPT	`topological_density (info \| search),` `fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`fractal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

( prev | next ) page 1 ... 96 97 98 99 100 101 102 103 104 ... 117

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