Created
October 9, 2015 21:39
-
-
Save vznvzn/e0a3257209fa2355021c to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/ruby1.8 | |
def f1(n) | |
n = (n * 3 + 1) / 2 while (n % 2 == 1) | |
n /= 2 while (n % 2 == 0) | |
return n | |
end | |
def f2(n) | |
l = [] | |
loop \ | |
{ | |
l << [n, n.to_s(2).length] | |
break if (n == 1) | |
n = f1(n) | |
} | |
return l | |
end | |
def dense(n) | |
s = n.to_s(2) | |
c = 0 | |
s.length.times \ | |
{ | |
|i| | |
c += s[i, 1].to_i | |
} | |
return c.to_f / s.length | |
end | |
def widthdiff(x, y) | |
x.to_s(2).length - y.to_s(2).length | |
end | |
def widthratio(x, y) | |
x.to_s(2).length.to_f / y.to_s(2).length | |
end | |
def f(n, w) | |
n1 = n | |
c = 0 | |
l = [n] | |
cg = nil | |
while (n != 1) | |
n = f1(n) | |
l << n | |
c += 1 | |
cg = c if (cg.nil? && n < n1) | |
break if (!cg.nil? && w != 'c') | |
end | |
cm = (0...l.size).max_by { |x| l[x] } | |
return {'cm' => cm, | |
'cg' => cg.nil? ? 0 : cg, | |
'm' => l[cm].to_s(2).length, | |
'w' => widthdiff(l[cm], n1), | |
'r' => widthratio(l[cm], n1), | |
'c' => l.size, | |
'd' => (0.5 - dense(n1)).abs} | |
end | |
def long(m, w) | |
if (w == 'z') then | |
return {'n' => rand(2**m) | 1 } | |
end | |
l = [{'n' => 1, 'p' => 0}.merge(f(1, w))] | |
t = 0 | |
e = 2000 | |
loop \ | |
{ | |
l = l.sort_by { |x| [x[w], -x['d']] }.reverse | |
x = l.delete_at(rand([l.size, 20].min)) | |
p2 = x['p'] + 1 | |
n2 = x['n'] + 2 ** p2 | |
x1 = x.dup | |
x1['p'] = p2 | |
l << x1 | |
x2 = {'n' => n2, 'p' => p2}.merge(f(n2, w)) | |
l << x2 | |
t += 1 | |
w2 = w | |
if (w == 'r') then | |
z = l.sort_by { |x| x['n'] }.reverse[0...100].max_by { |x| x['r'] } | |
w2 = 's' | |
else | |
z = l.max_by { |x| x[w] } | |
end | |
z.merge!({ 't' => t, 's' => t.to_f / e }) | |
return z if (z[w2] >= m) | |
return if (t >= e) | |
} | |
end | |
def mono(l) | |
y = nil; | |
c = m = a = 0 | |
b = nil | |
l.each_with_index \ | |
{ | |
|x, i| | |
c += 1 | |
if (c > m) then | |
m = c | |
b = a | |
end | |
next if (!(y.nil? || x <= y)) | |
y = x | |
c = 0 | |
a = i | |
} | |
return m, b, l.size, b.to_f / l.size | |
end | |
def smooth(n, w) | |
l = [] | |
w.times { l << f2(n); n += 2 } | |
m = l.map { |x| x.size }.max | |
l2 = [] | |
(m + 1).times \ | |
{ | |
|i| | |
t1 = t2 = 0 | |
l.size.times \ | |
{ | |
|j| | |
x1, x2 = l[j][(i.to_f / m * (l[j].size - 1)).to_i] | |
t1 += x1 | |
t2 += x2 | |
} | |
l2 << t2 | |
} | |
return l2 | |
end | |
def run(p, k) | |
r = p[k] | |
c = 10 | |
a, b = r | |
d = (b - a).to_f / c | |
(c + 1).times \ | |
{ | |
z = long(a, k) | |
# $stderr.puts(z.inspect) | |
next if (z.nil?) | |
p([mono(smooth(z['n'], 500)), k, a, z['n'].to_s(2).length]) | |
a += d | |
} | |
end | |
p = {'cm' => [0, 50], | |
'cg' => [0, 100], | |
'm' => [0, 300], | |
'w' => [0, 75], | |
'r' => [0.0, 1.0], | |
'c' => [0, 250], | |
'z' => [0, 1000], | |
'p' => [0, 300] | |
} | |
run(p, ARGV[0]) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment