The On-Line Encyclopedia of Bongard Problems

Search: author:Leo Crabbe

Displaying 81-90 of 176 results found.

( prev | next ) page 1 ... 5 6 7 8 9 10 11 12 13 ... 18

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

BP1131

One shape can be totally obscured by the other vs. neither shape can be obscured.

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

	COMMENTS	`Rotation of shapes is not required for any left-hand panels, but it should not change any example's sorting if it is considered.`
	CROSSREFS	`Adjacent-numbered pages: BP1126 BP1127 BP1128 BP1129 BP1130 * BP1132 BP1133 BP1134 BP1135 BP1136`
	KEYWORD	`nice, precise, allsorted, pixelperfect, unorderedpair`
	CONCEPT	`overlap (info \| search)`
	WORLD	`2_shapes [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`

BP1113

Bongard Problems relating to the OEBP vs. Bongard Problems unrelated to the OEBP.

BP503	BP504	BP518	BP542	BP546	BP919
BP930	BP943	BP967	BP1113	BP1121	BP1125
BP1150	BP1174

BP1	BP2	BP3	BP4	BP5	BP6
BP7	BP8	BP9	BP10	BP11	BP12
BP13	BP14	BP15	BP16	BP17	BP18
BP19	BP20	BP21	BP22	BP23	BP24
BP25	BP26	BP27	BP28	BP29	BP30
BP31	BP32	BP33	BP34	BP35	. . .

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

	COMMENTS	`Bongard Problems sorted left have the keyword "oebp" on the OEBP.` `Most Bongard Problems relating to the OEBP are meta.`
	CROSSREFS	`Adjacent-numbered pages: BP1108 BP1109 BP1110 BP1111 BP1112 * BP1114 BP1115 BP1116 BP1117 BP1118`
	KEYWORD	`notso, meta (see left/right), links, keyword, oebp, left-self, metameta`
	AUTHOR	`Leo Crabbe`

BP1112

"Stretch-dependent" Bongard Problems vs. Bongard Problems in which examples can be stretched (or compressed) along any axis without being sorted differently.

BP7	BP11	BP12	BP13	BP33	BP50
BP62	BP76	BP77	BP80	BP103	BP152
BP250	BP289	BP328	BP329	BP333	BP335
BP336	BP523	BP525	BP536	BP557	BP559
BP812	BP813	BP816	BP860	BP920	BP924
BP942	BP949	BP1011	BP1086	BP1145	. . .

BP1	BP5	BP15	BP31	BP45	BP98
BP157	BP240	BP322	BP327	BP330	BP331
BP332	BP348	BP363	BP367	BP368	BP369
BP389	BP809	BP810	BP851	BP853	BP911
BP966	BP977	BP992	BP1022	BP1094	BP1131
BP1135	BP1136

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

	COMMENTS	`Left-sorted Bongard Problems have the keyword "stretch" on the OEBP.` `If applying a scaling along one particular axis to the whole of any example can change its sorting the BP fits on the left side here. (For BPs with bounding boxes this means scaling and cropping, but without cutting out any detail.)`
	CROSSREFS	`Adjacent-numbered pages: BP1107 BP1108 BP1109 BP1110 BP1111 * BP1113 BP1114 BP1115 BP1116 BP1117`
	KEYWORD	`meta (see left/right), links, keyword, invariance`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1110

The process that turns one object into the other is the same both ways vs. the process changes depending on which object is chosen as the starting point.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Duality_(mathematics)` `https://en.wikipedia.org/wiki/Involution_(mathematics)`
	CROSSREFS	`This is a special case of BP841 and a generalisation of BP822.` `Adjacent-numbered pages: BP1105 BP1106 BP1107 BP1108 BP1109 * BP1111 BP1112 BP1113 BP1114 BP1115`
	KEYWORD	`nice, abstract, math, anticomputer, creativeexamples, left-narrow, unorderedpair, rules, miniworlds, dithering`
	CONCEPT	`function (info \| search)`
	AUTHOR	`Leo Crabbe`

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`

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`

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`

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`

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`

( prev | next ) page 1 ... 5 6 7 8 9 10 11 12 13 ... 18

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