[computer-go] What is All-as-first-heuristic?

[Chrilly]

>
> I had a version that actually matched the 3x3 patterns around the point
> in question, and did the stats on the PATTERNS, not the moves
> themselves.    In this way you get a lot more context.   So if the move
> in question is e5 and it's played later in the game,  the pattern around
> it must be an exact match or it's not considered the same move.
>
One can do the same in chess in the history heuristic. The simplest chase is 
from-to-square History heuristic. More context is Piece-From-To-Square. The 
next level would be a countermove-statistic. Previous-Move, Current Move. I 
had in chess no good results, because the sampling rate gets too low. There 
are too many combinations of from-to-square. The best was Piece-Square Info.
But maybe the idea works for Go?? There are less possible combinations.

Note: The Hydra-Hardware has an even more simpler History-Heuristic. Only 
the To-Square is considered. The reason is, that the move is generated in 
Hardware in 2 passes. Select first the To-Square. Once the best tosquare is 
found, the from squares are generated (by going back with a Super-Piece from 
the To-Square). As the porpose of the History-Heuristic is too order only 
non-capturing moves this works not much worse than the full 
History-Heuristic.

Chrilly