At
http://www.mathpuzzle.com , I give a one line explanation of how to solve the Sicherman dice problem. I've recently started compiling other Sicherman-like sets of dice, using polynomial factorizations. If anyone finds anything of interest, I'd like to see it.
Also this week, Ambigrams, and a program for 2D turing machines (often called ants of turmites). I seem to be the first to notice that one of the simplest turmites does Binary Counting, and that similar n-color turmites can mimic other number systems. Someone correct me if another noticed this first.
I also comment on the new range of metal puzzles offered by Bits and Pieces, and many many other things. I think I've done about 100 large updates since the last time I posted here.