Re: computer-go: using move order information.

[Don Dailey <drd@xxxxxxxxxxxxxxxxxxxxx>]

> 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


This is a good example of using this  information effectively.  I have
considered trying something  like it in Chess.   One thing about chess
is that  a  sequence of  moves may  be correct in  many positions that
would be the same if it were not  for insignificant little differences
(whether your pawn is on a2 or a3 may not matter.)    

I haven't found  a useful way  to exploit this, but I  feel that it is
"free" information just waiting to be exploited.

Don