- [↑ Programming]
- [7DRL]
- [Advent of Code]
- [Daily Programmer]
- [L2Program]
- [Lifehacker]
- [Ludum Dare]
- [One Game a Month]
- [PLT Games]
- [Programming Praxis]
- [Project Euler]
- [Stack Exchange]

## Posts

## Advent of Code: Day 25

**Part 1:**Take the relation:$$F(n) = \left\{\begin{matrix} 20151225 & \textrm{if}\ n = 1 \\ 252533F(n-1) \mod 33554393 & \textrm{otherwise} \end{matrix}\right.$$Arrange the values according to Cantor's diagonal argument. Find the value at a specific cell.

read more...## Advent of Code: Day 24

read more...**Part 1:**Split a list of integers into three groups of equal sum. Find the grouping such that the smallest group has the least items, breaking ties by the smallest product for that group.## Advent of Code: Day 23

**Part 1:**Create a simple virtual machine with two registers (`a`

and`b`

, non-negative integers) and six instructions:`hlf (a|b)`

- divide the given register by half, round down`tpl (a|b)`

- triple the given register`inc (a|b)`

- add 1 to the given register`jmp [+-]\d+`

- jump forward/backwards by the given number of instructions`jie (a|b), [+-]\d+`

- if the given register is even, jump`jio (a|b), [+-]\d+`

- if the given register equals one, jump

## Advent of Code: Day 22

read more...**Part 1:**Simulate an RPG mage battle; finding the winning solution using the least mana. See the original writeup for more details.## Advent of Code: Day 21

read more...**Part 1:**Given a shop full of weapons (buy exactly one), armor (buy zero or one), and rings (buy 0, 1, or 2), determine the set of items that will defeat a given enemy for the minimum cost (see the original writeup for more details).### Dec 2015

Advent of Code: Day 20- Advent of Code: Day 19
- Advent of Code: Day 18
- Advent of Code: Day 17
- Advent of Code: Day 16
- Advent of Code: Day 15
- Advent of Code: Day 14
- Advent of Code: Day 13
- Advent of Code: Day 12
- Advent of Code: Day 11
- Advent of Code: Day 10
- Advent of Code: Day 9
- Advent of Code: Day 8
- Advent of Code: Day 7
- Advent of Code: Day 6
- Advent of Code: Day 5
- Advent of Code: Day 4
- Advent of Code: Day 3
- Advent of Code: Day 2
- Advent of Code
- Advent of Code: Day 1
### Oct 2015

Takuzu solver### Aug 2015

Adjacency Matrix Generator### Jan 2015

Let it snow!- Generating omnichromatic images
### Dec 2014

Palette Swapping### Oct 2014

Tile Puzzle- Regular Expression Fractals
### Sept 2014

Look and Say### Aug 2014

Sandbox Battle!- Ludum Dare 30: Demo mode
- Ludum Dare 30: Programmer art and simple AI
- Ludum Dare 30: 24 hours
- Ludum Dare 30: Hints of a game
- Ludum Dare 30: Sandbox Battle
- Minimal palindromic base
- Number words
- Langton's ant
### June 2014

Factor trees- Call stack bracket matcher
### May 2014

Phone networks- Novel compression
- Trigonometric Triangle Trouble
### Mar 2014

Caesar cipher### Feb 2014

Dis/re-emvowelification### Jan 2014

Overlapping circles### Dec 2013

Edges to adjacency### Sept 2013

Smallest consecutive four-factor composites### Aug 2013

Visualizing the Monkey Grid- 'Tiny' Turing completeness without MMOV
- A 'Tiny' virtual machine in Racket
### July 2013

Racket Roguelike: Post-mortem- Racket Roguelike 10: Levels via automata!
### June 2013

Racket Roguelike 9: Daedalus' wrath!- Swap list nodes
- Racket Roguelike 8: A million words!
### May 2013

Racket Roguelike -- Going on hiatus- Ludum Dare 26 -- VTanks -- Results
- Racket Roguelike 7: Into darkness!
- Racket Roguelike 6: Dig deeper!
- Racket Roguelike 5: Armors and weapons and potions, oh my!
### Apr 2013

VTanks for Ludum Dare 26- Racket Roguelike 4: Slightly smarter critters!
- Racket Roguelike 3: Rats, rats, everywhere!
- Racket Roguelike 2: Infinite caves!
- Cyclic equality
- Racket Roguelike 1: A GUI, screens, I/O, and you!
### Mar 2013

Writing a roguelike -- in Racket! (Day 0)- Path to philosophy
- Approximating Pi with Buffon's Needle
- The House on the Hill - Postmortem
- The House on the Hill - Day 5
- The House on the Hill - Day 4
- The House on the Hill - Day 3
- The House on the Hill – Day 2
- The House on the Hill - Day 1
- Knight moves
- Partitioning the Dutch national flag
- February #1GAM post-mortem
### Feb 2013

Making Floupian Change- NPR Sunday Puzzle
- Predecessor and successor in a binary search tree
- Numbers as words in arbitrary bases
- The 147 Puzzle
- #1GAM - ChessLike 1.0 - Did it!
### Jan 2013

#1GAM - ChessLike 0.2.0 - Dungeons!- #1GAM - ChessLike 0.1.5
- An optimal alphabetizing cipher
- Gregorian/Mayan conversion
- Splay heaps redux--imperative model
- Sorting via splay heap
- Triangle Trilemma
- Translate CSV to HTML
- Four points, a square?
- Happy New Year
### Dec 2012

Parallel BF- A Brainf**k Interpreter
- Nested Primes
- Ludum Dare 25 - First favorites
- Narcissistic Numbers
- Generating non-repeating strings
- Numbers of Wirth
### Nov 2012

One Billion Primes - Segmented Sieve- List algorithms and efficiency
- Project Euler #9
- Project Euler #8
- Project Euler #7
- Project Euler #6
- Taxicab numbers
- Project Euler #5
- Project Euler #4
- Project Euler #3
- Project Euler #2
- Project Euler #1
- Project Euler
- The Sum Of The First Billion Primes
### Oct 2012

Pandigital Sums- Pythagorean Triples
- Prime Partitions II: The Listing
- Prime Partitions
- Memoization in Racket
- The Evolution Of Flibs
- Rule 30 RNG
- Chopping words
- Dodgson’s Doublets
- Word cubes
- Squaring the Bishop
- Two Word Games
### Sept 2012

A piece of the abc conjecture- The First Two Problems
### Aug 2012

Random Access Lists- Hash Tables With Open Addressing
- 4sum
- Minimum scalar product
- Two More Random Exercises
- Two Random Exercises
- SEND + MORE = MONEY
- The loneliest number...
### July 2012

Analyzing the dice game