> is dynamic komi not also usefull for
>
> - early pass, (only play if a move is better than a pass)
Maybe, as you can define "better move" by "there is a dynkomi x where
one loses while the other wins". But you'd need O(log(x_max)) runs to
find it out.
> - preventing horizon effect. (pushing los
I tried both llvm-gcc and CLANG. I did not have any trouble getting them
to work for my 64 bit chess program.
I didn't try too hard, but neither is producing executables as fast as
gcc. llvm-gcc is the slowest about 20% slower than gcc and clang is only a
little slower than gcc.
Since I deve
I've just been reading the paper
/Parameter Tuning by the Cross-Entropy Method/
from Guillaume Chaslot et al.
Unless I'm missing it, the paper doesn't say what step size (their
'alpha') they used in the experiments with Mango.
Has anyone here tried this technique? What step size did you use?
-M-
