Stefan Kaitschick wrote: >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) >This amounts to accumulating a killer heuristic for local points. >It can used in 2 ways: >1. prefer the best local response >2. if there is a good local response for the opponent, penalize a candidate >move
I don't understand what it is useful for. I think that the near points from the previous move are already preferred by proximity heuristics. Could you give us an example? -- Yamato _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
