Skip to main content

World Cup 2010 Monte-Carlo Simulator (2)

Here is the source code of wc2010.rb.

#! /usr/bin/ruby
#
# World Cup 2010 point simulator
# Copyright (C) 2010 Yamauchi Hitoshi
# License: new BSD.
#------------------------------------------------------------

require "getoptlong.rb"

WC2010      = "0.0.0"
MAX_MATCHES = 64

#------------------------------------------------------------
# class Wc2010
#------------------------------------------------------------
class Wc2010
  # constructor
  def initialize()
    # last year's result as probability distribution function
    @sample = [
               4, 2,    0, 2,    1, 0,    0, 0,    2, 1,
               0, 1,    3, 1,    0, 1,    3, 1,    0, 3,
               2, 0,    2, 1,    0, 0,    1, 0,    4, 0,
               2, 2,    1, 0,    3, 0,    2, 0,    1, 0,
               6, 0,    2, 1,    0, 0,    2, 0,    0, 2,
               1, 1,    0, 0,    2, 0,    1, 1,    0, 2,
               0, 4,    3, 1,    0, 3,    1, 2,    2, 0,
               2, 2,    2, 1,    1, 1,    0, 0,    3, 2,
               0, 2,    2, 1,    1, 4,    2, 2,    0, 1,
               1, 0,    0, 2,    2, 0,    2, 0,    2, 1,
               1, 0,    1, 0,    1, 0,    0, 0,    3, 0,
               1, 3,    1, 1,    3, 0,    0, 0,    0, 1,
               0, 2,    0, 1,    3, 1,    1, 1]

    @max_point = @sample.max {
      |a,b|
      a <=> b
    }
    # sample bin. Array [0, 0, ..., 0], size == @max_point + 1
    @sample_bin = Array.new(@max_point + 1, 0)
    @accum_dist = Array.new(@max_point + 1, 0)

    # put them to the bin
    for val in @sample
      @sample_bin[val] = @sample_bin[val] + 1
    end

    @accum_max = 0
    idx   = 0
    for hist in @sample_bin
      @accum_max = @accum_max + hist
      @accum_dist[idx] = @accum_max
      idx   = idx + 1
    end

    idx   = 0
    for val in @accum_dist
      idx   = idx + 1
    end

    @range_array = []
    @range_array << Range.new(0, @accum_dist[0], true)

    # create range objects
    idx = 0
    while idx < (@accum_dist.length - 1)
      @range_array << Range.new(@accum_dist[idx], @accum_dist[idx + 1], true)
      idx = idx + 1
    end

    idx = 0
    for r in @range_array
      idx = idx + 1
    end
  end

  # get random value -> point with the same distribution of last year
  # \param  _rd uniform random value
  # \return generated random variable
  def get_point(_rd)
    begin
      idx = 0
      for r in @range_array
        if r.include? _rd then
          return idx
        end
        idx = idx + 1
      end

      raise RuntimeError.new(_rd.to_s + " is not in any range.\n")
    end
  end

  # run the simulation
  def run()
    begin
      srand(42)                  # always the same for debug.
      idx = 0
      while idx < MAX_MATCHES do
        rd1 = rand(@accum_max)
        rd2 = rand(@accum_max)
        pt1 = get_point(rd1)
        pt2 = get_point(rd2)
        print "[" + (idx + 1).to_s + "]: " + pt1.to_s + ' ' + pt2.to_s + "\n"
        idx = idx + 1
      end
    end
  end
end

#------------------------------
# command line option parsing
#------------------------------
args = GetoptLong.new();
args.set_options(['--version',   '-V', GetoptLong::NO_ARGUMENT]);

begin
  args.each_option do |name, arg|
    # print(name + ", " + arg + ":\n")
    eval "$OPT_#{name.sub(/^--/, '').gsub(/-/, '_').upcase} = '#{arg}'"
  end
rescue
  exit(1)
end

#--- show version
if $OPT_VERSION
  $stderr.print(WC2010 + "\n")
  exit(1)
end

wc = Wc2010.new()
wc.run()

# --- end of wc2010.rb

Comments

Popular posts from this blog

Geometric Multiplicity: eignvectors (2)

If eigenvectors of a matrix A are independent, it is a happy property. Because the matrix A can be diagonalized with a matrix S that column vectors are eigenvectors of A . For example, Why this is a happy property of A? Because I can find A's power easily. A^{10} is not a big deal. Because Λ is a diagonal matrix and power of a diagonal matrix is quite simple. A^{10} = SΛ^{10} S^{-1} Then, why if I want to compute power of A ? That is the same reason to find eigenvectors. Eigenvectors are a basis of a matrix. A matrix can be represented by a single scalar. I repeat this again. This is the happy point, a matrix becomes a scalar. What can be simpler than a scalar value. But, this is only possible when the matrix S's columns are independent. Because S^{-1} must be exist. Now I come back to my first question. Is the λ's multiplicity related with the number of eigenvectors? This time I found this has the name. Geometric multiplicity (GM): the number of in...

Gauss's quote for positive, negative, and imaginary number

Recently I watched the following great videos about imaginary numbers by Welch Labs. https://youtu.be/T647CGsuOVU?list=PLiaHhY2iBX9g6KIvZ_703G3KJXapKkNaF I like this article about naming of math by Kalid Azad. https://betterexplained.com/articles/learning-tip-idea-name/ Both articles mentioned about Gauss, who suggested to use other names of positive, negative, and imaginary numbers. Gauss wrote these names are wrong and that is one of the reason people didn't get why negative times negative is positive, or, pure positive imaginary times pure positive imaginary is negative real number. I made a few videos about explaining why -1 * -1 = +1, too. Explanation: why -1 * -1 = +1 by pattern https://youtu.be/uD7JRdAzKP8 Explanation: why -1 * -1 = +1 by climbing a mountain https://youtu.be/uD7JRdAzKP8 But actually Gauss's insight is much powerful. The original is in the Gauß, Werke, Bd. 2, S. 178 . Hätte man +1, -1, √-1) nicht positiv, negative, imaginäre (oder gar um...

Tezuka Osamu's Black Jack, "Shrinking"

I like several novel authors. My first favorite author is probably Teduka, Osamu. I still love him. The list grows by adding Hoshi, Shinichi, Agatha Christie, Hermann Hesse, and so forth. My first favorite article of Tezuka was Atom as most of the (boy's) Tezuka fans did. But my favorite is Black Jack. I try to summarize one story, it is still quite vivid in my memory. I first read this story when I was 13 - 15 years old. I re-read it at least several times since Black Jack is composed of many short episodes. The title should be "ちぢむ (SHRINKING)" or it might be "縮む(Shrinking)". (It is not so convenient to translate this to English, since English does not have a system to say the exact same word in several ways. So I just simulate it with capital letters.) Black Jack is a genius surgeon, but he does not have the license. In short, his medical activity is illegal. His skill is top level in the world, but, the fee is also out-of-law expensive. In the story ...