Created
May 18, 2019 18:04
-
-
Save vznvzn/a7eeecd7e83465075a91bd1cb80611a2 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
def f2(n) | |
return n.odd? ? (n * 3 + 1) / 2 : n / 2 | |
end | |
def d(s) | |
c = s.split('').select { |x| x == '1' }.size | |
d = c.to_f / s.length | |
return d | |
end | |
def keys(ks2) | |
ksmn = ks2.select { |x| x.end_with?('-') } | |
ksmx = ks2 - ksmn | |
ksmn.each { |x| x.replace(x.chop) } | |
return {'ks' => ksmn + ksmx, 'ksmx' => ksmx} | |
end | |
def order(l, ks2) | |
l2 = (0...l.size).map { {} } | |
$k = keys(ks2) if ($k.nil?) | |
$k['ks'].each \ | |
{ | |
|k| | |
l1 = (0...l.size).map { |x| {k => l[x][k], 'i' => x} } | |
s = $k['ksmx'].member?(k) ? -1 : 1 | |
l1.sort_by! { |x| s * x[k] } | |
(0...l1.size).each { |x| l2[l1[x]['i']][k] = x } | |
} | |
l2.each { |x| x['z'] = x.values.inject(0) { |t, x| t + x } } | |
return (0...l2.size).sort_by { |x| l2[x]['z'] } | |
end | |
def out(a, a2 = {}, t = nil) | |
fn = 'out.txt' | |
k = a.keys | |
if ($f1.nil?) then | |
$f1 = File.open(fn, 'w') | |
$f1.puts(k.join("\t")) | |
f2 = File.open('gnuplot.cmd', 'w') | |
st = t.nil? ? 'unset title; ' : "set title '#{t}'; " | |
f2.puts("set ytics nomirror; set y2tics; set colors classic; set key top left box opaque; #{st}; plot \\") | |
(a.keys - ['t']).each \ | |
{ | |
|x| | |
f2.puts("'#{fn}' using (column('t')):(column('#{x}')) with line title '#{x}' #{a2[x]}, \\") | |
} | |
f2.puts | |
f2.close | |
end | |
$f1.puts(a.values_at(*k).join("\t")) | |
$f1.flush | |
end | |
def remove(a, ks) | |
a = a.dup | |
ks.each { |x| a.delete(x) } | |
return a | |
end | |
def seq(n) | |
l = [n1 = n] | |
while (n >= n1 && n != 1) | |
n = f2(n) | |
l << n | |
end | |
return l | |
end | |
def sum(l) | |
return l.inject { |t, x| t + x } | |
end | |
def trisect(ns) | |
nw = ns.length | |
l = seq(ns.to_i(2)) | |
cm = (0...l.size).max_by { |x| l[x] } | |
i = cm - nw / 2 | |
i = 0 if (i < 0) | |
lx = l[0...i] | |
ly = l[i...(i + nw)] | |
lz = l[(i + nw)..-1] | |
lz = [] if (lz.nil?) | |
return cm, lx, ly, lz | |
end | |
def count(ns) | |
cm, lx, ly, lz = trisect(ns) | |
lmx = [lx.size, ly.size, lz.size].max | |
return {'ns' => ns, | |
'nw' => ns.length, | |
'cm' => cm, | |
'lx' => lx, | |
'ly' => ly, | |
'lz' => lz, | |
'lxs' => lx.size, | |
'lys' => ly.size, | |
'lzs' => lz.size, | |
'lmx' => lmx, | |
'l3' => lx.size + ly.size + lz.size | |
} | |
end | |
def fmt(x) | |
return remove(x, ['lx', 'ly', 'lz']) | |
end | |
def add(l, ns) | |
$t = 0 if ($t.nil?) | |
$t += 1 | |
x = count(ns).merge({'t' => $t}) | |
l << x | |
x = fmt(x) | |
out(remove(x, ['ns']), {}) if ($t % $d == 0) | |
$stderr.puts(x.inspect) if ($t % 200 == 0) | |
end | |
def adj(ns) | |
ns1 = ns.dup | |
ns1[0, 1] = '10' | |
ns2 = ns.dup | |
ns2[0, 1] = '11' | |
return ns1, ns2 | |
end | |
def opt(ks) | |
c = 2e3.to_i | |
$d = c * 2 / 2000 | |
add(l = [], '1') | |
c.times \ | |
{ | |
l1 = order(l, ks) | |
i = l1[rand([l1.size, 50].min)] | |
x = l.delete_at(i) | |
ns1, ns2 = adj(x['ns']) | |
add(l, ns1) | |
add(l, ns2) | |
} | |
return l[order(l, ks)[0]] | |
end | |
ks = ['l3'] | |
x = opt(ks) | |
$stderr.puts(fmt(x).inspect) | |
t = 0 | |
[x['lx'], x['ly'], x['lz']].each_with_index \ | |
{ | |
|l, c| | |
l.each { |x| puts([t, x.to_s(2).length, c + 1].join("\t")); t += 1 } | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment