Search: keyword:perfect
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP816 |
| Cross section of a cylinder vs. not cross section of a cylinder |
|
| |
|
|
|
|
|
BP852 |
| Object shown below is the "limit" of the sequence above (end result after "infinite time") versus not so. |
|
| |
|
|
|
|
|
BP859 |
| Black pixel vs. white pixel. |
|
| |
|
|
|
|
|
BP860 |
| Finitely many copies of the shape can be arranged such that they are locked together vs. not so. |
|
| |
|
|
CROSSREFS
|
This is a generalisation of BP861.
Adjacent-numbered pages:
BP855 BP856 BP857 BP858 BP859  *  BP861 BP862 BP863 BP864 BP865
|
|
KEYWORD
|
hard, nice, stub, precise, stretch, unstable, hardsort, challenge, creativeexamples, perfect, pixelperfect
|
|
CONCEPT
|
tiling (info | search)
|
|
WORLD
|
fill_shape [smaller | same | bigger]
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP861 |
| Shape can be combined with a copy of itself such that they are locked together vs. not so. |
|
| |
|
|
|
|
|
BP869 |
| Approximately symmetric vs. asymmetric. |
|
| |
|
|
|
|
|
BP892 |
| Black shapes can be arranged such that they fit inside rectangular outline vs. not so. |
|
| ?
|
|
|
|
|
|
|
BP912 |
| Imperfectly drawn shapes vs. perfectly drawn shapes. |
|
| |
|
|
|
|
|
| |
|
|
COMMENTS
|
A spot-the-difference exercise.
Arguably invalid (solution not simple). |
|
CROSSREFS
|
Adjacent-numbered pages:
BP915 BP916 BP917 BP918 BP919  *  BP921 BP922 BP923 BP924 BP925
|
|
KEYWORD
|
less, precise, convoluted, arbitrary, stretch, unstable, left-finite, left-full, perfect, pixelperfect, experimental, funny
|
|
CONCEPT
|
imperfection_small (info | search), specificity (info | search)
|
|
WORLD
|
bmp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP934 |
| If "distance" is taken to be the sum of horizontal and vertical distances between points, the 3 points are equidistant from each other vs. not so. |
|
| |
|
|
COMMENTS
|
In other words, we take the distance between points (a,b) and (c,d) to be equal to |c-a| + |d-b|, or, in other words, the distance of the shortest path between points that travels along grid lines. In mathematics, this way of measuring distance is called the 'taxicab' or 'Manhattan' metric. The points on the left hand side form equilateral triangles in this metric.
⠀
An alternate (albeit more convoluted) solution that someone may arrive at for this Problem is as follows: The triangles formed by the points on the left have some two points diagonal to each other (in the sense of bishops in chess), and considering the corresponding edge as their base, they also have an equal height. However, this was proven to be equivalent to the Manhattan distance answer by Sridhar Ramesh. Here is the proof:
⠀
An equilateral triangle amounts to points A, B, and C such that B and C lie on a circle of some radius centered at A, and the chord from B to C is as long as this radius.
A Manhattan circle of radius R is a turned square, ♢, where the Manhattan distance between any two points on opposite sides is 2R, and the Manhattan distance between any two points on adjacent sides is the larger distance from one of those points to the corner connecting those sides. Thus, to get two of these points to have Manhattan distance R, one of them must be a midpoint of one side of the ♢ (thus, bishop-diagonal from its center) and the other can then be any point on an adjacent side of the ♢ making an acute triangle with the aforementioned midpoint and center. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP929 BP930 BP931 BP932 BP933  *  BP935 BP936 BP937 BP938 BP939
|
|
KEYWORD
|
hard, allsorted, solved, left-finite, right-finite, perfect, pixelperfect, unorderedtriplet, finishedexamples
|
|
CONCEPT
|
triangle (info | search)
|
|
WORLD
|
3_dots_on_square_grid [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
|
|
|
|
|
|
|
|
|
|