miniblog.

Today I learnt that A* doesn't work for an arbitrary non-planar graph, you need additional structure: https://stackoverflow.com/q/26568552/509706 This matches my experience with difftastic so far. The graph is non-planar and my best heuristic only matches Dijkstra perf in typical cases.

Good code using regexes often has a comment giving an example of a typical string that it matches. Could this be a first class language feature? It's a great pattern.

Fascinating talk on applying deep learning to detecting cheaters in CS:GO https://www.youtube.com/watch?v=kTiP0zKF9bc The presenter discusses how they get machine-readable data out of matches, and how they still keep a human in the loop (ML just feeds the human analysis component).