David, I just remembered that the scalability test was done without
any opening book!
This could be the reason of their different scalablities.
-Hideki
David Fotland: <[EMAIL PROTECTED]>:
>The scalability study showed that mogo gains almost 100 rating points per
>doubling of performance.
>
>But
> In addition, xor_shift is better than builtin rand() and faster and
> much smaller than MT.
I don't know that much about random numbers, so excuse my ignorance. But a
bit of googling got me to the Park - Miller Minimal Standard random number
generator
http://www.firstpr.com.au/dsp/rand31/p
If you are looking for a cheap fast and simple random number generator,
A post by George Marsaglia, an expert/guru on random number generation
has several and a C implemention.
These are one line generators, coded as macros.He also discusses
the period and quality of each of them.
Thi
For a long time I have pondered whether you could build a very high
quality random number generator that was extremely fast using the
pentium RDTSC instruction as a low order bit entropy source. The
idea would be to use an extremely fast (but low quality) pseudo random
number generator, bu
Heikki Levanto wrote:
In addition, xor_shift is better than builtin rand() and faster and
much smaller than MT.
I don't know that much about random numbers, so excuse my ignorance. But a
bit of googling got me to the Park - Miller Minimal Standard random number
generator
http://www
I also am not an expert of pseudo random number generator, Heikki.
It's very hard to estimate the effect of the quality of PRNG in MC
simulations. The only way is to compare their performance using your
program, I believe.
I know that the generating speed of SFMT, about one nano second each
o
the only thing to watch is that you'll likely need
30+ bits from these guys to seed a prng, and
getting those bits in any organized way is likely
going to happen on a regular schedule (i.e. if
you get them in a loop, you're likely going to
space them out in an organized way).
s.
On 5/15/08, Don
IIRC the RDTSC instruction is very slow, on the order of 50 cycles. In
addition, I like having deterministic generators so that
hypothetically I could reproduce any result.
In my chess program I use a modified version of Agner Fog's Ranrot.
It's very fast and very random. There's a paper on his si
Hi I am just wondering if Aya bot has a handicap stone playout scoring
bug, in which it does not take account for handicap stones the same way
as kgs. I just played against it on kgs (peterchris vs AyaBot4) and
about 80% into this game I made a huge error that should have cost me
the game, but
Peter, I've checked the game record and felt nothing unnatural as
a classical weaker bot.
#I've played against AyaBot series (AyaBot, AyaBot2...4) 59 games
in total on KGS.
Please note that AyaBot (not AyaMC) is not an MC bot but a classical
one. Its moves are generated by patterns and selecte
I don't think Don was saying to use many calls to RDTSC to generate a single
random number.
I think he meant do something like (FastBadRand() XOR RDTSC).
The first part has low quality low-order bits and the second part has low
quality high-order bits.
Also, I can't imagine why executing a RDTS
Following url may help.
http://softwarecommunity.intel.com/isn/Community/en-US/forums/thread/30235396.aspx
-Hideki
Michael Williams: <[EMAIL PROTECTED]>:
>I don't think Don was saying to use many calls to RDTSC to generate a single
>random number.
>I think he meant do something like (FastBadRand
12 matches
Mail list logo
