patrickherrmann/Knapsack
4 implementations of the 0-1 knapsack problem and a comparison of their effectiveness.
Discovered public repositories for patrickherrmann in the GitHub catalog.
4 implementations of the 0-1 knapsack problem and a comparison of their effectiveness.
A general purpose resume in LaTeX
Creates a visual representation of 2D data points.
An animated computer version of a card game.
A .NET library for creating "dot" graphs to be rendered using Graphviz
A small library for creating animations in Java
Proof portfolio for Math 248. June 2011.
Solves boggle boards very quickly.
My first python script. Generates all ground state siteswaps given constraints.
A class representing a list of words stored as a tree. This data structure is used in Words-With-Cheaters and my Boggle Solver.
A general project exploring programming various physical properties.
A utility thrown together to help me cheat at Words With Friends (a Scrabble rip off). Finds all words within your rack of letters, plus possible crossing letters. Written sometime 2011.
Boggle/Scramble solver. Written sometime in 2010. Run the Main class and enter the board dimensions. It will generate a random board of that size and then solve it (find all possible words and the maximum points possible).
This program I wrote in Winter 2010 renders high quality images of the Mandelbrot set. The algorithm uses smooth coloring, periodicity checking, main bulb checking, and image resampling. It is only accurate to 'long double' precision.
The boardgame Blokus by Strata games. I made this in one day Fall 2011.
A* pathfinding algorithm implemented sometime Spring 2011.