The powerful local response heuristic can be seen as a kind of global anti-permutation heuristic. But the problem also exists on a local level, most prominently when it comes to filling liberties. Moves that are in a critical area, are close to each other, and/or border on the same enemy chain, and have close to equal success rates are candidates for (arbitrary) move ordering. The numerical requirements to make it work without harming regular search are probably quite tricky. But reducing permutations in semeais is surely a desirable goal.
Stefan _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
