Source benchmarks/exact/asym-random-walk_variant.det
(* From GuBPI Zaiser et al. -- MODIFIEDRemoved soft conditioning and discretized the uniform(0,1) <= 0.5# depth 60# discretization -2 2 0.25# epsilonScore 0.02# outputSplitProgress 0# outputCurrentPath 1# outputCurrentArea 1# A asymmetric random walk starting at 0. # In every step a uniform amount is traveled either to the left or right. Every third step is to the right and the remaining steps to the leftletrec f x =     if (sample uniform(0,1) <= 0.5) then         sample uniform(-1, 1)     else         if (x >= 2) then             sample uniform(-1, 0) + f(0)        else             sample uniform(0, 1) + f(x+1)in let t = f 0 inscore(pdfnormal(0.0, 1, t));tPartially determinizable but finite state (via a reward Markov chain).*)let f = rec f x =>  if flip(0.5) then    uniform(-1, 1)  else if 2 <= x then    uniform(-1, 0) + f 0  else    uniform(0, 1) + f (x + 1)inf 0