How does RNG work in 3/5/10 play?

[shadowman]

The best I ever did on a 5-play was hold 3 queens and hit the 4th one on 4 of the 5 lines. This was quarter SDB so each line was worth $150. However, I suspect your hit had an even lower probability since you also needed a kicker and hit on all 3 lines.

[cddenver]

The best I ever did on a 5-play was hold 3 queens and hit the 4th one on 4 of the 5 lines. This was quarter SDB so each line was worth $150. However, I suspect your hit had an even lower probability since you also needed a kicker and hit on all 3 lines.


 
Here's one for y'all.  Many years ago I held an Ace on 3-play, and drew 3 Aces on one line, and 4 3's on another line. 
 
I've told this one before, but I'll tell it again.  I was playing 3-play and heard the machine next to me start counting up credits.  I glanced over, and saw quad 2's on every line - I congratulated the guy and started playing again.  Then he nudged me, and told me to take a closer look - he'd been dealt a pair of 2's, and picked up the others on every line.  I wouldn't have believed it if I hadn't seen it with my own eyes. 

[hilljerry2269]

Don't know if this helps or just confuses. If anyone is interested I can post the code for the RNG I downloaded.
 
 
Hi Shadow Thanks for the offer.
I would like to get it.
Jerry

[shadowman]

Hi Shadow Thanks for the offer.
I would like to get it.
Jerry


/*
   A C-program for MT19937, with initialization improved 2002/2/10.
   Coded by Takuji Nishimura and Makoto Matsumoto.
   This is a faster version by taking Shawn Cokus's optimization,
   Matthe Bellew's simplification, Isaku Wada's real version.
   Before using, initialize the state by using init_genrand(seed)
   or init_by_array(init_key, key_length).
   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
   All rights reserved.                         
   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions
   are met:
     1. Redistributions of source code must retain the above copyright
        notice, this list of conditions and the following disclaimer.
     2. Redistributions in binary form must reproduce the above copyright
        notice, this list of conditions and the following disclaimer in the
        documentation and/or other materials provided with the distribution.
     3. The names of its contributors may not be used to endorse or promote
        products derived from this software without specific prior written
        permission.
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

   Any feedback is very welcome.
   http://www.math.sci.hiroshima-u.ac.jp/~ ... T/emt.html
   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
#include <stdio.h>
/* Period parameters */ 
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
#define UMASK 0x80000000UL /* most significant w-r bits */
#define LMASK 0x7fffffffUL /* least significant r bits */
#define MIXBITS(u,v) ( ((u) & UMASK) | ((v) & LMASK) )
#define TWIST(u,v) ((MIXBITS(u,v) >> 1) ^ ((v)&1UL ? MATRIX_A : 0UL))
static unsigned long state[N]; /* the array for the state vector  */
static int left = 1;
static int initf = 0;
static unsigned long *next;
/* initializes state[N] with a seed */
void init_genrand(unsigned long s)
{
    int j;
    state[0]= s & 0xffffffffUL;
    for (j=1; j<N; j++) {
        state[j] = (1812433253UL * (state[j-1] ^ (state[j-1] >> 30)) + j);
        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
        /* In the previous versions, MSBs of the seed affect   */
        /* only MSBs of the array state[].                        */
        /* 2002/01/09 modified by Makoto Matsumoto             */
        state[j] &= 0xffffffffUL;  /* for >32 bit machines */
    }
    left = 1; initf = 1;
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
void init_by_array(unsigned long init_key[], int key_length)
{
    int i, j, k;
    init_genrand(19650218UL);
    i=1; j=0;
    k = (N>key_length ? N : key_length);
    for (; k; k--) {
        state = (state ^ ((state[i-1] ^ (state[i-1] >> 30)) * 1664525UL))
          + init_key[j] + j; /* non linear */
        state &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
        i++; j++;
        if (i>=N) { state[0] = state[N-1]; i=1; }
        if (j>=key_length) j=0;
    }
    for (k=N-1; k; k--) {
        state = (state ^ ((state[i-1] ^ (state[i-1] >> 30)) * 1566083941UL))
          - i; /* non linear */
        state &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
        i++;
        if (i>=N) { state[0] = state[N-1]; i=1; }
    }
    state[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
    left = 1; initf = 1;
}
static void next_state(void)
{
    unsigned long *p=state;
    int j;
    /* if init_genrand() has not been called, */
    /* a default initial seed is used         */
    if (initf==0) init_genrand(5489UL);
    left = N;
    next = state;
   
    for (j=N-M+1; --j; p++)
        *p = p[M] ^ TWIST(p[0], p[1]);
    for (j=M; --j; p++)
        *p = p[M-N] ^ TWIST(p[0], p[1]);
    *p = p[M-N] ^ TWIST(p[0], state[0]);
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
    unsigned long y;
    if (--left == 0) next_state();
    y = *next++;
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
    unsigned long y;
    if (--left == 0) next_state();
    y = *next++;
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return (long)(y>>1);
}
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
    unsigned long y;
    if (--left == 0) next_state();
    y = *next++;
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return (double)y * (1.0/4294967295.0);
    /* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
    unsigned long y;
    if (--left == 0) next_state();
    y = *next++;
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return (double)y * (1.0/4294967296.0);
    /* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
    unsigned long y;
    if (--left == 0) next_state();
    y = *next++;
    /* Tempering */
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return ((double)y + 0.5) * (1.0/4294967296.0);
    /* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void)
{
    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
    return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
int main(void)
{
    int i;
    unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
    init_by_array(init, length);
    /* This is an example of initializing by an array.       */
    /* You may use init_genrand(seed) with any 32bit integer */
    /* as a seed for a simpler initialization                */
    printf("1000 outputs of genrand_int32()
");
    for (i=0; i<1000; i++) {
      printf("%10lu ", genrand_int32());
      if (i%5==4) printf("
");
    }
    printf("
1000 outputs of genrand_real2()
");
    for (i=0; i<1000; i++) {
      printf("%10.8f ", genrand_real2());
      if (i%5==4) printf("
");
    }
    return 0;
}

 

[faygo]

Whoa, I hope that works for your purpose.  That just fractured my little brain. It sounds , right now, like the little ball rolling around in an aerosol paint can. Must take break.  

[hilljerry2269]

Hi Shadow
Thanks a lot.
Will keep me busy for some time trying to figure out how to run it. I do have some hours to fill anyway.
Jerry

[shadowman]

The last thing in the code is a little routine to run the program and display results. There are several duplicate subroutines that return the answer in a different format. If you pick one and delete the rest it simplifies the amount of code. An RNG in a VP machine would only have one of these.

[spxChrome]

From what IGT said, it works as described.  The deck is stacked from the time you hit deal, put in a coin or whatever stops the shuffle(different machines vary).  They do not mention a continious run after the initial draw.
 
And this is not the same as the older machines.  In the older machines the cards were under the initial deal.
 
So the cards are dealt and your draw cards are under that deal.  So throw away the first card and the card under it shows.  This is not the same as drawing from the top of the deck as you could skip the first 2 cards that already came off the deck.  This is not the way poker works.
 
The way poker works and the way the RNF on IGT machines work now is that the deck is frozen.  They claim to do this because it is more like "real life" poker. 
 
In real life poker you don't get 5 cards throw 3 away and then reshuffle the deck to draw your new 3 new cards?  You get the 3 that are on top of the deck.
 
 edit for spelling

[hilljerry2269]

Hi Shadow
Thanks for the tip.
Jerry

[BOOPSAHOY]

That means it doesnt matter when you hit deal????