|
> In chess interesting mate-combinations have often a
hierarchical inversion.
Dear Chrilly,
Thank you for your comments. Interesting question
whether lambda-search (or other threat-based algorithms) could be used for
mate-search in chess. But if you want to use the relevancy zones too,
you may need to re-think the concept because the chess-pieces move. Such
zones are easier in games like Go, Hex and Go-moku.
I've also been wondering whether lambda-search
could somehow be adapted for general search trees
(uniform, real-valued), since null-move pruning works so well for the
general (non-tactical) chess search tree, and since null-move pruning and
lambda-search have a lot in common. But at the moment this question is
not so relevant for Go, since Go programs don't do "whole board lookahead"
very extensively due to costly evaluation functions.
Best regards,
-Thomas
|
_______________________________________________ computer-go mailing list computer-go@xxxxxxxxxxxxxxxxx http://www.computer-go.org/mailman/listinfo/computer-go/