Search: https://www.galaxus.ch/en/sector/showdiscussion/snapchathacking-visit-kunghaccom-5hflaboo-226168
|
|
|
|
|
Sort:
relevance
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
|
| |
|
| BP1051 |
| White is multiple of black vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP328 |
| All sides are equal vs. all angles are equal. |
|
| |
|
| |
| |
|
|
| |
|
| BP338 |
| High approximate similarity vs. lower approximate similarity. |
|
| |
|
| |
| |
|
|
| |
|
| BP979 |
| It is possible to deduce the contents of the missing square vs. not so. |
|
| ?
 |
|
|
|
|
|
COMMENTS
|
All examples show grids of squares with an image in each square, such that there is some "rule" the images within the grid obey. The "rule" can be about how the images relate to their neighbors, it can involve the position of the images in the grid, and it can involve properties of the grid considered as a whole. One square from somewhere along the edge of the grid is removed.
Intentionally left out of this Bongard Problem (or left as sorted ambiguously) are cases in which there is no clear rule, or it is not possible to deduce what the intended rule is without seeing more squares (e.g. EX8097). Due to this choice to omit those kinds of examples from the right, another acceptable solution is "it is possible to deduce the contents of the missing square once the underlying rule is understood vs. not so." |
|
|
REFERENCE
|
https://en.wikipedia.org/wiki/Raven%27s_Progressive_Matrices |
|
|
CROSSREFS
|
BP1258 is very similar: whether ALL squares can be deduced from the rest.
Adjacent-numbered pages:
BP974 BP975 BP976 BP977 BP978  *  BP980 BP981 BP982 BP983 BP984
|
|
|
KEYWORD
|
nice, notso, structure, rules, miniworlds
|
|
|
CONCEPT
|
convey_enough_information (info | search), choice (info | search)
|
|
|
WORLD
|
grid_of_images_with_rule_one_on_edge_missing [smaller | same | bigger]
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP873 |
| Solution involves discrete quantity vs. solution involves continuous quantity. |
|
| |
|
| |
| |
|
|
| |
|
| BP957 |
| Images of Bongard Problems that sort an image of their left side on their left and an image of their right side on their right vs. images of Bongard Problems that sort an image of their left side on their right and an image of their right side on their left. |
|
| |
|
| |
| |
|
|
| |
|
| BP932 |
| Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections). |
|
| ?
 | ?
 |
|
|
|
|
|
COMMENTS
|
Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).
Left examples are called "fully connected graphs." Right examples are called "cycle graphs." |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP927 BP928 BP929 BP930 BP931  *  BP933 BP934 BP935 BP936 BP937
|
|
|
KEYWORD
|
precise, left-narrow, right-narrow, both, preciseworld
|
|
|
CONCEPT
|
graph (info | search), distinguishing_crossing_curves (info | search), all (info | search), loop (info | search)
|
|
|
WORLD
|
connected_graph [smaller | same | bigger]
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP53 |
| Inside figure has fewer angles than outside figure vs. inside figure has more angles than outside figure. |
|
| |
|
|
|
|
REFERENCE
|
M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 231. |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP48 BP49 BP50 BP51 BP52  *  BP54 BP55 BP56 BP57 BP58
|
|
|
KEYWORD
|
spectrum, finished, traditional, discrete, viceversa, bongard
|
|
|
CONCEPT
|
inside (info | search), number (info | search), quantity_comparison (info | search)
|
|
|
AUTHOR
|
Mikhail M. Bongard
|
| |
| |
|
|
|
|
|
|
|
|