The On-Line Encyclopedia of Bongard Problems

Search: author:Aaron David Fairbanks

Displaying 1-10 of 232 results found.

( next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 24

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

BP1260

Same transformation applied to circle, triangle, and square vs. different transformations applied.

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

	CROSSREFS	`BP839 is about applying opposite transformations to a single object.` `Adjacent-numbered pages: BP1255 BP1256 BP1257 BP1258 BP1259 * BP1261 BP1262 BP1263 BP1264 BP1265`
	KEYWORD	`easy, nice, abstract, arbitrary, anticomputer, left-null, structure, orderedtriplet, traditional, rules`
	CONCEPT	`circle (info \| search),` `analogy (info \| search),` `square (info \| search),` `same (info \| search),` `triangle (info \| search),` `function (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1259

Rule is the same for rows as it is for columns vs. not

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

	CROSSREFS	`All examples on the left are chosen so that rotating or flipping the grid in any way would result in a grid satisfying the same rule.` `Adjacent-numbered pages: BP1254 BP1255 BP1256 BP1257 BP1258 * BP1260 BP1261 BP1262 BP1263 BP1264`
	KEYWORD	`notso, rules, grid, miniworlds`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1258

It is possible to deduce the contents of any square from the rest vs. it is not.

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

	CROSSREFS	`BP979 is very similar: whether a particular square can be deduced from the rest.` `Adjacent-numbered pages: BP1253 BP1254 BP1255 BP1256 BP1257 * BP1259 BP1260 BP1261 BP1262 BP1263`
	KEYWORD	`notso, rules, grid, miniworlds`
	CONCEPT	`convey_enough_information (info \| search),` `choice (info \| search)`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1257

The rule is about squares having a certain relationship with their neighbors vs. it is not.

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

	COMMENTS	`"Local vs. global."` `For clarity, rules involving diagonal neighbors or squares more than one step away are never used.` `The similar solution "Each square can be deduced from its neighbors vs. not so" does not quite work; for example EX8114 would then not fit left. See also BP1258 ("Each square can be deduced from the rest vs. not so").`
	CROSSREFS	`Adjacent-numbered pages: BP1252 BP1253 BP1254 BP1255 BP1256 * BP1258 BP1259 BP1260 BP1261 BP1262`
	KEYWORD	`structure, rules, grid, miniworlds`
	CONCEPT	`local_global (info \| search)`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1246

Any symmetry exhibited by some non-empty subset of the objects is also a symmetry of the whole thing vs. not so.

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

	COMMENTS	`In other words, placing the image over itself (rotation and flipping allowed) so that any parts match up makes the whole image match up to itself vs. not so.`
	CROSSREFS	`See BP965 for a variation on this idea where the "parts" are allowed to be arbitrary regions of the image instead of individual objects shown in the image.` `Adjacent-numbered pages: BP1241 BP1242 BP1243 BP1244 BP1245 * BP1247 BP1248 BP1249 BP1250 BP1251`
	KEYWORD	`precise, allsorted, unwordable, notso, traditional`
	CONCEPT	`local_global (info \| search),` `self-reference (info \| search),` `symmetry (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1245

When two players alternate coloring regions, either can force connection from top edge to bottom edge vs. either can force connection from left edge to right edge.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Hex_(board_game)`
	CROSSREFS	`Adjacent-numbered pages: BP1240 BP1241 BP1242 BP1243 BP1244 * BP1246 BP1247 BP1248 BP1249 BP1250`
	KEYWORD	`hard, precise, convoluted, dual, rotate, boundingbox, hardsort, challenge, proofsrequired, bordercontent`
	AUTHOR	`Aaron David Fairbanks`

BP1241

Any point contained in (arbitrarily) smaller version of self vs. not so.

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

	COMMENTS	`Note if any point is contained in some smaller version of the whole, then any point is contained in arbitrarily smaller versions of the whole.` `It isn't possible to unambiguously communicate in a picture whether or not a few specific points are included in the fractal. The pictures are interpreted as what is intuitively simplest. To make matters less ambiguous, all the fractals here contain all points arbitrarily close to points in them. (They are topologically closed. See also BP1239.)` `The left hand side of this is a stronger condition than the left hand side of BP1116.`
	CROSSREFS	`Adjacent-numbered pages: BP1236 BP1237 BP1238 BP1239 BP1240 * BP1242 BP1243 BP1244 BP1245 BP1246`
	KEYWORD	`notso, perfect, infinitedetail`
	CONCEPT	`fractal (info \| search),` `recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`connected_fractal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1239

Fractal topologically closed (each white point has a neighborhood of pure white surrounding it) vs. not

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

	COMMENTS	`It isn't possible to unambiguously communicate whether or not a few specific points are missing.`
	CROSSREFS	`Adjacent-numbered pages: BP1234 BP1235 BP1236 BP1237 BP1238 * BP1240 BP1241 BP1242 BP1243 BP1244`
	KEYWORD	`notso, perfect, infinitedetail`
	CONCEPT	`fractal (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1238

Fractal with hole vs. fractal with no hole (simply connected).

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

	CROSSREFS	`Adjacent-numbered pages: BP1233 BP1234 BP1235 BP1236 BP1237 * BP1239 BP1240 BP1241 BP1242 BP1243`
	KEYWORD	`notso, perfect, infinitedetail`
	CONCEPT	`closed_open (info \| search),` `existence (info \| search),` `fractal (info \| search),` `hole (info \| search),` `loop (info \| search)`
	WORLD	`connected_fractal_self_tile [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1233

Different curves cross each other vs. curves only cross themselves (or do not cross at all).

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

	CROSSREFS	`Adjacent-numbered pages: BP1228 BP1229 BP1230 BP1231 BP1232 * BP1234 BP1235 BP1236 BP1237 BP1238`
	KEYWORD	`notso, traditional`
	CONCEPT	`distinguishing_crossing_curves (info \| search),` `x-crossing (info \| search)`
	WORLD	`smooth_crosscurves [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

( next ) page 1 2 3 4 5 6 7 8 9 10 11 ... 24

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