sir-deenicus

// Learn more about F# at http://fsharp.net
// See the 'F# Tutorial' project for more help.

open System.IO
open SevenZip
open System

SevenZipCompressor.SetLibraryPath(@"path/to/7z.dll")

let dir = @"files/path/..."

sir-deenicus

Discrete Probability Monad with F# computation Expressions that runs in Fable

Copy and paste each part in turn into http://fable.io/repl/. Probabilistic programming part should start around line 220. Should be compatible with almost everything in http://greenteapress.com/wp/think-bayes/

Also provides text histogram plots!

sir-deenicus

LEARNED STRATEGY

Move | Move Probability
---- | ----------------
R    | 0               
P    | 0.999           
S    | 0               
T    | 0               

LEARNED STRATEGY VS FIXED ADVERSARY

sir-deenicus

open Prelude.Common
open System
open Prelude.Math
open Prelude
open SimpleTrees

type Node = {    
    regretSum :  double [] ; 
    strategySum : double [];
}

sir-deenicus

Attempt at Nash

GUESS STRATEGY

Move | Move Probability
---- | ----------------
0    | 0.501           
1    | 0.251           
2    | 0.125           
3    | 0.063           

sir-deenicus

STRATEGY VS STATIC ADVERSARY

Move     | Move Probability
-------- | ----------------
Rock     | 0               
Paper    | 1               
Scissors | 0               
STRATEGY VS STATIC ADVERSARY

Player 1 | Player 2 | Prob 1 | Prob 2 | Joint Prob | Player 1 Util | Player 2 Util

sir-deenicus

open FSharp.Data
let data = WorldBankData.GetDataContext()

let scoreArr =   [|
    "Household final consumption expenditure per capita (constant 2000 US$)",                          (-7.5, 50000.);
    "Intentional homicides (per 100,000 people)",                                                      (-20., 1000.);
    "Fixed broadband Internet subscribers (per 100 people)",                                           (9.5,  100.);
    "Burden of customs procedure, WEF (1=extremely inefficient to 7=extremely efficient)",             (6.,  7.); 
    "CPIA transparency, accountability, and corruption in the public sector rating (1=low to 6=high)", (6.,  6.);
    "GINI index",                                                                                      (-5., 100.);

sir-deenicus

type HyphTree = 
   | Node of (int [] option) * Map<char,  HyphTree> 
   | Empty 
    
let insertpattern tree pattern =
  let chars = pattern |> Seq.filter (Char.IsNumber >> not) |> Seq.toArray 
  let points = Text.RegularExpressions.Regex.Split(pattern, "[.a-z]") |> Array.map (fun c -> let b, i = Int32.TryParse c in if b then int i else 0)
  let rec bt t = function
        | i when i = chars.Length -> Node(Some points, Map.empty)
        | i ->

sir-deenicus

var injectMathJax = document.createElement('script');
var typeSet = document.createElement('script');
var style=document.createElement('style');

//modified: css https://github.com/christianp/mathjax-bookmarklet/blob/master/bookmarklet.js
style.innerText = '.MathJax .mn {background: inherit;} .MathJax .mi {color: inherit;} .MathJax .mo {background: inherit;}';

injectMathJax.type = 'text/javascript';
injectMathJax.src = 'https://c328740.ssl.cf1.rackcdn.com/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';

sir-deenicus

type Variable = Strings of float | Number of float * float * float  

type Probability = Map<string , Map<string,Variable> * float>

let inline pairAdd (a,b) (c,d) = a + c , b + d

let inline div (a,b) = if b = 0. then a else a / b

let strOfVar = function Strings(n) -> n | _ -> 0.