Despite the challenges using it in a tree, and the contentious issue of
whether light playouts can make a really strong program, I think this is
interesting research. By 1.6 times quicker than libego, do you mean as
it runs on the CPU? Or is this a simulated speed as if it was running on
the GPU? I think libego was the clear leader in light playout speed, so
working out a way to do playouts even faster (if that is what you have
done) is amazing.
I just emulated data structures and algorithms that are targeting GPU
in C++ for a CPU. 128-bit CPU's SIMD instruction set simply emulates 4
GPU-like threads working on 32-bit registers. After several attempts
made to test various ideas, the first complete implementation had
performances similar to libego, without a simple CPU specific
optimization. I then put back some specific CPU optimizations (not
likely to be effective on GPU) + tuning and easily improved the
performances. This is really how it runs on the CPU. The same data
structure and algorithm is likely to have an even better ratio against
libego with an AVX enabled processor.
Light playout was a beginning to start with. The random move generator
has been designed to take into account a probability distribution (with
a little slowdown) that can be derived from local pattern matching.
Regards,
Antoine
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
