[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: using move order information.

Many Faces uses move order information in several places.

To make it more likely that the global search includes the best move,
move candidate scores are boosted for moves that are local responses
to the last move, or local followups to the 2nd to last move.

Much of Many Face's move generation information is in the form
of move sequences.  This makes entering the data easier, but if
a position in the middle of a sequence is reached with a different
move order, Many Faces may not find the response

-David

At 02:59 PM 1/23/2001 +0000, you 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?

David Fotland