The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP1190

Displaying 71-80 of 93 results found.

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

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

Equal number of black and white pixels vs. not

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

	CROSSREFS	`Adjacent-numbered pages: BP1084 BP1085 BP1086 BP1087 BP1088 * BP1090 BP1091 BP1092 BP1093 BP1094`
	KEYWORD	`nice, precise, allsorted, boundingbox, right-null, perfect, pixelperfect, help, preciseworld, bordercontent, blackwhiteinvariant`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP1093

"Inverted symmetry" present vs. not

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

	CROSSREFS	`Adjacent-numbered pages: BP1088 BP1089 BP1090 BP1091 BP1092 * BP1094 BP1095 BP1096 BP1097 BP1098`
	KEYWORD	`nice, precise, allsorted, boundingbox, left-narrow, right-null, perfect, pixelperfect, preciseworld, bordercontent, blackwhiteinvariant`
	CONCEPT	`black_white_inversion (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP1097

"Fault line" present vs. not

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

	CROSSREFS	`Adjacent-numbered pages: BP1092 BP1093 BP1094 BP1095 BP1096 * BP1098 BP1099 BP1100 BP1101 BP1102`
	KEYWORD	`nice, precise, notso, left-finite, right-finite, preciseworld`
	AUTHOR	`Jago Collins`

BP1099

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`

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`

BP1109

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

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

	REFERENCE	`https://mathworld.wolfram.com/Edge-TransitiveGraph.html`
	CROSSREFS	`Adjacent-numbered pages: BP1104 BP1105 BP1106 BP1107 BP1108 * BP1110 BP1111 BP1112 BP1113 BP1114`
	KEYWORD	`precise, allsorted, notso, math, left-narrow, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1122

Content of any square is an image of the whole panel vs. not so.

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

	CROSSREFS	`Similar to BP818.` `Adjacent-numbered pages: BP1117 BP1118 BP1119 BP1120 BP1121 * BP1123 BP1124 BP1125 BP1126 BP1127`
	KEYWORD	`nice, minimal, size, boundingbox, infinitedetail, preciseworld, absoluteposition`
	CONCEPT	`fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	AUTHOR	`Leo Crabbe`

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

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