>>> My simple idea is to analyze first moves near the last move on board, >>> ... >>> Ofcourse we can extend this idea by gathering not only one last move but >>> few of them and on this basis create priority queue. >> >> Sounds reasonable. But it will still require you to go through far too >> many moves. The more sophisticated way would be to use a pattern >> library, either hand-crafted or automatically harvested. > > Did I understand You correctly and You saying that some moves shouldn't > be analyzed at all?
I intended the meaning of when using alpha-beta you want to consider the better moves first. I.e. move ordering is very important. But, yes, unless you've managed to discover a high accuracy, quick evaluation function, full-width search is doomed. You need to prune aggressively. For the hard part of a 9x9 game (moves 8 to 16) you need to be searching 20-40 ply to reach a quiet position that can be "easily" evaluated. For the hard part of a 19x19 game it is more like 100-200 ply. Darren _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
