There are also the keywords "left-uncertain" (left-BP1126) and "right-uncertain" (left-BP1127). A Bongard Problem is "uncertain" for a side in case some examples fitting on that side cannot be determined to fit there; a Bongard Problem is "alwaysuncertain" for a side in case every example fitting on that side cannot be determined to fit there (and every example fitting on the opposite side can).

Any Bongard Problem "alwaysuncertain" for a side is also "uncertain" for that side (assuming there are any examples at all that should be sorted on that side).

There are also the keywords "left-uncertain" (left-BP1126) and "right-uncertain" (left-BP1127). A Bongard Problem is uncertain for a side in case some examples fitting on that side cannot be determined to fit there; a Bongard Problem is alwaysuncertain for a side in case every example fitting on that side cannot be determined to fit there (and every example fitting on the opposite side can).

Any left-alwaysuncertain Bongard Problem is also "left-uncertain", assuming there are any examples at all that should be sorted left.

Any right-alwaysuncertain Bongard Problem is also "right-uncertain", assuming there are any examples at all that should be sorted right.

There are also the keywords "left-uncertain" (left-BP1126) and "right-uncertain" (left-BP1127). A Bongard Problem is uncertain for a side in case some examples fitting on that side cannot be determined to fit there; a Bongard Problem is alwaysuncertain for a side in case every example fitting on that side cannot be determined to fit there.

Any left-alwaysuncertain Bongard Problem is also "left-uncertain", assuming there are any examples at all that should be sorted left.

Any right-alwaysuncertain Bongard Problem is also "right-uncertain", assuming there are any examples at all that should be sorted right.

Bongard Problems such that examples are always by default sorted left, until some unforeseen way of fitting right is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

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

Right-sorted Bongard Problems have the keyword "right-alwaysuncertain".

Left-alwaysuncertain Bongard Problems tend to be "right-narrow" (left-BP514), and right-alwaysuncertain Bongard Problems tend to be "left-narrow" (left-BP513).

Either tend to have the keyword "creativeexamples" (left-BP866).

Bongard Problems such that examples are by default sorted left, until some unforeseen way of fitting right is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

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

Right-sorted Bongard Problems have the keyword "right-alwaysuncertain".

Left-alwaysuncertain Bongard Problems tend to be "right-narrow" (left-BP514), and right-alwaysuncertain Bongard Problems tend to be left-narrow (left-BP513).

Either tend to have the keyword "creativeexamples" (left-BP866).

See "left-uncertain" (left-BP1126) and "right-uncertain" (left-BP1127) keywords.

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

Right-sorted Bongard Problems have the keyword "right-alwaysuncertain".

See "left-uncertain" (left-BP1126) and "right-uncertain" (left-BP1127) keywords.

See also "hardsort" (right-BP864) and "creativeexamples" (left-BP866) keywords.

Bongard Problems such that examples are by default sorted right, until some unforeseen way of fitting left is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

Bongard Problems such that examples are by default sorted right, until some unforeseen way of fitting left is noticed (the solver is not always "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

No general algorithm is known for determining whether or not a tile tessellates the plane. However, we are not aware of a proof that such an algorithm is impossible. Even so, we say BP335 ("tessellates the plane vs. does not tessellate the plane") is left-verifiable, since it is, in any case, very difficult to determine some shapes go right.

A more strict (less "fuzzy" right-BP508) definition of "left-verifiable" might require us to be certain there exists no foolproof sorting method, rather than just that the average solver won't come up with one. See keyword "weakhardsort" (left-BP1125) for more on this topic.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

No general algorithm is known for determining whether or not a tile tessellates the plane. However, we are not aware of a proof that such an algorithm is impossible. We decide to call BP335 ("tessellates the plane vs. does not tessellate the plane") just left-verifiable.

A more strict (less "fuzzy" right-BP508) definition of "left-verifiable" might require us to be certain there exists no foolproof sorting method, rather than just that the average solver won't come up with one. See keyword "weakhardsort" (left-BP1125) for more on this topic.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

No general algorithm is known for determining whether or not a tile tessellates the plane. However, we are not aware of a proof that such an algorithm is impossible. We decide to call BP335 ("tessellates the plane vs. does not tessellate the plane") left-verifiable.

A more strict (less "fuzzy" right-BP508) definition of "left-verifiable" might require us to be certain there exists no foolproof sorting method, rather than just that the average solver won't come up with one. See keyword "weakhardsort" (left-BP1125) for more on this topic.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

No general algorithm is known for determining whether or not a tile tessellates the plane. However, we are not aware of a proof that such an algorithm is impossible. We decide to call BP335 ("tessellates the plane vs. does not tessellate the plane") left-verifiable.

A more strict (less "fuzzy" right-BP508) definition of "left-verifiable" might require us to be certain there exists no foolproof sorting method, rather than just that the average solver won't come up with one. See keyword "weakhardsort" for more on this topic.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

No general algorithm is known for determining whether or not a tile tessellates the plane. However, we are not aware of a proof that such an algorithm is impossible. We decide to call BP335 ("tessellates the plane vs. does not tessellate the plane") left-verifiable.

A more strict (less "fuzzy" right-BP508) definition of "left-verifiable" might require us to be certain there exists no foolproof sorting method, rather than just that the average solver will not have a method. See keyword "weakhardsort" for more on this topic.

Bongard Problems such that examples are by default sorted right, until some unforeseen way of fitting left is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

Bongard Problems such that examples are by default sorted right, until some hidden way of fitting left is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

See also "hardsort" (right-BP864) and "creativeexamples" (left-BP866) keywords.

Bongard Problems such that examples are by default sorted right, until some creative way of fitting left is noticed (the solver is never "sure" something should fit right, but can be "sure" something fits left) vs. vice versa.

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

Right-sorted Bongard Problems have the keyword "right-verifiable".

See also "hardsort" (left-BP864) and "creativeexamples" (right-BP866) keywords.

Aaron David Fairbanks