![]() StartingPoints Referenced by Homepages
|
Manhattan distance
Keywords: Theory, Go term
Manhattan distance is a measure of the distance between two vertices used in computer go. It is determined as the number of horizontal and vertical steps one has to take to go from one stone to another.
For example, the diagram shows the path from An additional requirement can be set, demanding that the opponent's stones are never touched along the path.
A "circle" is defined as the set of all points that have the same distance from a given point.
Fhayashi: Presumably, the name reflects the fact that in modern urban cities with orthogonal streets, regardless of the straight-line distance between two points, the practical distance is the number of block-sides you must transit to get to your destination...
Velobici: The concept is discussed on detail in the book The Manhatten distance is between 2 stone on an empty board, but what is when the board is filled with enemy stones ?
This is a copy of the living page "Manhattan distance" at Sensei's Library. ![]() |