Find the euclidian, city block, and chessboard distances between the two extreme diagonal squares for the given patch. 1.41,2,1 1.41,1,2 2.82,2,4 2.82,4,2

It seems like there's some confusion in your question. The Euclidean, City Block (Manhattan), and Chessboard (Chebyshev) distances are concepts used in mathematics to measure the distance between two points in a space. However, the data you've provided doesn't clearly represent two distinct points in a space.

Typically, a point in a 2D space is represented as (x, y) and in a 3D space as (x, y, z). If you could provide two such points, I'd be able to help you calculate these distances.

For example, if you have two points in a 2D space, (x1, y1) and (x2, y2), the distances would be calculated as follows:

1. Euclidean distance: sqrt((x2-x1)^2 + (y2-y1)^2)
2. City Block (Manhattan) distance: |x2-x1| + |y2-y1|
3. Chessboard (Chebyshev) distance: max(|x2-x1|, |y2-y1|)

If you could clarify your question, I'd be happy to help further!