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

Image files on the OEBP do not really have infinite detail. For a panel to be intuitively read as having infinite detail, there usually needs to be some apparent self-similarity, or perhaps a sequence of objects following an easy to read pattern getting smaller and smaller with increasing pixelation.

Usually in "infinitedetail" Bongard Problems, not only is it a puzzle to figure out the solution, but it is another puzzle to find self-similarities and understand the intended infinite detail in each example.

BPs tagged with the keyword "infinitedetail" usually feature pixelated images that give the closest approximation of the intended infinite structure up to pixelation. This means they should be tagged with the keyword perfect, but should not be tagged with the keyword pixelperfect.

Just because a Bongard Problem has "infinitedetail" does not necessarily make it infodense. Some fractal images might be encoded by a small amount of information (just the information about which places within itself it includes smaller copies of itself) and may be recognized quickly.

Adjacent-numbered pages:
BP953 BP954 BP955 BP956 BP957  *  BP959 BP960 BP961 BP962 BP963

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

visualbp [smaller | same | bigger]

Aaron David Fairbanks

Examples on the left are also known as "Dyck words".

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

Adjacent-numbered pages:
BP951 BP952 BP953 BP954 BP955  *  BP957 BP958 BP959 BP960 BP961

easy, nice, precise, allsorted, unwordable, notso, sequence, traditional, inductivedefinition, preciseworld, left-listable, right-listable

Aaron David Fairbanks

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

Arbitrary BPs often communicate non-arbitrary ideas. M. M. Bongard's original "A vs. Б" Problem (BP100) is about recognizing letters. A choice of some such arbitrary letters was necessary.

Most Bongard Problems are at least slightly arbitrary. Almost any Bongard Problem could be changed in a number of ways to make slightly different Bongard Problems. When a Bongard Problem is labeled as "arbitrary", that means there is one especially obvious class of similar Bongard Problems, with none of them particularly more interesting or special than any other.

The self-referential (invalid) Bongard Problems BP538, BP545, BP902, BP1073 fit this definition (the solution involves the arbitrary detail of being that specific Bongard Problem instead of any other). On the other hand, the solution idea is not arbitrary when phrased with "this Bongard Problem".

Many "arbitrary" Bongard Problems are of the form "Detail X has arbitrary value A vs. not so" or "Detail X has arbitrary value A vs. detail X has arbitrary value B". Other "arbitrary" Bongard Problems feature arbitrary details that are not the distinction between the sides, e.g. BP545.

It is unclear whether or not we should label a Bongard Problem "arbitrary" if the arbitrarily fixed detail is a notable special case. For example, BP1024 could have been made using any number, but the number 1 is a non-arbitrary number, so the Bongard Problem does not seem so arbitrary.

Similar to thespecificity concept BP (BP773), which is more general, including Bongard Problems relating conceptually in any way to arbitrary specificity.

Adjacent-numbered pages:
BP945 BP946 BP947 BP948 BP949  *  BP951 BP952 BP953 BP954 BP955

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

bp [smaller | same | bigger]

Aaron David Fairbanks

Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).

Left examples are called "fully connected graphs." Right examples are called "cycle graphs."

Adjacent-numbered pages:
BP927 BP928 BP929 BP930 BP931  *  BP933 BP934 BP935 BP936 BP937

precise, left-narrow, right-narrow, both, preciseworld

connected_graph [smaller | same | bigger]

Aaron David Fairbanks

Right examples are called "derangements".

Adjacent-numbered pages:
BP926 BP927 BP928 BP929 BP930  *  BP932 BP933 BP934 BP935 BP936

handed, leftright, sequence, traditional, left-listable, right-listable

dot_clusters_sequence_horizontal [smaller | same | bigger]

Aaron David Fairbanks

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

BPs should be marked "help" when the OEBP wants most examples (at least on one side) to be helpful (not when just one or two uploaded examples are helpful).

Helpfulness can be a spectrum; most Bongard Problems are helpful to some degree just by not using the most convoluted unintelligible examples possible.

Examples that are helpful to people are often not particularly helpful to computers.

Any helpful Bongard Problem has a harder, not helpful version. For example, BP384 (square number of dots versus non-square number of dots) would be much harder if all examples had hundreds of dots that weren't arranged recognizably. Instead, the dots in the examples are always arranged in shapes that make the square-ness or non-square-ness of the numbers easy to check without brute counting.

When all examples in a Bongard Problem are helpful, it may become unclear whether the helpfulness is part of the Bongard Problem's solution.

E.g.: Is the left-hand side of BP384 "square number of dots", or is it "square number of dots that are arranged in a helpful way so as to communicate the square-ness"?

See seemslike, where examples being helpful is an irremovable aspect of the Bongard Problem's solution.

Adjacent-numbered pages:
BP925 BP926 BP927 BP928 BP929  *  BP931 BP932 BP933 BP934 BP935

anticomputer, meta (see left/right), links, keyword, oebp, instruction

bppage [smaller | same | bigger]
zoom in left (help_bp)

Aaron David Fairbanks

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

Right examples have the keyword "fixedsequence" on the OEBP.

Zero, one, or two objects may technically form a sequence, but if ALL examples of a BP have zero, one, or two objects, we do not consider that BP to be about sequences. BPs about fixed two-object sequences are ordered pairwise comparison BPs, orderedpair.

The world of this Bongard Problem is BP928.

See also grid versus fixedgrid.

Adjacent-numbered pages:
BP924 BP925 BP926 BP927 BP928  *  BP930 BP931 BP932 BP933 BP934

meta (see left/right), links, keyword

sequence_visualbp [smaller | same | bigger]

Aaron David Fairbanks

Zero, one, or two objects may technically form a sequence, but if ALL examples of a BP have zero, one, or two objects, we do not consider that BP to be about sequences.

See BP929 for distinction between sequences of arbitrary length and sequences of fixed length (keywords "sequence" and "fixedsequence").

Adjacent-numbered pages:
BP923 BP924 BP925 BP926 BP927  *  BP929 BP930 BP931 BP932 BP933

stub, meta (see left/right), links

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

Aaron David Fairbanks

All examples are Bongard Problems fitting left or right in BP793.

All examples here are in the conventional format, i.e. white background, black vertical dividing line, and examples in boxes on either side.

Border cases are Bongard Problems that always self-sort one way given their particular visual format (e.g. fixed number of boxes), but self-sort a different way in another slightly different format.

Meta Bongard Problems appearing in BP793 that are presentationinvariant necessarily fit right here.

It is interesting to think about how this Bongard Problem sorts itself. The only self-consistent answer is that it fits right.

See BP793 "sorts self left vs. sorts self right".

See BP944 "sorts every BP on one side vs. doesn't".

Adjacent-numbered pages:
BP922 BP923 BP924 BP925 BP926  *  BP928 BP929 BP930 BP931 BP932

hard, solved, presentationinvariant, visualimagination

boxes_bpimage_sorts_self [smaller | same | bigger]
zoom in left (boxes_bpimage_sorts_self_incarnation_dependent) | zoom in right

Aaron David Fairbanks

Adjacent-numbered pages:
BP921 BP922 BP923 BP924 BP925  *  BP927 BP928 BP929 BP930 BP931

nice, math, sequence, traditional, left-listable, right-listable

dot_clusters_sequence_horizontal [smaller | same | bigger]

Aaron David Fairbanks