Wrote a basic hangman program. You can either have it guess your word or give it one to do instantaneously.
Made a quick anagram solver.
Moved anagrams program to language specific subdirectory.
Improved the anagrams c program to take multiple arguments.
Made haskell anagram program, uses trees and is rather slow.
Much faster haskell anagram program, uses a flat list now and linear lookup.
Haskell anagram program changed to use a map. Slightly slower actually.
Preliminary attempt at a snowflake generator.
Can handle 300x300 5000 particles.
Uses a bounding circle. Can handle up to 10000 particles, any size
Now uses a rectangular border. Can handle 20000 particles
Fixed bugs, now generates very cross shaped flakes. Can handle up to 30000.
Changed back to using a circular bound which tracks the centre of the snowflake.
Changed image writer to use naive run-length encoding
Moved code to do with the bound out to a separate file.
Moved image writing to a separate file.
The image writer now crops to the snowflake size.
Performance improvements and now a rebounding barrier rather than an absorbing one. Performance is linear, can do a 500000 particle flake in 10 minutes.
Added a progress check. Prints every 1000 particles.
Bound has a separate distances for construction and destruction, takes arguments on initialization.
Declaration of BSP structure, basic test written, no implementation yet.