Here's a suggestion to extend RAVE to better handle it: There are 20 points within keima distance of any point not close to the edge.(5*5 without the corners) When RAVE values are backed up, they are put into the category defined by the previous opponents move. (21 categories, 20 + other. All added up yield the normal RAVE value)
One more thought. I think the proximity heuristic should actually make this more effective, not less. Because many moves are close to the last one, the uninformative "other" category gets less hits. And an ordering of the close points in order of previous effectiveness should help guide the search more effectively.
Stefan _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
