login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: world:BP1193
Displaying 1-2 of 2 results found.     page 1
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1192 Short, short, long, short, long vs. not.
(edit; present; nest [left/right]; search; history)
COMMENTS

All examples in this Problem are paths of short and long line segments which do not self-intersect. This could be a useful world to use in an abstract binary sequence BP.

CROSSREFS

Adjacent-numbered pages:
BP1187 BP1188 BP1189 BP1190 BP1191  *  BP1193 BP1194 BP1195 BP1196 BP1197

KEYWORD

nice, notso, arbitrary, traditional

WORLD

[smaller | same | bigger]

AUTHOR

Jago Collins

BP1193 Long, short, short, short vs. short, long, long, short
(edit; present; nest [left/right]; search; history)
COMMENTS

In morse code, the solution to this BP is B vs. P.

CROSSREFS

Adjacent-numbered pages:
BP1188 BP1189 BP1190 BP1191 BP1192  *  BP1194 BP1195 BP1196 BP1197 BP1198

KEYWORD

arbitrary, funny, neither

WORLD

[smaller | same | bigger]

AUTHOR

Jago Collins

    page 1

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