Description: In chess, the knight piece moves in an unique "L"-shaped manner. Modelling this manner of movement and routing a knight from some given square to another creates an interesting and unique problem. This program places our knight within the confines of a 5 x 5 chessboard and tries to find a route from one point to another. All testing of this program was done with Borland C++ v5.02.

Description: This program is an exploration of breadth-first versus depth-first state space searches as utilized in a Tic Tac Toe game. In order to implement both, the program makes use of either a template stack or a template queue to store data. The user can fill out a Tic Tac Toe board to his or her liking and then the program will scan the board and generate all of the possible outcomes of the game from that point. Then based upon those results, it will inform the user as to the possible outcomes of the game.

Description: Here's a program that easily proved the bane of my existance for a short part of my life. When run it produces a neural net that can differentiate between an X or a T as drawn in a 5 x 5 array. Even with the professor supplying as much help as he felt he could, this program proved very difficult for the majority of the class.