Not related to LLM garbage in any sort of way.

Talks about using Monte Carlo search (from Chess algorithms) to simulate future game states and coordinate AI in a turn-based action rpg. Awesome stuff

Paper describes an approach to compiling based on use of closures, presenting a supposedly straightforward way of implementing compilation for interpreters. This was a suggested reading from SBCLs 2013 GSoC suggested projects list.

See also https://news.ycombinator.com/item?id=47311815