The On-Line Encyclopedia of Bongard Problems

Search: author:Leo Crabbe

Displaying 41-50 of 92 results found.

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

Sort: recent 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 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`

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`

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`

BP1090

Top piece can slide into bottom area in such that there is an unbroken black horizontal region vs. not so.

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

	COMMENTS	`Successful moves in Tetris.`
	CROSSREFS	`Adjacent-numbered pages: BP1085 BP1086 BP1087 BP1088 BP1089 * BP1091 BP1092 BP1093 BP1094 BP1095`
	KEYWORD	`precise, teach, culture, pixelperfect`
	AUTHOR	`Leo Crabbe`

BP1082

Shapes are congruent if (and only if) they are enclosed in the same space vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1077 BP1078 BP1079 BP1080 BP1081 * BP1083 BP1084 BP1085 BP1086 BP1087`
	KEYWORD	`stub, precise, allsorted`
	CONCEPT	`iff (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1080

Image of a Bongard Problem vs. other image.

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

	COMMENTS	`Various formats of Bongard Problems frequently seen on the OEBP are showcased on the left side here.`
	CROSSREFS	`See BP968, which distinguishes solvable Bongard Problems from other images still formatted like Bongard Problems (as opposed to this page, which distinguishes Bongard Problems from any other images.)` `Adjacent-numbered pages: BP1075 BP1076 BP1077 BP1078 BP1079 * BP1081 BP1082 BP1083 BP1084 BP1085`
	KEYWORD	`notso, teach, left-narrow, right-null`
	CONCEPT	`bongard_problem (info \| search),` `categorization (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1017

Line segments linking same-coloured dots would intersect vs. not so.

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

	CROSSREFS	`This is a less noisy version of BP261.` `Adjacent-numbered pages: BP1012 BP1013 BP1014 BP1015 BP1016 * BP1018 BP1019 BP1020 BP1021 BP1022`
	KEYWORD	`easy, nice, precise, allsorted, perfect, traditional, finishedexamples, preciseworld`
	CONCEPT	`lines_coincide (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search),` `overlap (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1013

Neighbouring tiles share exactly 1 side vs not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1008 BP1009 BP1010 BP1011 BP1012 * BP1014 BP1015 BP1016 BP1017 BP1018`
	KEYWORD	`precise, allsorted, perfect`
	CONCEPT	`infinite_plane (info \| search),` `tessellation (info \| search),` `tiling (info \| search)`
	WORLD	`wallpaper_tiling_1_polygon [smaller \| same \| bigger] zoom in left`
	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!)