Chebyshev distance

Chebyshev distance is named after Pafnuty Chebyshev

Chebyshev distance is a metric used in mathematics to measure the distance between two points in a coordinate space. It is defined as the greatest of their differences along any coordinate dimension. This metric is particularly useful in situations where movement is restricted to grid-like paths, such as in chess or urban grid layouts.

Example

In chess, the minimum number of moves needed by a king to go from one square to another equals the Chebyshev distance between the centers of the squares. For instance, moving from f6 to e2 requires 4 moves, which corresponds to the Chebyshev distance of 4.

Remember this

Understanding Chebyshev distance helps in analyzing movements and optimizing paths in grid-like environments, such as chess or urban planning.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Euclidean geometry

Euclidean distance measures absolute position in space

cosine similarity works better than Euclidean distance in high dimensions

Cosine similarity measures orientation, not magnitude, making it more robust to irrelevant dimensions in high-dimensional spaces

t-SNE preserves local structure

Can we see the hidden patterns in a cloud of data points?

Distance transform

Manhattan distance formula: |x1 - x2| + |y1 - y2|

non-convex loss landscapes are hard: many local minima and saddle points

Why do some hills have more tricky paths than others?

BFS vs DFS: BFS finds shortest path in unweighted graphs, DFS uses less memory

BFS finds shortest path in unweighted graphs; DFS uses less memory

Swipe through 100 ML concepts daily

Open Pocket Polymath