hnkain

6 ms·

1.
by hnkain 2y ago
It's great as a learning experience for the author, but it would be a good idea for the author to take a look at a JSON spec and see if the regular expressions used by the lexer support the whole spec and don't accept non-legal JS
2.
by hnkain 5y ago
I commented elsewhere already, but I have a blog post where I go through some examples of applications of the Kelly Criterion, including two that are related to insurance: https://blog.paulhankin.net/kellycriterion/
3.
by hnkain 5y ago
I have a blog-post on the Kelly Criterion, and some (I think interesting) realistic examples of its application in decision-making: https://blog.paulhankin.net/kellycriterion/
4.
by hnkain 5y ago
It's a bit disappointing that there's been many writeups of heuristic-based solvers make the front page, but the writeup of an exact solver doesn't make it. [Note: I was the person who submitted the link to the exact solver w
5.
by hnkain 5y ago
The (exact) optimal EV-minimizing strategies (assuming each target word is equally likely) always solve in 5 of fewer guesses in normal mode, and always solve in 6 guesses in hard mode. If you wish to guarantee 5 guesses in hard mode, there
6.
Wordle solved (optimal algorithm minimizing average number of guesses)(sonorouschocolate.com)
11 points by hnkain 5y ago|1 comments
7.
by hnkain 6y ago
If you like programming puzzles, I also recommend trying to write the littlemancomputer programs listed on this blog entry: https://blog.paulhankin.net/littlemancomputer/ They are fun in the same way as TIS-100 is fun,
8.
by hnkain 6y ago
https://blog.paulhankin.net I don't think everyone should read it, because it's quite technical. There's articles on mathematics, game-theory, and computer science. The highlight (in my opinion) is a series of art
9.
by hnkain 7y ago
I wrote a solution to this some time back: https://github.com/paulhankin/morse-decoder . It finds the most likely sentence based on n-gram frequencies and a dictionary, and runs a relatively fast dynamic program (it&#x
10.
by hnkain 7y ago
In particular, E is . and T is -, so you can trivially decode any sequence of dots and dashes to strings containing only E and T.
11.
by hnkain 8y ago
You can do it with just integers (ie: in Z[φ]) by noting that φ^n = φFib(n) + Fib(n-1). Equivalently, compute X^n in Z[X] / (X^2-X-1). I have an article on my blog, but it's unfortunately down right now because of some github iss
12.
by hnkain 9y ago
It looks like they got the N upside-down. The top of the N (the end with two serifs, as you can see here http://www.identifont.com/similar?TI ) is pointing to M, rather than the bottom.
13.
by hnkain 9y ago
https://en.wikipedia.org/wiki/Little_man_computer is a simple computer model for education, from the 1960's. I built an emulator for it, which you can find here: http://paulhankin.github.io/lmc&#x2
14.
by hnkain 10y ago
It would be surprising to me if a completely deterministic strategy wasn't within some very close margin of an optimal strategy. For example, if you think you should raise with JJ 1/3 of the time and call the rest of the time in s
15.
by hnkain 10y ago
Significance works the other way round than you described it -- if two players were equal in skill, then a winrate of -91mbb/g or larger would happen 5-10% of the time. I don't know if Doug Polk understands that or not, but I agre
16.
by hnkain 10y ago
Go's GC has been precise for heap-allocated data since go1.1 (released 3 years ago) and precise for heap and stack-allocated data since go1.3 (released 2 years ago), completely fixing any GC problems with values that look like pointers
17.
by hnkain 10y ago
It doesn't invalidate what you say, but you're assuming there's a bounded number of different values in the array -- 2^k where k is your word size. Under this assumption, a correctly implemented quicksort also runs in O(N) ti
18.
by hnkain 10y ago
A phone book search does O(log N) string comparisons, but its running time is not O(log N) unless you consider all string comparisons to take a constant amount of time. Because for the names in the phone book to be distinct, the strings hav
19.
by hnkain 10y ago
I'm the author of the blog post. You're right, it requires n^2 binary digits (and I mention this at the end of the article). The formula isn't, and isn't meant to be, a good way to find Fibonacci numbers -- it's mor
20.
by hnkain 12y ago
I don't think the author's interpretation of #5 to mean use smart objects (which I'll guess means objects in the object-oriented sense) is correct. I interpret Pike's meaning to be to use dumber objects that make the dat