A veritable cacophony of eclectic topics, like emojis or programming. Now with an RSS feed!
tl;dr: Direct-inverse alignment is where transitive verb’s agent and object NPs are not marked, and instead which NP is the agent is determined by where they fall on a hierarchy. This article explains what that means and how that works.
tl;dr: Learning from the successes and failures of previous SCC pidgin games, the we devised a new set of rules for PidginCraft to help players stay engaged: giving them goals, having synchronous sessions, enforcing world boundaries, and removing starter languages.
tl;dr: I calculated a list of them using the SQL database that drives PokéAPI. There is only one such Pokémon from Gen 1.
tl;dr: SIGILS allows you to pipe items in modded Minecraft factories using ComputerCraft computers and manage them in the browser. It’s faster than traditional item pipes and easier to manage complex factories with it thanks to its intuitive click-and-drag interface.
tl;dr: Grow is an abstract strategy board game I invented that’s played on a 15x15 Go board and multicolored stones. It is intended for 3-4 players, but playable with 2+. It is inspired by Go and Tron.
tl;dr: I wrote a quick little Web Component for rendering HamNoSys symbol names into their corresponding HamNoSys characters that you can put on any web page.
tl;dr: The 😤 Face with Steam From Nose emoji was originally called the Face with Look of Triumph because the face has a different meaning in Japan.
tl;dr: I put WolframAlpha in Minecraft by writing Mathematikka, a Bukkit plugin that queries Mathematica via J/Link to get WolframAlpha results.
tl;dr: You can scan a Minecraft world for diamonds and use GRASS’s v.net.salesman to plot an efficient route to get all of them.
tl;dr: We can model Minecraft ore veins as graph data structures in ComputerCraft to create a program for veinmining. The graph method maximizes runtime efficiency at the cost of a bigger program.
tl;dr: We can model Minecraft ore veins as tree data structures in ComputerCraft to create a program for veinmining. The tree method minimizes the program size at the cost of efficiency compared to the graph method.