An implementation of the decision forest machine learning algorithm. The algorithm reads in a dataset and "learns" patterns in the data by building multiple random decision trees, and then classifies test instances by combining the results from all trees, aka the forest.

An implementation of the naive bayes machine learning algorithm. The algorithm reads in a dataset and "learns" patterns used to classify new instances. Patterns are learned by computing probabilities that a given attribute's value belongs to a certain class. The class with the highest probability of all its attribute's values is chosen as the predicted outcome.

An implementation of the minimax and alpha-beta minimax artificial intelligence algorithms. By "looking ahead" the program can generate optimal moves based on the current playing board for the game of mancala by minimizing your losses and maximizing your gains. The static board evaluator greatly affects the outcome of the algorithm and is extremely difficult to tune correctly for mancala.

A basic two player game called Isola which requires you to trap your opponent by moving around the board and blocking squares. Can be played human vs human or human vs computer which includes a fully functional artificial intelligence. Requires the XNA Framework v3.1 from Microsoft.

A demo of the capabilities of the Zune HD which include extensive touch screen interaction and accelerometer. Demonstrates such capabilities by allowing users to touch the screen to create sparkles which will then dim, fade, and move in the direction the device is tilted. Requires the XNA Framework v3.1 from Microsoft.

Program which captures and records information about incoming and outgoing packets on the given computer's network interface controller. Different NIC's can be chosen to listen to, and basic settings are available. Includes all documentation for use. ** Do NOT sniff packets on networks other than your own personal network. Indended for educational use only.

A program which uses an adjacency list representation to solve mazes with collapsible walls by linking together cells that don't have an unbreakable wall between them. The program then finds the least costing path from a maze file using Dijkstra's algorithm. *This program requires the mazeio.jar file to run correctly using graphics

POS program currently in use by a local restaraunt in Council Bluffs, IA. Calculates the price of a unique 28" pizza which is divisible by halves and/or quarters.

A program which uses an adjacency list representation to play the "Ladders Game" by linking together words that are one letter appart using a graph. The program then finds the shorest path from a user inputted start word to the end word using breadth first search.