Re: computer-go: A problem with understanding lookahead

["Mark Boon" <tesuji@xxxxxxxxx>]

----- Original Message -----
From: Vincent Diepeveen <diep@xxxxxxxxxxxxxxxxx>
To: <computer-go@xxxxxxxxxxxxxxxxx>
Sent: Friday, January 19, 2001 1:24 AM
Subject: Re: computer-go: A problem with understanding lookahead


> At 11:18 PM 1/18/01 +0100, you wrote:
> >
> >----- Original Message -----
> >From: Don Dailey <drd@xxxxxxxxxxxxxxxxx>
> >To: <computer-go@xxxxxxxxxxxxxxxxx>
> >Sent: Thursday, January 18, 2001 10:02 PM
> >Subject: Re: computer-go: A problem with understanding lookahead
> >
> >
> >>
> >> You obviously are not familiar  with the computer chess world, because
> >> "counting  material" is a  horrible evaluation  function and  does not
> >> lead to "sophisticated positional judgement" in modern programs
> >
> >The qualification of 'horrible' is rather relative of course. There's no
Go
> >program that has an evaluation that comes even close to the precision of
> >counting material in Chess, and I don't think there will be for quite
some
> >time.
>
> I think this is not true Mark, of course you need to burn
> more system time for evaluation as the board is bigger,
> but i think the only difference is the branching factor.
>

Well, we disagree on this point then. I think relatively speaking currently
all go programs make evaluation errors on a regular basis that misjudge the
position by a chess-piece or worse. I don't think this discrepancy is
covered by the deeper search simple-minded chess-programs do.

    Mark