login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: keyword:blackwhite
Displaying 11-13 of 13 results found. ( prev )     page 1 2
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1249 Any straight path will hit a black region vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

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

CROSSREFS

Adjacent-numbered pages:
BP1244 BP1245 BP1246 BP1247 BP1248  *  BP1250 BP1251 BP1252 BP1253 BP1254

KEYWORD

notso, blackwhite, right-null, perfect, bordercontent

CONCEPT imagined_line_or_curve (info | search)

AUTHOR

Leo Crabbe

BP1252 No entirely white paths from one side to another vs. one can find such a path.
(edit; present; nest [left/right]; search; history)
COMMENTS

The left-sorted patterns connect all four corners with a single black region. - Rhodri Prysor, Oct 16 2024

CROSSREFS

Adjacent-numbered pages:
BP1247 BP1248 BP1249 BP1250 BP1251  *  BP1253 BP1254 BP1255 BP1256 BP1257

KEYWORD

precise, allsorted, notso, blackwhite, right-null, bordercontent

AUTHOR

Leo Crabbe

BP1292 Requires an even number of paths to cover all black squares vs requires an odd number of paths to cover all black squares
(edit; present; nest [left/right]; search; history)
COMMENTS

A path is formally defined as a sequence of black squares such that no two squares are the same and every pair of consecutive black squares are orthogonally adjacent to each other.


Every grid on the left requires a minimum of an even number of paths such that every black square is a part of exactly one path, while every grid on the right requires a minimum of an odd number of paths to do so.

CROSSREFS

Adjacent-numbered pages:
BP1287 BP1288 BP1289 BP1290 BP1291  *  BP1293 BP1294

EXAMPLE

A grid with all whites fits on the left because it does not contain black squares, hence requiring 0 paths, an even number.


A grid with all blacks requires 1 path to go through all black squares (such as a zigzag through every row), an odd number.


The checkerboard grid on the left contains 12 black squares that cannot be joined with a path, hence it requires 12 paths, an even number.

KEYWORD

nice, blackwhite, fixedgrid, left-listable, right-listable

CONCEPT path (info | search)

AUTHOR

Matt Nguyen

( prev )     page 1 2

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