[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: computer-go: A problem with understanding lookahead
What i forgot to mention in my previous post and
definitely need to mention here is that in chess
there are things called openings books.
In go it's much harder to make an openings book as we
all very well realize.
A chessprogram without an openingsbook would never beat
a professional chessplayer as they are directly killed
strategically.
This is an additional problem for go programs to overcome
when compared to chessprograms.
At 05:39 PM 1/18/01 -0500, you wrote:
>If you are saying that search is useful when you have a sufficiently good
>evaluation function, and when the structure of the game you're playing is
>well-behaved, then we have no disagreement.
>
>My only point was that it's interesting that in computer chess, search using
>an evaluation much cruder than expert human positional judgement leads a
>program to better positions not just by its crude evaluation function, but
>also by the more sophisticated judgement of the human.
>
>-David
>
>
>
>