login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: all:new
Displaying 81-90 of 699 results found. ( prev | next )     page 1 ... 5 6 7 8 9 10 11 12 13 ... 70
     Sort: recent      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1137 Constructible Polygon vs. Non-constructible Polygon
(edit; present; nest [left/right]; search; history)
REFERENCE

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


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

CROSSREFS

Adjacent-numbered pages:
BP1132 BP1133 BP1134 BP1135 BP1136  *  BP1138 BP1139 BP1140 BP1141 BP1142

KEYWORD

stub, precise, math, hardsort, proofsrequired, preciseworld

AUTHOR

Jago Collins

BP1136 The removal of any one loop disentangles the whole arrangement vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Left-hand examples are called "Brunnian links".

REFERENCE

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

CROSSREFS

Adjacent-numbered pages:
BP1131 BP1132 BP1133 BP1134 BP1135  *  BP1137 BP1138 BP1139 BP1140 BP1141

KEYWORD

precise, hardsort

CONCEPT knot (info | search)

WORLD

link [smaller | same | bigger]

AUTHOR

Leo Crabbe

BP1135 Each component can be assigned its own layer in the arrangement vs. there is no equivalent way of dividing the arrangement into layers.
(edit; present; nest [left/right]; search; history)
COMMENTS

Put differently, if the examples are imagined to be arrangements of rigid sticks/hoops/etc resting on a flat surface, positive examples include sticks/hoops/etc that could be picked up without disturbing the other objects.

CROSSREFS

Adjacent-numbered pages:
BP1130 BP1131 BP1132 BP1133 BP1134  *  BP1136 BP1137 BP1138 BP1139 BP1140

KEYWORD

precise

AUTHOR

Leo Crabbe

BP1133 Impossible to realize in 3D space vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Each unit is to be imagined as a flat rigid rod/hoop/triangle/etc.

REFERENCE

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

CROSSREFS

Similar to BP252.

Adjacent-numbered pages:
BP1128 BP1129 BP1130 BP1131 BP1132  *  BP1134 BP1135 BP1136 BP1137 BP1138

KEYWORD

precise

CONCEPT rigidity (info | search),
impossible (info | search)

AUTHOR

Leo Crabbe

BP1132 Circle that passes through points is contained within bounding box vs. not so.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1127 BP1128 BP1129 BP1130 BP1131  *  BP1133 BP1134 BP1135 BP1136 BP1137

KEYWORD

precise, allsorted, boundingbox, hardsort, preciseworld, absoluteposition

CONCEPT circle (info | search),
imagined_entity (info | search)

WORLD

three_points [smaller | same | bigger]

AUTHOR

Leo Crabbe

BP1131 One shape can be totally obscured by the other vs. neither shape can be obscured.
(edit; present; nest [left/right]; search; history)
COMMENTS

Rotation of shapes is not required for any left-hand panels, but it should not change any example's sorting if it is considered.

CROSSREFS

Adjacent-numbered pages:
BP1126 BP1127 BP1128 BP1129 BP1130  *  BP1132 BP1133 BP1134 BP1135 BP1136

KEYWORD

nice, precise, allsorted, pixelperfect, unorderedpair

CONCEPT overlap (info | search)

WORLD

2_shapes [smaller | same | bigger]

AUTHOR

Leo Crabbe

BP1130 Start with a rectangle subdivided further into rectangles and shrink the vertical lines into points vs. the shape does not result from this process.
?
(edit; present; nest [left/right]; search; history)
COMMENTS

The description in terms of rectangles was noted by Sridhar Ramesh when he solved this.


All examples in this Bongard Problem feature arced line segments connected at endpoints; these segments do not cross across one another and they are nowhere vertical; they never double back over themselves in the horizontal direction.

Furthermore, in each example, there is a single leftmost point and a single rightmost point, and every segment is part of a path bridging between them. So, there is a topmost total path of segments and bottommost total chain of segments.


Any picture on the left can be turned into a subdivided rectangle by the process of expanding points into vertical lines.


