[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: computer-go: extracting date to beat 9d from chess and draughts scene
>> Maybe current
>>chess programs and current go programs are equally strong but we just don't
>>realize it ;-).
>
>no way, the average go player can beat all programs, only masters can beat
>chess programs.
Both of the above statements are false.
It is possible for a non-master to play towards the computer's weaknesses
and win.
This usually involves developing attacks slowly and massing behind closed
lines, stopping tactics, and recognizing possibly better chances in the
endgame.
Chess programs have heuristics to avoid such scenarios but often have
difficulty with the timing of those heuristics, i.e. what it takes
in the position to actually trigger the heuristic's contribution to
the positional part of the evaluation score.
The kind of play I am advocating in this regards is the play demonstrated by
Emmanuel Lasker, wherein the position is played, but the opponent's personal
foibles are also especially examined.
For example, I drew a game with Deep Thought and am certainly no master.
I simply avoided all local skirmishes, stopped the tactics, and played
for a draw instead of a win.
--Stuart