[Computer-go] fast + good RNG

[remco.bloemen at singularityu.org]

I switched to SFMT [0].  But that was some years ago, there might be faster options now.

I also generated it in megabyte batches and consume it from there, generating a new megabyte as needed.

Lastly, I had some code to make sure I did not consume more bits of entropy than required.  Two uniform choices,  one bit.  Three choices: fractional bits.

[0]

http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/

— Remco 

-----Original Message-----
From: folkert <folkert at vanheusden.com>
To: computer-go at computer-go.org
Sent: Sun, 29 Mar 2015 17:50
Subject: [Computer-go] fast + good RNG

Hi,

I measured that std::mt19937_64 (the mersenne twister from the standard
c++ libraries) uses about 40% cpu time during playouts.

So I wonder: is there a faster prng while still generating good enough
random?


Folkert van Heusden

-- 
Nagios user? Check out CoffeeSaint - the versatile Nagios status
viewer! http://www.vanheusden.com/java/CoffeeSaint/
----------------------------------------------------------------------
Phone: +31-6-41278122, PGP-key: 1F28D8AE, www.vanheusden.com
_______________________________________________
Computer-go mailing list
Computer-go at computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20150329/5c3cadca/attachment.html>