Differences

This shows you the differences between two versions of the page.

--- chess:programming:prng_pseudo_random_number_generator [2021/10/31 19:26] – peter
+++ chess:programming:prng_pseudo_random_number_generator [2021/10/31 20:28] (current) – peter
@@ Line 12: / Line 12: @@
 Widely used PRNG algorithms include: Lagged Fibonacci generators, linear feedback shift registers, Blum Blum Shub.
-----
-===== How PRNG works? =====
-**Linear Congruential Generator** is most common and oldest algorithm for generating pseudo-randomized numbers.
-The generator is defined by the recurrence relation:
-<code>
-Xn+1 = (aXn + c) mod c
-</code>
-**NOTE:**  where
-  * **X** is the sequence of pseudo-random values.
-  * **m**, 0< m- modulus.
-  * **a**, 0< a <m- multiplier.
-  * **c**, 0< = c<m- increment.
-  * **x0**, 0<=x0<m- the seed or start value.
-The next random integer is generated using the previous random integer, the integer constants, and the integer modulus.
-  * To get started, the algorithm requires an initial Seed, which must be provided by some means.
-  * The appearance of randomness is provided by performing modulo arithmetic.
 ----
@@ Line 74: / Line 49: @@
 https://en.wikipedia.org/wiki/Linear_congruential_generator
+https://www.pcg-random.org/index.html