ENet for C# wraps the C-language ENet networking library. For games and other realtime applications, if you use TCP, old data can hold up newer data, even if it is no longer relevant (old positions, etc.). Your players will perceive any lost packet as a "lag burst". ENet supports multiple in-order streams of data, and allows you to decide on reliability on a per-packet basis. The library is useful for both client-server and peer-to-peer architectures.
Lhasa is a Free Software replacement for the Unix LHA tool, for decompressing .lzh (LHA/LHarc) and .lzs (LArc) archives. The backend for the tool is a library, so it can be reused for other purposes. Lhasa aims to be compatible with as many types of lzh/lzs archives as possible. It also aims to generate the same output as the (non-free) Unix LHA tool, so it will act as a drop-in free replacement.
Micro Snake is based on a simple snake game by Simon Huggins. This version of the snake (worm) game is very small and only utilizes ANSI escape sequences to draw the board. Hence it is very suitable for small embedded systems with only serial or SSH console access. The code uses no curses or other heavy libraries, only ANSI escape sequences and the Unix "stty" command to setup and restore the display.
Simulated annealing is a computational algorithm for optimization. It mimics the physical process of thermal annealing in which a metal is heated and then slowly cooled to settle into a highly ordered crystal structure. For common metals, the lowest energy state is already known. But the method is useful for other problems where the best state is not known and exhaustively searching all possible states is impractical. The method is applied by modeling the problem as a physical system with structure, energy, and temperature. This Python module implements simulated annealing so that it can be easily applied to a variety of problems. An example program is include to perform simulated annealing of the traveling salesman problem.
Shasplit takes a large data block, splits it into smaller parts, and puts those parts into an SHA-based content-addressed store. Reassembling those parts is a trivial "cat" invocation. Repeating parts (e.g., from previous split operations) are stored only once, which allows efficient incremental backups of whole LVM snapshots via Rsync. Shasplit shows its strengths on encrypted block devices, but might be useful for non-encrypted data, too.