All examples are solid black shapes.

This problem is absurdly hard. It makes a good extreme example. - Aaron David Fairbanks, Nov 23 2020

Adjacent-numbered pages:
BP554 BP555 BP556 BP557 BP558  *  BP560 BP561 BP562 BP563 BP564

hard, precise, allsorted, notso, stretch, challenge, left-narrow, perfect

fill_shape [smaller | same | bigger]

Leo Crabbe

This is the "harder version" of BP505.

Adjacent-numbered pages:
BP796 BP797 BP798 BP799 BP800  *  BP802 BP803 BP804 BP805 BP806

hard, less, abstract, math, subjective, challenge, right-unknowable, collective, experimental, finishedexamples

Aaron David Fairbanks

This is a generalisation of BP861.

Adjacent-numbered pages:
BP855 BP856 BP857 BP858 BP859  *  BP861 BP862 BP863 BP864 BP865

hard, nice, stub, precise, stretch, unstable, hardsort, challenge, creativeexamples, perfect, pixelperfect

fill_shape [smaller | same | bigger]

Leo Crabbe

"Any" here means any image of a Bongard Problem in the relevant format, i.e. with white background, black vertical dividing line, and examples in boxes on either side.

All examples shown in this Problem clearly sort themselves on the left or right.

A self-referential but maybe simpler solution is "would sort all examples in this whole Bongard Problem on one of its sides vs. not so." Users adding examples please try to maintain this: for any example you add to the right of this Bongard Problem, make sure it does not sort all the other examples in this Bongard Problem on just one of its sides. - Aaron David Fairbanks, Aug 26 2020

Adjacent-numbered pages:
BP939 BP940 BP941 BP942 BP943  *  BP945 BP946 BP947 BP948 BP949

hard, challenge, presentationinvariant

boxes_bpimage_sorts_self [smaller | same | bigger]
zoom in left | zoom in right

Jago Collins

Right:

All are "all but one are ___"; all but one are black.

All are "every other is ___"; every other is solid polygons.

All are "gradually becoming ___"; gradually becoming thickly outlined.

Left:

All but one are "all but one are ___".

Every other is "every other is ___".

Gradually becoming "gradually becoming ___".

Here is another way of putting it:

Call it "meta" when the whole imitates its parts, and call it "doubly-meta" when the whole imitates its parts with respect to the way it imitates its parts. Left are doubly-meta, while right are just meta.

Here is a more belabored way of putting it:

Call something like "is star-shaped" a "rule". An object can satisfy a rule.

Call something like "all but one are ___" a "rule-parametrized rule". A collection of objects can satisfy a rule-parametrized rule with respect to a particular rule.

On the right: every collection fits the same rule-parametrized rule (with respect to various rules); furthermore the collection of collections fits that same rule-parametrized rule (with respect to some unrelated rule that collections can satisfy).

On the left: The collection of collections fits a rule-parametrized rule with respect to the rule of fitting that rule-parametrized rule (with respect to various rules).

Previously, an unintended solution to this BP was "not all groups share some noticeable property vs. all do." It is hard to come up with examples foiling this alternative solution because the rule-parametrized rule (see explanation above) usually has to do with not all objects in the collection fitting the rule. (See BP568, which is about BP ideas that are always overridden by a simpler solution.) The example EX10108 "all five are 'all five are ___'" was added, foiling the alternative solution.

The right side of this Problem is a subset of BP999^left.

Adjacent-numbered pages:
BP993 BP994 BP995 BP996 BP997  *  BP999 BP1000 BP1001 BP1002 BP1003

"Odd one out with respect to what property is the odd one out" would not fit left: even though this example does seem doubly-meta, it is not doubly-meta in the right way. There is no odd one out with respect to the property of having an odd one out.

Similarly, consider "gradual transition with respect to what the gradual transition is between", etc. Instead of having the form "X 'X __' ", this is more like "X [the __ appearing in 'X __']". Examples like these two could make for a different Bongard Problem.

hard, unwordable, challenge, overriddensolution, infodense, contributepairs, funny, rules, miniworlds

zoom in right

Aaron David Fairbanks

Adjacent-numbered pages:
BP1006 BP1007 BP1008 BP1009 BP1010  *  BP1012 BP1013 BP1014 BP1015 BP1016

hard, precise, stretch, challenge, left-narrow, perfect, preciseworld

fill_polygon [smaller | same | bigger]

Leo Crabbe

With mathematical jargon:

No distinct same-sized copies of self overlap on a subset with positive measure in the Hausdorff measure using the Hausdorff dimension.

For a covering of a fractal by finitely many scaled down copies of itself, the condition of that no two have an intersection with positive measure is equivalent to the condition that the Hausdorff dimension coincides with the similarity dimension.

(There is another similar condition in this context called the "open set condition" which implies this but is not equivalent. The open set condition is equivalent to the condition that the Hausdorff measure using the similarity dimension is nonzero.)

https://en.wikipedia.org/wiki/Hausdorff_dimension

https://en.wikipedia.org/wiki/Open_set_condition

Adjacent-numbered pages:
BP1115 BP1116 BP1117 BP1118 BP1119  *  BP1121 BP1122 BP1123 BP1124 BP1125

challenge, perfect, infinitedetail

[smaller | same | bigger]

Aaron David Fairbanks

Another wording: "can be repeatedly broken along 'fault lines' to yield individual pieces vs not."

Robert Dawson, A forbidden suborder characterization of binarily composable diagrams in double categories, Theory and Applications of Categories, Vol. 1, No. 7, p. 146-145, 1995.

All of the examples fitting left here would fit right in BP1199 except for (1) a single rectangle, (2) two rectangles stacked vertically, or (3) two rectangles side by side horizontally.

All of the examples fitting right in in BP1097 (re-styled) would fit right here (besides a single solid block, but that isn't shown there).

Adjacent-numbered pages:
BP1195 BP1196 BP1197 BP1198 BP1199  *  BP1201 BP1202 BP1203 BP1204 BP1205

hard, precise, challenge, proofsrequired, inductivedefinition, left-listable, right-listable

Aaron David Fairbanks

https://en.wikipedia.org/wiki/Hex_(board_game)

Adjacent-numbered pages:
BP1240 BP1241 BP1242 BP1243 BP1244  *  BP1246 BP1247 BP1248 BP1249 BP1250

hard, precise, convoluted, dual, rotate, boundingbox, hardsort, challenge, proofsrequired, bordercontent

Aaron David Fairbanks