[Computer-go] Computing CFG distance in practice

[Steve Kroon]

Hi Jacques.

On Mon, 24 Jan 2011, Jacques Basaldúa wrote:
> Manhattan distance:
>   d = max(dx, dy)

This is not the usual Manhattan/taxicab (l_1) distance, but rather the l_0 distance.
The traditional Manhattan distance would be dx+dy.

Regards,
-- 
Steve Kroon | Computer Science Division, Stellenbosch University
(084) 458 8062 (Cell) | (086) 655 4386 (Fax) | kroonrs (Skype)
http://www.cs.sun.ac.za/~kroon | kroon at sun.ac.za