34 karma · joined March 19, 2014
Really bad code here: https://github.com/justecorruptio/hexapipes
interestingly, the sweet spot is a mix at 30^4 at 16797B
With 5 bits per letter, you have 6 symbols left over. We can use those to represent alternate pairs like "A or E", so you can encode BANDS and BENDS at the same time. Looks like if you pick the 6 highest frequency replacements for each starting letter, you can reduce the full word list size by ~2k words.
A naive lookup table for the replacements is 26 * 2 * 6 = 312 bytes.
edit: oops double counted the reduction
$M{hello}[4]{world}[0]++
gives you: {
'hello' => [
undef,
undef,
undef,
undef,
{
'world' => [
1
]
}
]
}I vaguely remember an old graphics professor mentioning that this peak would exist because of reflected light from the other wall, though I can't find any literature after some light googling. Is this a real thing, or am I crazy?
(o=b=>{for(j in a)for(i in a)y=a[i]+j,b?document.write(`<${i*j?'input':'p'} onfocus=value=[o[id]] onblur=o[id]=value;o() id=${y}>`):eval(y+(".value"+o[y]).replace(/[A-Z]\d/g," +$&.value"))})(a="_ABCD")heh
There are a surprising number of local go club around the country: http://www.usgo.org/where-play-go
Especially, if you're in the SF Bay Area (my area): http://bayareago.org/#local-clubs
0: Z 2
1: Z 3
2: J 0 2 -> 4
3: J 1 3 -> 7
4: I 2
5: J 0 2 -> 4
6: J 1 3 -> 7
7: I 2
8: I 3
9: J 1 3 -> 7
Handles the zero case. Only uses 4 cells total. curl https://raw.githubusercontent.com/usrbinnc/netcat-cpi-kernel-module/master/tracks/trk3data.h | perl -ne 'print chr hex' | mplayer -