Here is another answer:

"Right examples: some junction point has a single line coming out from either the left or right side."


If there is some junction point with only a single line coming out from a particular side, the point cannot be expanded into a vertical segment with two horizontal segments bookending its top and bottom (as it would be if this were a subdivision of a rectangle).


And this was the original, more convoluted idea of the author:

"Start with a string along the top path. Sweep it down, region-by-region, until it lies along the bottom path. The string may only enter a region when it fully covers that region's top edge and likewise it must exit by fully covering the bottom edge. Only in left images can this process be done so that no segment of the string ever hesitates."

Quite convoluted when spelled out in detail, but not terribly complicated to imagine visually. (See the keyword unwordable.)


The string-sweeping answer is the same as the rectangle answer because a rectangle represents the animation of a string throughout an interval of time. (A horizontal cross-section of the rectangle represents the string, and the vertical position is time.) Distorting the rectangle into a new shape is the same as animating a string sweeping across that new shape.

In particular, shrinking vertical lines of a rectangle into points means just those points of the string stay still as the string sweeps down.

The principle that horizontal lines subdividing the original rectangle become the segments in the final picture corresponds to the idea that the string must enter or exit a single region all at once.

CROSSREFS

BP1129 started as an incorrect solution for this Bongard Problem. Anything fitting right in BP1130 fits right in BP1129.

Adjacent-numbered pages:
BP1125 BP1126 BP1127 BP1128 BP1129  *  BP1131 BP1132 BP1133 BP1134 BP1135

KEYWORD

hard, unwordable, solved

CONCEPT topological_transformation (info | search),
imagined_motion (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1129 An oval is sorted left; shapes are sorted left when they can be built out of others sorted left by A) joining side by side (at a point) or B) joining one on top of the other (joining one's entire bottom edge to the other's entire top edge).
(edit; present; nest [left/right]; search; history)
COMMENTS

This was an unintended solution for BP1130.


In category theory lingo, left examples are built by repeated horizontal composition and vertical composition. (Making horizontal lines as 0-ary vertical compositions is here forbidden.)

CROSSREFS

Anything fitting right in BP1130 fits right here.

Adjacent-numbered pages:
BP1124 BP1125 BP1126 BP1127 BP1128  *  BP1130 BP1131 BP1132 BP1133 BP1134

KEYWORD

hard, less, convoluted, solved, inductivedefinition

CONCEPT or (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1127 There is no rule for how the objects in a cluster interrelate vs. there is.
(edit; present; nest [left/right]; search; history)
COMMENTS

Other ways of phrasing this:

"Local" vs. "global" properties of collections: to check a collection satisfies a "local" property, it is only necessary to check each individual thing in it satisfies some property.

The rule all collections satisfy is just "every object is a ___" vs. the rule is something more.

CROSSREFS

Adjacent-numbered pages:
BP1122 BP1123 BP1124 BP1125 BP1126  *  BP1128 BP1129 BP1130 BP1131 BP1132

KEYWORD

abstract, creativeexamples, left-unknowable, rules, miniworlds

CONCEPT local_global (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1123 Can be cut into tiles forming a checkerboard pattern vs. not so.
?
(edit; present; nest [left/right]; search; history)
COMMENTS

All examples in this Problem are grids consisting of two objects.

CROSSREFS

Adjacent-numbered pages:
BP1118 BP1119 BP1120 BP1121 BP1122  *  BP1124 BP1125 BP1126 BP1127 BP1128

EXAMPLE

EX9124 shows a 9 square by 9 square grid. Take each tile to be 3 squares by 3 squares; there is a 3 tile by 3 tile checkerboard pattern. (One of these tiles is itself a checkerboard pattern; the other is all black squares.)

KEYWORD

hard, nice, precise, allsorted, hardsort, grid, miniworlds

AUTHOR

Jago Collins

( prev | next )     page 1 ... 5 6 7 8 9 10 11 12 13 ... 70

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary