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

Right-sorted Bongard Problems have the keyword "finished" on the OEBP.

Users are not able to add or remove examples from Problems tagged "finished." (This is unusual; most Bongard Problems on the OEBP can be expanded indefinitely by users.)

A "finished" Bongard Problem will always admit the alternative, convoluted solution "is [left example 1] OR is [left example 2] OR . . . OR is [last left example] vs. is [right example 1] OR is [right example 2] OR . . . OR is [last right example]".

Bongard's original Problems are tagged "finished."

Adjacent-numbered pages:
BP499 BP500 BP501 BP502 BP503  *  BP505 BP506 BP507 BP508 BP509

meta (see left/right), links, keyword, oebp, presentationmatters, left-finite, right-finite, instruction

bppage [smaller | same | bigger]

Aaron David Fairbanks

Bongard Problems sorted left have the keyword "spectrum" on the OEBP.

In a "spectrum" Bongard Problem, there is an evident way to assign each object a value (e.g. "size" or "number of holes"). Then, to determine whether an object fits left or right in the Bongard Problem, its value is compared with a fixed threshold value.

Spectra can be continuous or discrete.

A "spectrum" Bongard Problem is usually arbitrary, since there could be made many different versions of it with different choices of threshold value. However, sometimes a certain choice of threshold is particularly natural. For example, the threshold of 90 degrees in "acute vs. obtuse angles" does not come across as arbitrary. And in BP2, the spectrum of values ("size") is vague, so much that the fuzzy threshold, of about half the size of the bounding box, does not seem arbitrary.

A spectrum Bongard Problem may or may not have the following properties:

1) The values assigned to objects are precise.

2) The threshold value between the two sides is precise.

3) The threshold value is itself sorted on one of the two sides.

Each of the latter two typically only makes sense when the condition before it is true.

If a spectrum Bongard Problem obeys 1) and 2), then it will usually be precise.

For example:

"Angles less than 90° vs. angles greater than 90°."

If a spectrum Bongard Problem obeys 1), 2), and 3), then it will usually be allsorted.

For example:

"Angles less than or equal to 90° vs. angles greater than 90°."

In a discrete spectrum Bongard Problem, even if it is precise, there isn't one unambiguous threshold value. Consider "2 or fewer holes vs. 3 or more holes". (Is the threshold 2? 3? 2.5?)

In an especially extreme kind of spectrum Bongard Problem, one side represents just a single value, just the threshold value. For example, "right angles vs. obtuse angles." In certain cases like this the threshold is an extreme value at the very boundary of the spectrum of possible values. For example, consider "no holes vs. one or more holes." Cases like this might not even be understood as two sides of a spectrum, but rather the absence versus presence of a property. (See the keyword notso.)

Even more extreme, in some Bongard Problems, each of the sides is a single value on a spectrum. For example, BP6 is "3 sides vs. 4 sides". We have not been labeling Bongard Problems like this with the keyword "spectrum".

After all, any Bongard Problem can be re-interpreted as a spectrum Bongard Problem, where the spectrum ranges from the extreme of fitting left to the extreme of fitting right.

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

See BP874 for the version sorting pictures of Bongard Problems (miniproblems) instead of links to pages on the OEBP.

Adjacent-numbered pages:
BP502 BP503 BP504 BP505 BP506  *  BP508 BP509 BP510 BP511 BP512

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

bp [smaller | same | bigger]
zoom in left (spectrum_bp)

Aaron David Fairbanks

Bongard Problems sorted left have the keyword "precise" on the OEBP.

Bongard Problems sorted right have the keyword "fuzzy" on the OEBP.

In an precise Bongard Problem, any relevant example is either clearly sorted left, clearly sorted right, or clearly not sorted.

(All relevant examples clearly sorted either left or right is the keyword allsorted.)

How can it be decided whether or not a rule is precise? How can it be decided whether or not a rule classifies all "examples that are relevant"? There needs to be another rule to determine which examples the original rule intends to sort. Bongard Problems by design communicate ideas without fixing that context ahead of time. The label "precise" can only mean a Bongard Problem's rule seems precise to people who see it. (This "precise vs. fuzzy" Bongard Problem is fuzzy.)

In an precise "less than ___ vs. greater than ___" Bongard Problem (keyword spectrum), the division between the sides is usually an apparent threshold. For example, there is an intuitive threshold between acute and obtuse angles (see e.g. BP292).

As a rule of thumb, do not consider imperfections of hand drawn images (keyword ignoreimperfections) when deciding whether a Bongard Problem is precise or fuzzy. Just because one can draw a square badly does not mean "triangle vs. quadrilateral" (BP6) should be labelled fuzzy; similar vagueness arises in all hand-drawn Bongard Problems. (For Bongard Problems in which fine subtleties of drawings, including small imperfections, are meant to be considered, use the keyword perfect.)

