Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Go programming

Author: Tord Romstad

Date: 08:01:41 02/13/04

Go up one level in this thread


On February 13, 2004 at 09:13:44, Uri Blass wrote:

>On February 13, 2004 at 08:34:41, Tord Romstad wrote:
>
>>Actually, this could be said about Go as well.  The difference is that in
>>Go, tactics rarely decide the game if the difference in strength between
>>the two players is big.  In games between players of similar strength,
>>Go can be tactically extremely complicated (even more so than chess, I
>>would say).
>>
>>Tord
>
>What is the definition of tactics?
>You can say that everything is tactics if you search deep enough.

You are right, if you search deeply enough, everything is tactics.  I
define tactics as what is concrete and shallow enough that it is
possible *in practice* to understand everything well by concrete
brute-force calculations.  This is, of course, only a relative
definition.

Go games between strong players of similar strengths are often decided
by very long, complicated forced lines where both players repeatedly
have to make deep and precise calculations in order to find the right
moves.  This is what I meant when I claimed that Go games can be very
tactically complicated.

Tord



This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.