Search: keyword:challenge
|
Displaying 1-9 of 9 results found.
|
page 1
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP559 |
| Cross section of a cube vs. not cross section of a cube |
|
| |
|
|
COMMENTS
|
All examples in this Problem are solid black shapes.
This problem is absurdly hard. It makes a good extreme example. - Aaron David Fairbanks, Nov 23 2020 |
|
CROSSREFS
|
Adjacent-numbered pages:
BP554 BP555 BP556 BP557 BP558  *  BP560 BP561 BP562 BP563 BP564
|
|
KEYWORD
|
hard, nice, precise, allsorted, notso, stretch, challenge, left-narrow, perfect
|
|
CONCEPT
|
cube (info | search), cross_section (info | search)
|
|
WORLD
|
fill_shape [smaller | same | bigger]
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP801 |
| Number pointed to on number line is "important" mathematical constant vs. not so. |
|
| |
|
|
|
|
|
BP860 |
| Finitely many copies of the shape can be arranged such that they are locked together vs. not so. |
|
| |
|
|
CROSSREFS
|
This is a generalisation of BP861.
Adjacent-numbered pages:
BP855 BP856 BP857 BP858 BP859  *  BP861 BP862 BP863 BP864 BP865
|
|
KEYWORD
|
hard, nice, stub, precise, stretch, unstable, hardsort, challenge, creativeexamples, perfect, pixelperfect
|
|
CONCEPT
|
tiling (info | search)
|
|
WORLD
|
fill_shape [smaller | same | bigger]
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP944 |
| Image of Bongard Problem that would sort ANY image of a valid Bongard Problem on one of its sides vs. image of Bongard Problem whose categorization of a BP image would depend on the solution or examples in it. |
|
| |
|
|
COMMENTS
|
"Any" here means any image of a Bongard Problem in the relevant format, i.e. with white background, black vertical dividing line, and examples in boxes on either side.
All examples shown in this Problem clearly sort themselves on the left or right.
A self-referential but maybe simpler solution is "would sort all examples in this whole Bongard Problem on one of its sides vs. not so." Users adding examples please try to maintain this: for any example you add to the right of this Bongard Problem, make sure it does not sort all the other examples in this Bongard Problem on just one of its sides. - Aaron David Fairbanks, Aug 26 2020 |
|
CROSSREFS
|
Adjacent-numbered pages:
BP939 BP940 BP941 BP942 BP943  *  BP945 BP946 BP947 BP948 BP949
|
|
KEYWORD
|
hard, challenge, presentationinvariant
|
|
WORLD
|
boxes_bpimage_sorts_self [smaller | same | bigger] zoom in left | zoom in right
|
|
AUTHOR
|
Jago Collins
|
|
|
|
|
BP998 |
| X "X Y" vs. all are "X Y"; X Z. |
|
| ?
| ?
|
|
|
|
COMMENTS
|
Right:
All are "all but one are ___"; all but one are black.
All are "every other is ___"; every other is solid polygons.
All are "gradually becoming ___"; gradually becoming thickly outlined.
Left:
All but one are "all but one are ___".
Every other is "every other is ___".
Gradually becoming "gradually becoming ___".
Here is another way of putting it:
Call it "meta" when the whole imitates its parts, and call it "doubly-meta" when the whole imitates its parts with respect to the way it imitates its parts. Left are doubly-meta, while right are just meta.
Here is a more belabored way of putting it:
Call something like "is star-shaped" a "rule". An object can fit a rule.
Call something like "all but one are ___" a "rule-parametrized rule". A collection of objects, with respect to a particular rule, can fit a rule-parametrized rule.
A drawing on the right shows many collections. Every collection fits the same rule-parametrized rule (with respect to various rules); furthermore the collection of collections fits that same rule-parametrized rule (with respect to some rule collections can fit).
Likewise a drawing on the left shows a collection of collections, with some noticeable recurring rule-parametrized rule. The collection of collections must fit that rule-parametrized rule with respect to the rule of fitting that rule-parametrized rule (with respect to various rule).
An unintended solution to this BP is "not all groups share some noticeable property vs. all do." It is hard to come up with examples foiling this alternative solution because (what was above called) the rule-parametrized rule usually has to do with not all objects in the collection fitting the rule. (See BP568, which is about BP ideas that are always overridden by a simpler solution.)
Some examples would fit left under a certain interpretation: EX8220 "all are 'all are ___' " and EX8222 "palindrome with respect to being a palindrome with respect to ___" (every shown collection is a palindrome with respect to some property, and all things in a list being the same is a palindrome). But those rules are not necessarily the most obvious ways of interpreting these pictures, so they have been marked as ambiguous. Either of these placed on the left would prevent the intended solution being overridden (see the previous paragraph).
Here is a list of left example ideas that would be impossible to make:
- Exhaustive list of all exhaustive lists of all ____. |
|
CROSSREFS
|
The right side of this Problem is a subset of BP999left.
Adjacent-numbered pages:
BP993 BP994 BP995 BP996 BP997  *  BP999 BP1000 BP1001 BP1002 BP1003
|
|
EXAMPLE
|
"Odd one out with respect to what property is the odd one out" would not fit left in this Problem: even though this example does seem doubly-meta, it is not doubly-meta in the right way. There is no odd one out with respect to the property of having an odd one out.
Similarly, consider "gradual transition with respect to what the gradual transition is between", etc. Instead of having the form "X 'X __' ", this is more like "X [the __ appearing in 'X __'] ". Examples like these two could make for a different Bongard Problem. |
|
KEYWORD
|
hard, unwordable, challenge, overriddensolution, infodense, contributepairs, funny, rules, miniworlds
|
|
CONCEPT
|
self-reference (info | search)
|
|
WORLD
|
zoom in right
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP1011 |
| Polygon can be inscribed in a circle vs. not so. |
|
| |
|
|
|
|
|
BP1120 |
| No same-sized copies of self overlap vs. distinct same-sized copies overlap. |
|
| |
|
|
|
|
|
BP1200 |
| The whole rectangle can be filled in by successively replacing pairs of adjacent rectangles with one vs. not so. |
|
| |
|
|
COMMENTS
|
Another wording: "can be repeatedly broken along 'fault lines' to yield individual pieces vs not." |
|
REFERENCE
|
Robert Dawson, A forbidden suborder characterization of binarily composable diagrams in double categories, Theory and Applications of Categories, Vol. 1, No. 7, p. 146-145, 1995. |
|
CROSSREFS
|
All of the examples fitting left here would fit right in BP1199 except for (1) a single rectangle, (2) two rectangles stacked vertically, or (3) two rectangles side by side horizontally.
All of the examples fitting right in in BP1097 (re-styled) would fit right here (besides a single solid block, but that isn't shown there).
Adjacent-numbered pages:
BP1195 BP1196 BP1197 BP1198 BP1199  *  BP1201 BP1202 BP1203 BP1204 BP1205
|
|
KEYWORD
|
hard, precise, challenge, proofsrequired, inductivedefinition, left-listable, right-listable
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP1245 |
| When two players alternate coloring regions, either can force connection from top edge to bottom edge vs. either can force connection from left edge to right edge. |
|
| |
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|
|