MCTS, even though it walks to the end of the earth, has it's own horizon
effect.
The name is more fitting for depth-limited alpha-beta search ofcourse.
It's a kind of procrastination. Finding a lot of useless things to do before
admitting
an undesirable, but unavoidable consequence.
Even if a fight is important, there will usually exist interposable ko
threat type moves.
These will trigger am entirely new search on the same subject.
And if there are n ko threats, there will be n! ways of trying them out.
Also, these n! attempts can be interposed every 2 half moves by the side
that is losing the fight.
In some esoteric way, standard RAVE probably ameliorates this problem, or it
wouldn't work as well as it does.
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
This could be combined with a hash table for high level nodes to catch
transpositions.
Stefan
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