Sometimes the way a Bongard Problem would sort certain examples is an unsolved problem in mathematics. (See e.g. BP820.) There is a precise criterion that has been used to verify each sorted example fits where it fits (some kind of mathematical proof); however, where some examples fit is still unknown. Whether or not such a Bongard Problem should be labelled "precise" might be debated.

(Technical note: some properties are known to be undecidable, and sometimes the decidability itself is unknown. See https://en.wikipedia.org/wiki/Decision_problem .)

(See the keyword proofsrequired.)

One way to resolve this ambiguity is to define "precise" as meaning that once people decide where an example belongs for a reason, they will all agree about it.

Sometimes the class of all examples in a Bongard Problem is imprecise, but, despite that, the rule sorting those examples is precise. Say, for some potential new example, it is unclear whether it should be included in the Bongard Problem at all, but, if it were included, it would be clear where it should be sorted (or that it should be left unsorted). A Bongard Problem like this can still be tagged "precise".

(If all examples are clearly sorted except for some example for which it is unclear whether it belongs to the class of relevant examples, the situation becomes ambiguous.)

On the other hand, sometimes the class of all examples is very clear, with an obvious boundary. (Keyword preciseworld.)

There is a subtle distinction to draw between Bongard Problems that are precise to the people making them and Bongard Problems that are precise to the people solving them. A Bongard Problem (particularly a non-allsorted one) might be labeled "precise" on the OEBP because the description and the listed ambiguous examples explicitly forbid sorting certain border cases; however, someone looking at the Bongard Problem without access to the OEBP page containing the definition would not be aware of this. It may or may not be obvious that certain examples were intentionally left out of the Bongard Problem. A larger collection of examples may make it more clear that a particularly blatant potential border case was left out intentionally.

See BP876 for the version with pictures of Bongard Problems instead of links to pages on the OEBP.

See both and neither for specific ways an example can be classified as unsorted in an "precise" Bongard Problem.

Adjacent-numbered pages:
BP503 BP504 BP505 BP506 BP507  *  BP509 BP510 BP511 BP512 BP513

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

bp [smaller | same | bigger]

Aaron David Fairbanks

This is the keyword "dual" on the OEBP.

Given an example there is some way to "flip sides" by altering it. The left-to-right and right-to-left transformations should be inverses.

It is not required that there only be one such transformation. For example, for many handed Bongard Problem, flipping an example over any axis will reliably switch its sorting.

It is not required that every left example must have its corresponding right example uploaded on the OEBP nor vice versa. See the keyword contributepairs for the BPs the OEBP advises users upload left and right examples for in pairs.

Adjacent-numbered pages:
BP529 BP530 BP531 BP532 BP533  *  BP535 BP536 BP537 BP538 BP539

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

bp [smaller | same | bigger]

Aaron David Fairbanks

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

See updown.

All "leftright" Bongard Problems are handed.

Adjacent-numbered pages:
BP530 BP531 BP532 BP533 BP534  *  BP536 BP537 BP538 BP539 BP540

meta (see left/right), links, keyword, sideless, invariance

handed_visualbp [smaller | same | bigger]

Aaron David Fairbanks

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

If mirroring any example along the any axis can change its sorting the BP is "handed."

Note that BPs about comparing orientation between multiple things in one example fit on the right side.

See BP871 for the version with pictures of Bongard Problems (miniproblems) instead of links to pages on the OEBP.

The keyword leftright is specifically about flipping over the vertical axis, while the keyword updown is specifically about flipping over the horizontal axis.

Bongard Problems tagged rotate are usually "handed", since any rotation can be created by two reflections. Not necessarily, however, since the reflected step in between might not be sorted on either side by the Bongard Problem.

Adjacent-numbered pages:
BP547 BP548 BP549 BP550 BP551  *  BP553 BP554 BP555 BP556 BP557

meta (see left/right), links, keyword, invariance, wellfounded

visualbp [smaller | same | bigger]
zoom in left (handed_visualbp)

Aaron David Fairbanks

Adjacent-numbered pages:
BP667 BP668 BP669 BP670 BP671  *  BP673 BP674 BP675 BP676 BP677

meta (see left/right), links, metaconcept, primitive

bp [smaller | same | bigger]

Harry E. Foundalis

Adjacent-numbered pages:
BP764 BP765 BP766 BP767 BP768  *  BP770 BP771 BP772 BP773 BP774

meta (see left/right), links, metaconcept

bp [smaller | same | bigger]

Harry E. Foundalis

"More," "fewer," "greater than," "less than."

See BP752 and BP749 for equality.

Adjacent-numbered pages:
BP978 BP979 BP980 BP981 BP982  *  BP984 BP985 BP986 BP987 BP988

meta (see left/right), links, metaconcept

bp [smaller | same | bigger]

Aaron David Fairbanks