[Welcome to Sensei's Library!]

StartingPoints
ReferenceSection
About


Paths
ElementaryMoves1

Referenced by
BoardGeography
DeadweightValueOf...
AdjustedLengthAna...

Homepages
MAsterdam

 

Manhattan distance
   

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.

[Diagram]
Manhattan path

For example, the diagram shows the path from B1 to B3. A Manhattan resident has to make 4 steps to get from one stone to another.

An additional requirement can be set demanding that the opponent's stone were never touched along the path.

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 [ext] Taxicab Geometry by Eugene Krause.



This is a copy of the living page "Manhattan distance" at Sensei's Library.
(OC) 2003 the Authors, published under the OpenContent License V1.0.