acpc_dealer 0.0.1

data/vendor/project_acpc_server/rng.c

@@ -0,0 +1,138 @@
+/* 
+   A C-program for MT19937, with initialization improved 2002/1/26.
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   Before using, initialize the state by using init_genrand(seed)  
+   or init_by_array(init_key, key_length).
+
+   Copyright (C) 2011 by the Computer Poker Research Group, University of 
+   Alberta
+
+   This file is a modification of work by Makoto Matsumoto and Takuji
+   Nishimura.  That work was provided with the following license:
+
+   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/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
+*/
+
+#include "rng.h"
+
+/* NOTE changes made on 2005/9/7 by Neil Burch - if you have problems
+   with this code, DON'T complain to Makoto Matsumoto... */
+
+
+/* initializes mt[N] with a seed */
+void init_genrand( rng_state_t *state, uint32_t s )
+{
+  state->mt[0]= s & 0xffffffffUL;
+  for (state->mti=1; state->mti<N; state->mti++) {
+    state->mt[state->mti] = 
+      (1812433253UL * (state->mt[state->mti-1]
+		       ^ (state->mt[state->mti-1] >> 30))
+       + state->mti); 
+    /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
+    /* In the previous versions, MSBs of the seed affect   */
+    /* only MSBs of the array mt[].                        */
+    /* 2002/01/09 modified by Makoto Matsumoto             */
+  }
+}
+
+/* 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( rng_state_t *state, uint32_t init_key[], int key_length )
+{
+  int i, j, k;
+
+  init_genrand(state, 19650218UL);
+  i=1; j=0;
+  k = (N>key_length ? N : key_length);
+  for (; k; k--) {
+    state->mt[i] = ( state->mt[i]
+		     ^ ( ( state->mt[i-1] ^ ( state->mt[i-1] >> 30 ) )
+			 * 1664525UL ) )
+      + init_key[j] + j; /* non linear */
+    i++; j++;
+    if (i>=N) { state->mt[0] = state->mt[N-1]; i=1; }
+    if (j>=key_length) j=0;
+  }
+  for (k=N-1; k; k--) {
+    state->mt[i] = ( state->mt[i]
+		     ^ ( ( state->mt[i-1] ^ ( state->mt[i-1] >> 30 ) )
+			 * 1566083941UL ) )
+      - i; /* non linear */
+    state->mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+    i++;
+    if (i>=N) { state->mt[0] = state->mt[N-1]; i=1; }
+  }
+
+  state->mt[0]|= 0x80000000UL; /* MSB is 1; assuring non-zero initial array */ 
+}
+
+/* generates a random number on [0,0xffffffff]-interval */
+uint32_t genrand_int32( rng_state_t *state )
+{
+    uint32_t y;
+    static uint32_t mag01[2]={0x0UL, MATRIX_A};
+    /* mag01[x] = x * MATRIX_A  for x=0,1 */
+
+    if (state->mti == N) { /* generate N words at one time */
+        int kk;
+
+        for (kk=0;kk<N-M;kk++) {
+            y = (state->mt[kk]&UPPER_MASK)|(state->mt[kk+1]&LOWER_MASK);
+            state->mt[kk] = state->mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        for (;kk<N-1;kk++) {
+            y = (state->mt[kk]&UPPER_MASK)|(state->mt[kk+1]&LOWER_MASK);
+            state->mt[kk] = state->mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        y = (state->mt[N-1]&UPPER_MASK)|(state->mt[0]&LOWER_MASK);
+        state->mt[N-1] = state->mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+
+        state->mti = 0;
+    }
+  
+    y = state->mt[state->mti++];
+
+    /* Tempering */
+    y ^= (y >> 11);
+    y ^= (y << 7) & 0x9d2c5680UL;
+    y ^= (y << 15) & 0xefc60000UL;
+    y ^= (y >> 18);
+
+    return y;
+}

data/vendor/project_acpc_server/rng.h

@@ -0,0 +1,63 @@
+/*
+   Copyright (C) 2011 by the Computer Poker Research Group, University of 
+   Alberta
+   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.                          
+*/
+
+#ifndef _RNG_H
+#define _RNG_H
+#define __STDC_FORMAT_MACROS
+#include <inttypes.h>
+
+
+/* functions included in Takuji Nishimura and Makoto Matsumoto's RNG code */
+/* NOTE changes made on 2005/9/7 by Neil Burch - if you have problems
+   with this code, DON'T complain to Makoto Matsumoto... */
+
+
+/* Period parameters */  
+#define N 624
+#define M 397
+#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
+#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
+#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
+
+
+typedef struct {
+uint32_t mt[ N ];
+int mti;
+} rng_state_t;
+
+
+/* initializes rng state using an integer seed */
+void init_genrand( rng_state_t *state, uint32_t s );
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+void init_by_array( rng_state_t *state, uint32_t init_key[], int key_length );
+
+
+/* all of the functions below can not be called until init_* has been called */
+
+/* generates a random number on [0,0xffffffff]-interval */
+uint32_t genrand_int32( rng_state_t *state );
+
+/* generates a random number on [0,0xffffffff]-interval */
+#define genrand_int31(state) ((int32_t)(genrand_int32(state)>>1))
+
+/* These real versions are due to Isaku Wada, 2002/01/09 added */
+/* generates a random number on [0,1]-real-interval */
+#define genrand_real1(state) (genrand_int32(state)*(1.0/4294967295.0))
+
+/* generates a random number on [0,1)-real-interval */
+#define genrand_real2(state) (genrand_int32(state)*(1.0/4294967296.0))
+
+/* generates a random number on (0,1)-real-interval */
+#define genrand_real3(state) ((((double)genrand_int32(state))+0.5)*(1.0/4294967296.0))
+
+/* generates a random number on [0,1) with 53-bit resolution*/
+#define genrand_res53(state) (((genrand_int32(state)>>5)*67108864.0+(genrand_int32(state)>>6))*(1.0/9007199254740992.0))
+
+#endif

data/vendor/project_acpc_server/test.log

@@ -0,0 +1,11 @@
+# name/game/hands/seed test holdem.limit.2p.reverse_blinds.game 2 0
+#--t_response 600000
+#--t_hand 600000
+#--t_per_hand 7000
+STATE:0:rc/rrc/crc/rrrc:5d5c|9hQd/8dAs8s/4h/6d:120|-120:p1|p2
+STATE:1:rc/cc/rrc/crc:6sKs|5dJd/2sTh2h/Qh/8h:80|-80:p2|p1
+FINISHED GAME LOOP BEFORE PRINT FINAL MESSAGE
+IN PRINT FINAL MESSAGE
+SCORE:40|-40:p1|p2
+EXITING GAME LOOP
+FLUSHING LOG FILE