Introduction to Behaviour Trees — DAGs with codey nodes. Behavior trees replace the often intangible growing mess of state transitions of finite state machines (FSMs) with a more restrictive but also more structured traversal defining approach.

P vs NP Cheat Sheet — the space and time Big-O complexities of common algorithms used in Computer Science.