/*
  cap19_MarkovChain2.c: Evolution on a simple Markov chain.
  Copyright (C) 2006 Federico Ricci-Tersenghi (Federico.Ricci@roma1.infn.it)

  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License
  as published by the Free Software Foundation; either version 2
  of the License, or (at your option) any later version.

  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with this program; if not, write to the Free Software
  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.

  This program has been extracted from "Programmazione Scientifica",
  Pearson Education ed. (2006), by Barone, Marinari, Organtini and
  Ricci-Tersenghi. ISBN 8871922425.
*/

/* by FRT */
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define FNORM   (2.3283064365e-10)
#define RANDOM  ((ira[ip++] = ira[ip1++] + ira[ip2++]) ^ ira[ip3++])
#define FRANDOM (FNORM * RANDOM)
#define pm1 ((FRANDOM > 0.5) ? 1 : -1)
#define N 6

/* variabili globali per il generatore random */
unsigned myrand, ira[256];
unsigned char ip, ip1, ip2, ip3;

unsigned randForInit(void);
void initRandom(void);
float gaussRan(void);
void error(char *);
int oneStep(int);

int main(int argc, char *argv[]) {
  int i, t, pos, measTime, niter, cont, p[N];
  float pi[N] = {0, 0.3, 0, 0.1, 0.15, 0.45};

  if (argc != 3) {
    fprintf(stderr, "usage: %s <niter> <seed> \n", argv[0]);
    exit(1);
  }
  
  niter = (unsigned)atoi(argv[1]);
  myrand = (unsigned)atoi(argv[2]);

  if (myrand == 2147483647)
    error("seed must be less than 2147483647");

  initRandom();

  printf("# Posizione iniziale?\n");
  scanf("%i", &pos);
  for (i = 0; i < N; i++)
    p[i] = 0;
  cont = 0;
  measTime = 2;
  for (t = 1; t <= niter; t++) {
    pos = oneStep(pos);
    p[pos]++; cont++;
    if (t == measTime) {
      printf("%i", t);
      for (i = 0; i < N; i++) {
	printf(" %f", (float)p[i]/cont);
	p[i] = 0;
      }
      printf("\n");
      cont = 0;
      measTime *= 2;
    }
  }
  return 0;
}

int oneStep(int pos) {
  float ran = FRANDOM;

  if (pos == 0) {
    return 2;
  } else if (pos == 1) {
    if (ran < 0.6)
      return 1;
    else if (ran < 0.933333)
      return 3;
    else
      return 5;
  } else if (pos == 2) {
    if (ran < 0.888889)
      return 0;
    else
      return 3;
  } else if (pos == 3) {
    return 5;
  } else if (pos == 4) {
    if (ran < 0.8)
      return 1;
    else
      return 5;
  } else {
    if (ran < 0.666667)
      return 5;
    else
      return 4;
  }
}

unsigned randForInit(void) {
  unsigned long long y;
  
  y = myrand * 16807LL;
  myrand = (y & 0x7fffffff) + (y >> 31);
  if (myrand & 0x80000000) {
    myrand = (myrand & 0x7fffffff) + 1;
  }
  return myrand;
}

void initRandom(void) {
  int i;
  
  ip = 128;    
  ip1 = ip - 24;    
  ip2 = ip - 55;    
  ip3 = ip - 61;
  
  for (i = ip3; i < ip; i++) {
    ira[i] = randForInit();
  }
}

float gaussRan(void) {
  static int iset = 0;
  static float gset;
  float fac, rsq, v1, v2;

  if (iset == 0) {
    do {
      v1 = 2.0 * FRANDOM - 1.0;
      v2 = 2.0 * FRANDOM - 1.0;
      rsq = v1 * v1 + v2 * v2;
    } while (rsq >= 1.0 || rsq == 0.0);
    fac = sqrt(-2.0 * log(rsq) / rsq);
    gset = v1 * fac;
    iset = 1;
    return v2 * fac;
  } else {
    iset = 0;
    return gset;
  }
}

void error(char *string) {
  fprintf(stderr, "ERROR: %s\n", string);
  exit(EXIT_FAILURE);
}