List of All Posts and Tags

After watching this video from Truttle1 about things you can do in TypeScript’s type system, I’ve decided to do my own by implementing the basic Lambda Calculus interpreter.

Here’s an interesting puzzle I used in my D&D campaign’s final session. The puzzle and the code to generate it is attributed to @usuyus. If you know him, you know him; if you don’t… You should meet him!

In an high-frequency trading environment, we need to have a trading system which provides interfaces for receiving data and interacting with the market for our trading models (the mathematical or algorithmic logic that analyses data and decides how to trade). One really important thing to first consider in our trading system is to separate it from our trading models. If our trading system is coupled with our trading models, it can become a nightmare situation to modify model behaviour or to add new, fundamentally different models as the time it will take to implement them will be too much.

This April, I am going to do something that I’ve never done before. Which is to write and publish a blog post every single day for the entirety of the month.

Everyone knows about Deep Blue; it is the first chess computer that beat a reigning world champion—Garry Kasparov. Although losing to Kasparov in 1996, Deep Blue came on top in the rematch in 1997. The matches, however, are not the whole story. Creating this computer engine took decades of work from researchers and the chess world. Feng-hsiung Hsu—the man who started the project—said that the team “had spent close to 30 man-years on the project when Deep Blue won the match.”[^1] Further from that, some ideas used in Deep Blue were theorised nearly half a century earlier. We will look at those ideas and how the current computer engines came to be—the ones that now shape how chess is played.