login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: subworld:everything
Displaying 831-840 of 1198 results found. ( prev | next )     page 1 ... 80 81 82 83 84 85 86 87 88 ... 120
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP923 Bongard Problem with solution relating to concept: permutation vs. Bongard Problem unrelated to this concept.
BP842
BP904
BP922
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP918 BP919 BP920 BP921 BP922  *  BP924 BP925 BP926 BP927 BP928

KEYWORD

meta (see left/right), links, metaconcept

CONCEPT This MBP is about BPs that feature concept: "permutation"

WORLD

bp [smaller | same | bigger]

AUTHOR

Leo Crabbe

BP924 Polygons where all sides are different lengths vs. Polygons where not all sides are different lengths.
(edit; present; nest [left/right]; search; history)
COMMENTS

All examples in this Problem are outlines of convex polygons.

This is a generalisation of scalene triangles to any polygon.

CROSSREFS

The left side implies the right side of BP329 (regular vs. irregular polygons), but the converse is not true.

The left side of BP329 implies the right side, but the converse is not true.

Adjacent-numbered pages:
BP919 BP920 BP921 BP922 BP923  *  BP925 BP926 BP927 BP928 BP929

EXAMPLE

Any scalene triangle will fit on the left, because no two sides are equal.

However, any regular polygon will not fit on the left, because all of its sides are equal.

A random convex polygon will "almost surely" fit on the left.

KEYWORD

nice, stretch, right-narrow, traditional

CONCEPT all (info | search)

WORLD

polygon_outline [smaller | same | bigger]

AUTHOR

Jago Collins

BP925 The numbers of dots differ by three vs. not so.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP920 BP921 BP922 BP923 BP924  *  BP926 BP927 BP928 BP929 BP930

KEYWORD

math, unorderedpair, traditional

CONCEPT subtraction (info | search),
number (info | search),
dot (info | search),
three (info | search)

WORLD

two_dot_clusters [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP926 Numbers of dots in ascending order from left to right vs. numbers of dots neither in ascending nor descending order from left to right.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP921 BP922 BP923 BP924 BP925  *  BP927 BP928 BP929 BP930 BP931

KEYWORD

nice, math, sequence, traditional, left-listable, right-listable

CONCEPT number (info | search),
dot (info | search)

WORLD

dot_clusters_sequence_horizontal [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP927 Image of Bongard Problem whose self-sorting depends on examples in it vs. image of Bongard Problem that will sort any Bongard Problem with its solution on either its left or right regardless of examples chosen.
?
?
(edit; present; nest [left/right]; search; history)
COMMENTS

All examples are Bongard Problems fitting left or right in BP793.


All examples here are in the conventional format, i.e. white background, black vertical dividing line, and examples in boxes on either side.


Border cases are Bongard Problems that always self-sort one way given their particular visual format (e.g. fixed number of boxes), but self-sort a different way in another slightly different format.


Meta Bongard Problems appearing in BP793 that are presentationinvariant necessarily fit right here.


It is interesting to think about how this Bongard Problem sorts itself. The only self-consistent answer is that it fits right.

CROSSREFS

See BP793 "sorts self left vs. sorts self right".

See BP944 "sorts every BP on one side vs. doesn't".

Adjacent-numbered pages:
BP922 BP923 BP924 BP925 BP926  *  BP928 BP929 BP930 BP931 BP932

KEYWORD

hard, solved, presentationinvariant, visualimagination

WORLD

boxes_bpimage_sorts_self [smaller | same | bigger]
zoom in left (boxes_bpimage_sorts_self_incarnation_dependent) | zoom in right

AUTHOR

Aaron David Fairbanks

BP928 All subsets of a collection vs. not.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP923 BP924 BP925 BP926 BP927  *  BP929 BP930 BP931 BP932 BP933

KEYWORD

notso, math, traditional

AUTHOR

Aaron David Fairbanks

BP929 Bongard Problems about sequences of arbitrary length vs. Bongard Problems about sequences in which all examples have the same sequence length.
BP350
BP351
BP352
BP353
BP354
BP355
BP926
BP931
BP956
BP986
BP1148
BP1149
BP1197
BP1268
BP1273
BP1274
BP1275
BP1276
(edit; present; nest [left/right]; search; history)
COMMENTS

Left examples have the keyword "sequence" on the OEBP.

Right examples have the keyword "fixedsequence" on the OEBP.


Zero, one, or two objects may technically form a sequence, but if ALL examples of a BP have zero, one, or two objects, we do not consider that BP to be about sequences. BPs about fixed two-object sequences are ordered pairwise comparison BPs, orderedpair.


The world of this Bongard Problem is BP928.

CROSSREFS

See also grid versus fixedgrid.

Adjacent-numbered pages:
BP924 BP925 BP926 BP927 BP928  *  BP930 BP931 BP932 BP933 BP934

KEYWORD

meta (see left/right), links, keyword

WORLD

sequence_visualbp [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP930 BP Pages on the OEBP where users are advised to upload examples that help people (by hinting at the solution) vs. other BP Pages.
BP334
BP349
BP382
BP384
BP569
BP829
BP892
BP945
BP988
BP989
BP1008
BP1016
BP1089
BP1102
BP1161
BP1168
(edit; present; nest [left/right]; search; history)
COMMENTS

Left examples have the keyword "help" on the OEBP.


BPs should be marked "help" when the OEBP wants most examples (at least on one side) to be helpful (not when just one or two uploaded examples are helpful).


Helpfulness can be a spectrum; most Bongard Problems are helpful to some degree just by not using the most convoluted unintelligible examples possible.


Examples that are helpful to people are often not particularly helpful to computers.


Any helpful Bongard Problem has a harder, not helpful version. For example, BP384 (square number of dots versus non-square number of dots) would be much harder if all examples had hundreds of dots that weren't arranged recognizably. Instead, the dots in the examples are always arranged in shapes that make the square-ness or non-square-ness of the numbers easy to check without brute counting.


When all examples in a Bongard Problem are helpful, it may become unclear whether the helpfulness is part of the Bongard Problem's solution.

E.g.: Is the left-hand side of BP384 "square number of dots", or is it "square number of dots that are arranged in a helpful way so as to communicate the square-ness"?


See seemslike, where examples being helpful is an irremovable aspect of the Bongard Problem's solution.

CROSSREFS

Adjacent-numbered pages:
BP925 BP926 BP927 BP928 BP929  *  BP931 BP932 BP933 BP934 BP935

KEYWORD

anticomputer, meta (see left/right), links, keyword, oebp, instruction

WORLD

bppage [smaller | same | bigger]
zoom in left (help_bp)

AUTHOR

Aaron David Fairbanks

BP931 Some number labels its own position in the sequence from left to right vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Right examples are called "derangements".

CROSSREFS

Adjacent-numbered pages:
BP926 BP927 BP928 BP929 BP930  *  BP932 BP933 BP934 BP935 BP936

KEYWORD

handed, leftright, sequence, traditional, left-listable, right-listable

CONCEPT number (info | search),
dot (info | search),
self-reference (info | search)

WORLD

dot_clusters_sequence_horizontal [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP932 Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections).
?
?
(edit; present; nest [left/right]; search; history)
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

( prev | next )     page 1 ... 80 81 82 83 84 85 86 87 88 ... 120

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