Left-sorted Bongard Problems have the keyword "nice" on the OEBP.

Right-sorted Bongard Problems have the keyword "less." They are not necessarily "bad," but we do not want more like them.

Adjacent-numbered pages:
BP498 BP499 BP500 BP501 BP502  *  BP504 BP505 BP506 BP507 BP508

subjective, meta (see left/right), links, keyword, oebp, right-finite, left-it, feedback, time

bp [smaller | same | bigger]

Aaron David Fairbanks

Adjacent-numbered pages:
BP579 BP580 BP581 BP582 BP583  *  BP585 BP586 BP587 BP588 BP589

meta (see left/right), links, metaconcept

bp [smaller | same | bigger]

Harry E. Foundalis

Left examples have the keyword "structure" on the OEBP.

Examples of "structures": Bongard Problem, Bongard Problem with extra unsorted panel ("Bongard's Dozen"), 4-panel analogy grid, sequence of objects with a quantity changing by a constant amount.

If the solver hasn't become familiar with the featured structure, the Bongard Problem's solution may seem convoluted or inelegant. (See keyword assumesfamiliarity.) Once the solver gets used to seeing a particular structure it becomes easier to read that structure and solve Bongard Problems featuring it.

A Bongard Problem can non-verbally teach someone how a particular structure works, showing valid examples of that structure versus non-examples. E.g., BP968 for the structure of Bongard Problems and BP981 for the structure of analogy grids.

Adjacent-numbered pages:
BP784 BP785 BP786 BP787 BP788  *  BP790 BP791 BP792 BP793 BP794

meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks

Left-sorted Bongard Problems have the keyword "creativeexamples" on the OEBP.

Be encouraged to contribute new interesting examples to Bongard Problems with this keyword.

There is much overlap with the keyword hardsort.

This is what it usually means to say examples fit on (e.g.) the left of a Bongard Problem in various creative ways: there is no (obvious) general method to determine a left-fitting example fits left.

There is a related idea in computability theory: a "non recursively enumerable" property is one that cannot in general be checked by a computer algorithm.

But keep in mind the tag "creativeexamples" is supposed to mean something less formal. For example, it requires no ingenuity for a human being to check when a simple shape is convex or concave (so BP4 is not labelled "creativeexamples"). However, it is not as if we use an algorithm to do this, like a computer. (It is not even clear what an "algorithm" would mean in this context, since it is ambiguous both what class of shapes the Bongard Problem sorts and how that would be encoded into a computer program's input. There are usually many options and ambiguities like this whenever one tries to formalize the content of a Bongard Problem.)

Adjacent-numbered pages:
BP861 BP862 BP863 BP864 BP865  *  BP867 BP868 BP869 BP870 BP871

notso, meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks

Left-sorted Bongard Problems have the keyword "assumesfamiliarity" on the OEBP.

Sometimes all the examples in a Bongard Problem need to be interpreted a certain way for the Bongard Problem to make sense. Only once the representation is understood, the idea seems simple.

For example, all meta Bongard Problems (Bongard Problems sorting other Bongard Problems) assume the solver interprets the examples as Bongard Problems.

TO DO: Maybe it is best to stop putting the label "assumesfamiliarity" on all meta-Bongard Problems. There are so many of them. It may be better to only use the "assumesfamiliarity" keyword on meta-BPs for a further assumption than just that all examples are interpreted as Bongard Problems. - Aaron David Fairbanks, Feb 11 2021

Many Bongard Problems in which all examples take the same format (keyword structure) assume the solver already knows how to read that format.

Some Bongard Problems assume the solver will be able to understand symbolism that is consistent between examples (keyword consistentsymbols).

Bongard Problems tagged math often assume the solver is familiar with a certain representation of a math idea.

Adjacent-numbered pages:
BP1106 BP1107 BP1108 BP1109 BP1110  *  BP1112 BP1113 BP1114 BP1115 BP1116

BP1032: The solution should really read "Assuming all images are Bongard Problems sorting each natural number left or right ..." This Bongard Problem makes sense to someone who has been solving a series of similar BPs, but otherwise there is no reason to automatically read a collection of numbers as standing for a larger collection of numbers.

fuzzy, meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks

Left-sorted Bongard Problems have the keyword "rules" on the OEBP.

In the typical "rules" Bongard Problem, it is possible to come up with many convoluted rules that fit each example, but the intended interpretation is the only simple and obvious one.

Since it is difficult to communicate a rule with little detail, "rules" Bongard Problems are usually infodense.

Typically, each example is itself a bunch of smaller examples that all obey the rule. It is the same as how a Bongard Problems relies on many examples to communicate rules; likely just one example wouldn't get the answer across.

On the other hand, in BP1157 for example, each intended rule is communicated by just one example; these rules have to be particularly simple and intuitive, and the individual examples have to be complicated enough to communicate them.

Often, each rule is communicated by showing several examples of things satisfying it. (See keywords left-narrow and right-narrow.) Contrast Bongard Problems, which are more communicative, by showing some examples satisfying the rule and some examples NOT satisfying the rule.

A "rules" Bongard Problem is often collective. Some examples may admit multiple equally plausible rules, and the correct interpretation of each example only becomes clear once the solution is known. The group of examples together improve the solver's confidence about having understood each individual one right.

It is common that there will be one or two examples with multiple reasonable interpretations due to oversight of the author.

All meta Bongard Problems are "rules" Bongard Problems.

Many other Bongard-Problem-like structures seen on the OEBP are also about recognizing a pattern. (See keyword structure.)

"Rules" Bongard Problems are abstract, although the individual rules in them may not be abstract. "Rules" Bongard Problems also usually have the keyword creativeexamples.

Adjacent-numbered pages:
BP1153 BP1154 BP1155 BP1156 BP1157  *  BP1159 BP1160 BP1161 BP1162 BP1163

fuzzy, meta (see left/right), links, keyword, left-self, rules

Aaron David Fairbanks

Adjacent-numbered pages:
BP1172 BP1173 BP1174 BP1175 BP1176  *  BP1178 BP1179 BP1180 BP1181 BP1182

meta (see left/right), links

Leo Crabbe

Alternatively, BP pages on the OEBP with number less than or equal to 394 vs. other BP pages.

https://www.foundalis.com/res/bps/bpidx.htm

Adjacent-numbered pages:
BP1189 BP1190 BP1191 BP1192 BP1193  *  BP1195 BP1196 BP1197 BP1198 BP1199

Foundalis's collection includes all Bongard Problems by Bongard.

meta (see left/right), links, right-self, time

Aaron David Fairbanks