login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
BP1200 The whole rectangle can be filled in by successively replacing pairs of adjacent rectangles with one vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Another wording: "can be repeatedly broken along 'fault lines' to yield individual pieces vs not."

REFERENCE

Robert Dawson, A forbidden suborder characterization of binarily composable diagrams in double categories, Theory and Applications of Categories, Vol. 1, No. 7, p. 146-145, 1995.

CROSSREFS

All of the examples fitting left here would fit right in BP1199 except for (1) a single rectangle, (2) two rectangles stacked vertically, or (3) two rectangles side by side horizontally.


All of the examples fitting right in in BP1097 (re-styled) would fit right here (besides a single solid block, but that isn't shown there).

Adjacent-numbered pages:
BP1195 BP1196 BP1197 BP1198 BP1199  *  BP1201 BP1202 BP1203 BP1204 BP1205

KEYWORD

hard, precise, challenge, proofsrequired, inductivedefinition, left-listable, right-listable

AUTHOR

Aaron David Fairbanks

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