miniblog.

← Back to all posts
Jan 13, 2019 at 22:26
One fascinating property of chess engine design is that a deeper tree search can be more valuable than a smarter board value metric. If a metric is more accurate but more computationally expensive, it might not be worthwhile! It's a precision/brute force tradeoff.

Related Posts

Dec 14, 2019 at 23:07
The "Rule Of Least Power" makes a great argument in favour of less computationally capable languages. It claims this helped HTML/CSS adoption. https://www.w3.org/2001/tag/doc/leastPower.html Applying this principle, I'd expect total languages to be popular. This hasn't happened AFAICT: what's missing?
The Rule of Least Power
Jun 26, 2018 at 18:06
As a developer, you develop an intuition for the computational cost of doing things. It's possible to become computationally stingy: "a real time text editor (i.e. updates as soon as you type) is a huge waste of resources!" I wish I had a good name for this phenomenon.
Mar 20, 2018 at 18:41
The Ludwig editor has been open sourced! https://www.adelaide.edu.au/news/news98662.html Ludwig was an early (38 years ago) editor offering full screen editing, which was wildly computationally expensive next to contemporary line editors.