Search: keyword:nice
|
|
BP391 |
| There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2. |
|
| |
|
|
|
|
|
BP393 |
| Correct vs. incorrect. |
|
| |
|
|
|
|
|
BP394 |
| For each colored square only, there exists a path starting on it that covers each square of the figure exactly once vs. there is no path that starts on a colored square and covers each square of the figure exactly once. |
|
| |
|
|
|
|
|
BP517 |
| Meta Bongard Problems that sort themselves left vs. meta Bongard Problems that sort themselves right. |
|
| |
|
|
|
|
|
BP523 |
| Same amount of black in any vertical slice vs. varying amounts of black in vertical slices. |
|
| |
|
|
|
|
|
BP533 |
| Contains smaller copy of itself vs. doesn't. |
|
| |
|
|
|
|
|
BP543 |
| Image depicting infinitely many objects vs. image depicting finitely many objects. |
|
| |
|
|
|
|
|
BP557 |
| Equal horizontal length vs. not |
|
| |
|
|
|
|
|
BP558 |
| Point sequence that is increasing or decreasing in height vs. point sequence that alternates in height |
|
| |
|
|
|
|
|
BP559 |
| Cross section of a cube vs. not cross section of a cube |
|
| |
|
|
COMMENTS
|
All examples in this Problem are solid black shapes.
This problem is absurdly hard. It makes a good extreme example. - Aaron David Fairbanks, Nov 23 2020 |
|
CROSSREFS
|
Adjacent-numbered pages:
BP554 BP555 BP556 BP557 BP558  *  BP560 BP561 BP562 BP563 BP564
|
|
KEYWORD
|
hard, nice, precise, allsorted, notso, stretch, challenge, left-narrow, perfect
|
|
CONCEPT
|
cube (info | search), cross_section (info | search)
|
|
WORLD
|
fill_shape [smaller | same | bigger]
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|
|
|