login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: +meta:BP742
Displaying 11-16 of 16 results found. ( prev )     page 1 2
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP389 Loops are entangled (in 3-D) vs. loops can be separated (in 3-D).
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP384 BP385 BP386 BP387 BP388  *  BP390 BP391 BP392 BP393 BP394

KEYWORD

nice, precise, allsorted, contributepairs, traditional

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

WORLD

link_two_knots [smaller | same | bigger]

AUTHOR

Jago Collins

BP850 Shape can be maneuvered around the corner vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

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

CROSSREFS

Adjacent-numbered pages:
BP845 BP846 BP847 BP848 BP849  *  BP851 BP852 BP853 BP854 BP855

KEYWORD

nice, precise, physics, creativeexamples, proofsrequired, left-narrow, right-narrow, dithering

CONCEPT rotation_required (info | search),
imagined_motion (info | search),
physically_fitting (info | search)

AUTHOR

Leo Crabbe

BP856 Compound shape would hit the dot if rotated vs. not so.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP851 BP852 BP853 BP854 BP855  *  BP857 BP858 BP859 BP860 BP861

KEYWORD

nice, precise, allsorted, left-narrow, preciseworld

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

AUTHOR

Leo Crabbe

BP933 Ball will reach edge of bounding box under gravity vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Strictly this Problem's solution is not actually about gravity, it is about a constant downwards force (the ball's time-independent path does not depend on the magnitude of the force, only direction). The phrasing for the solution is a shorthand that takes advantage of human physical intuition.

CROSSREFS

Adjacent-numbered pages:
BP928 BP929 BP930 BP931 BP932  *  BP934 BP935 BP936 BP937 BP938

KEYWORD

physics

CONCEPT bounding_box (info | search),
imagined_motion (info | search),
gravity (info | search)

WORLD

dot_with_lines_or_curves [smaller | same | bigger]

AUTHOR

Leo Crabbe

BP1016 Rigid vs. not rigid.
(edit; present; nest [left/right]; search; history)
REFERENCE

Henneberg, L. (1911), Die graphische Statik der starren Systeme, Leipzig

Jackson, Bill. (2007). Notes on the Rigidity of Graphs.

Laman, Gerard. (1970), "On graphs and the rigidity of plane skeletal structures", J. Engineering Mathematics, 4 (4): 331–340.

Pollaczek‐Geiringer, Hilda (1927), "Über die Gliederung ebener Fachwerke", Zeitschrift für Angewandte Mathematik und Mechanik, 7 (1): 58–72.

CROSSREFS

Adjacent-numbered pages:
BP1011 BP1012 BP1013 BP1014 BP1015  *  BP1017 BP1018 BP1019 BP1020 BP1021

KEYWORD

nice, physics, help

CONCEPT rigidity (info | search),
graph (info | search),
imagined_motion (info | search)

WORLD

planar_connected_graph [smaller | same | bigger]
zoom in left (rigid_planar_connected_graph)

AUTHOR

Aaron David Fairbanks

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

( prev )     page 1 2

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