Re: computer-go: using move order information.

[Don Wagner <Opengo@xxxxxxxxxxxxxxx>]

In fact the original Wally program does keep track of the last move the
opponent made, and will weigh heavier any response in that area.

This is really not a very good metric, especially in the beginning of
the game, when the object is to enclose as much potential territory as
possible.  You do not want to play close to your opponents stones if you
can avoid it.  If you look at a professional game, typically there will
be 4 or 5 moves in the same region, then as the moves in that region
effect less territory, then the play will continue on another part of
the board.


"T.R. Christie" wrote:

> my first mailing to the list.
> Interested to see what you think...
>
> As I understand it, most Go programs do not use
> any information about the order in which the stones
> on the board have been played, to make their move decision.
> To an extent this is understandable, because the best move
> in a given position will clearly be the same regardless of
> the order in which the stones were played.
>
> However, it is also true that the best move is more likely to
> be in the vicinity of recently played stones than not.
> Also there are situations where move order seems to be
> useful in determining what to do.
> For example in this simple edge play black(x) should
> only play 1 if unconditionally prepared to follow white 2
> with black 3 (Assume x and o are unconditionally alive):
>
> xxxoooo
> ..312..
> -------
>
> but if we have reached, by some other sequence
>
> xxxoooo
> ...xo..
> -------
>
> black may well want to play somewhere else on the board,
> and not connect.  This seems to imply that move order information
> can be useful....(To provide some kind of continuity of logic?)
>
> So, can move order information be useful for computers
> playing Go, and if so, to what extent?