Search: keyword:nice
|
| |
|
| BP1157 |
| The order in which the objects in the top half are combined to make the object in the lower half matters vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP1191 |
| One natural way of matching up the two collections vs. multiple natural ways of matching up the two collections. |
|
| |
|
| |
| |
|
|
| |
|
| BP1192 |
| Short, short, long, short, long vs. not. |
|
| |
|
| |
| |
|
|
| |
|
| BP1202 |
| Color of any region is an equal mix of the colors of the overlapping shapes vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP1260 |
| Same transformation applied to circle, triangle, and square vs. different transformations applied. |
|
| |
|
|
|
|
CROSSREFS
|
BP839 is about applying opposite transformations to a single object.
Adjacent-numbered pages:
BP1255 BP1256 BP1257 BP1258 BP1259  *  BP1261 BP1262 BP1263 BP1264 BP1265
|
|
|
KEYWORD
|
easy, nice, abstract, arbitrary, anticomputer, left-null, structure, orderedtriplet, traditional, rules
|
|
|
CONCEPT
|
circle (info | search), analogy (info | search), square (info | search), same (info | search), triangle (info | search), function (info | search)
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP1272 |
| Square minus circle vs. circle minus square. |
|
| ?
 |
|
|
| |
| |
|
|
| |
|
| BP1274 |
| Reversing the sequence permutes the objects vs. not. |
|
| |
|
| |
| |
|
|
| |
|
| BP1292 |
| Requires an even number of paths to cover all black squares vs requires an odd number of paths to cover all black squares |
|
| |
|
|
|
|
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
|
| |
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|