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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

One interpretation of the axioms of topology (a subject of mathematics--see https://en.wikipedia.org/wiki/Topology ) is that a topology describes the observability of various properties. (The topological "neighborhoods" of a point are the subsets one could determine the point to be within using a finite number of measurements.) The analogue of a property that is nowhere directly observable is a "subset with empty interior".

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

One interpretation of the axioms of topology (a subject of mathematics--see https://en.wikipedia.org/wiki/Topology ) is that a topology describes the observability of various properties. (The topological "neighborhoods" of a point are the subsets one could determine the point to be within using a finite number of measurements.) The analogue of a property that is nowhere directly observable is a "subset with empty interior".

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

One interpretation of the axioms of topology (a subject of mathematics--see https://en.wikipedia.org/wiki/Topology ) is that a topology describes the observability of various properties. (The topological neighborhoods of a point are the subsets that the point might be determined to be within using a finite number of measurements.) The analogue of a property that is nowhere directly observable is a "subset with empty interior".

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and uncertainty about whether there is more information to be found. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Sometimes an unknowable BP can be turned into a couldbe BP by explicitly restricting the amount of available information. For example, using a low resolution for all pictures can simplify the issue of detecting some properties that would be "unknowable" for hypothetical infinitely detailed pictures. Many fractal-based BPs are this way (e.g. BP1122).

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

A Bongard Problem with examples on both sides cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and uncertainty about whether there is more information to be found. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Sometimes an unknowable BP can be turned into a couldbe BP by explicitly restricting the amount of available information. For example, using a low resolution for all pictures can make explicit what would be "unknowable" for hypothetical infinitely detailed pictures. Many fractal-based BPs are this way (e.g.

BP1122).

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

A Bongard Problem with examples on both sides cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and uncertainty about whether there is more information to be found. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Sometimes an unknowable BP can be turned into a couldbe BP by explicitly restricting the amount of available information. For example, using a low resolution for all pictures can simplify what would be "unknowable" for hypothetical infinitely detailed pictures. Many fractal-based BPs are this way (e.g.

BP1122).

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

A Bongard Problem with examples on both sides cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and uncertainty about whether there is more information to be found. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and uncertainty about whether there is more information to be found. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are different. Unlike unknowable BPs, couldbe BPs can sort examples with certainty. For any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are quite different. A "couldbe" keyword means some relevant information has explicitly been left out. So unlike left- and right- unknowable BPs, left- and right- couldbe BPs can sort their examples unambiguously--for any example sorted on the "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems are generally "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are quite different. A "couldbe" keyword means some relevant information has explicitly been left out. So unlike left- and right- unknowable BPs, left- and right- couldbe BPs can sort their examples unambiguously--for any example sorted on the "could be" side, there is a clear (knowable) absence of information that would justify the example being on the other side.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are quite different. An "unknowable" keyword means on that side it is never clear whether hidden information is still to be found by searching. A "couldbe" keyword means some relevant information is always explicitly left out. So unlike left- and right- unknowable BPs, left- and right- couldbe BPs can sort their examples unambiguously--for any example sorted on the "could be" side, you know you will never find information that convinces you to sort the example on the other side--that information is plainly absent.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- or right- unknowable.

Many Bongard Problems are about finding a rule that a structure of objects satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and it is nowhere specified what kind of rule it is or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

The perfect example is BP1163.

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases from the Bongard Problem entirely.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Sometimes a Bongard Problems is almost left- (resp. right-) unknowable, but a few left (resp. right) examples spoil it by being obviously disqualified from the other side for some reason. It may make for a cleaner Bongard Problem to exclude these exceptional disqualified cases from the Bongard Problem entirely.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason they are not seeing it fits there.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)

Because of this, it is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

Left- or right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Although the descriptions of "left-couldbe" and "right-couldbe" (BP1159) sound similar to "left-unknowable" and "right-unknowable", they are quite different. An "unknowable" keyword means on that side it is never clear whether hidden information is still to be found by searching. A "couldbe" keyword means some relevant information is always explicitly left out. So unlike left- and right- unknowable BPs, left- and right- couldbe BPs can sort their examples unambiguously--for any example sorted on the "could be" side, you know you will never find information that convinces you to sort the example on the other side--that information is plainly absent.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- (or right-) unknowable.

Many Bongard Problems are about finding a rule that a structure of objects satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and it is nowhere specified what kind of rule it is or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- (or right-) unknowable.

Many Bongard Problems are about finding a rule that a structure of objects satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and it is nowhere specified what kind of rule it is or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

A Bongard Problem cannot be both "proofsrequired" (left-BP1125) and left- (or right-) unknowable.

Many Bongard Problems are about finding a rule that a structure of objects satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and it is nowhere specified what kind of rule it is or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

Left- or right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867): an example fits on one side just in case it cannot be observed to fit on the other.

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

Many Bongard Problems are about finding a rule that a structure of objects satisfies (keyword "rules" left-BP1158)--in each panel a rule is to be found, and it is nowhere specified what kind of rule it is or how abstract it can be. (Just like a Bongard Problem.) Bongard Problems about rules like this with solution "There is a rule vs. there isn't" (resp. vice versa) are always right- (resp. left-) unknowable.

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Left- and right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867)

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).

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

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

Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.

If a Bongard Problem is (say) "left-unknowable", then any individual example cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the "noproofs" keyword right-BP1125.)

Left- and right- unknowable Bongard Problems tend to be "notso" Bongard Problems (left-BP867)

Right-unknowable Bongard Problems are often "left-narrow", left-BP514 (and left-unknowable Bongard Problems are often "right-narrow", left-BP513).

Left- and right- unknowable Bongard Problems also tend to have the keyword "creativeexamples" (left-BP866).