This is a follow-up to my previous article about the Golf Horse “SIGBOVIK” problem. With great effort, I managed to save 6 more bytes. In this article, I’ll give an in-depth explanation of the additional techniques I used and how I discovered them.
The “SIGBOVIK” problem is the shortest problem in the Golf Horse collection. The goal is to write the shortest JavaScript program that prints out thirteen 64-digit hexadecimal numbers. Despite the apparent simplicity of this challenge, there’s still a surprising amount of depth to it!
In this article, we’ll take a look at an interesting connection between the 3-variable AM-GM inequality and the determinant of a particular matrix. We’ll see this connection also reveals when AM-GM holds for negative numbers, and it can be used to produce stronger versions of the inequality.
This is the sixth article in the series for Golf Horse: Wordle. I’ll go through some ideas for future improvements, and ideas that didn’t make the cut.
This is the fifth article in the series for Golf Horse: Wordle. We’ll build a very simple decompressor for JavaScript code to save a few bytes.
This is the fourth article in the series for Golf Horse: Wordle. In this article, we’ll go through some numerical techniques to find an optimum of a complex function.
This is the third article in our Golf Horse: Wordle series. We’ll take a detailed look at the context models and context mixing used in my submission.
This is the second article in the series for Golf Horse: Wordle. We’ll show how to optimally pack bits into UTF-8 JavaScript code.
This is the first article in the series for Golf Horse: Wordle. We’ll figure out how many bits we can theoretically pack into a valid UTF-8 file.
My first-place entry for a challenge to compress 12947 words into as little JavaScript as possible.