1. Computer Systems Lab TJHSST Current Projects In-House, pt 4

2. 2 Current Projects, pt. 4 In-House Microevolution Using Agent-Based Modeling in C++ A 3D Game With a Study of OpenGL Textures and Lighting Techniques Paintball Frenzy! Optimized Minimax Agent Machine Translation in a German – English Translator A Study of Balanced Search Trees

3. 3 Study of Microevolution Using Agent-Based Modeling in C++ Agent Class class Organism { public: Organism(); Organism(int ident, int row2, int col2); Organism(Nucleotide* mDNA,Nucleotide* dDNA, int ident, bool malefemale, int row2, int col2); ~Organism(); void printGenome(); void meiosis(Nucleotide* gamete); Organism* reproduce(Organism* mate, int ident, int r, int c); int Interact(Organism* neighbors, int nlen); int GeneValue(bool parent, int chromnum, int gennum);

4. 4 Creating a 3D Game With a Study of OpenGL Textures and Lighting Techniques To create a first person 3D game using OpenGL. The program consists of using models, textures, lighting, and polygons to create a 3D world in OpenGL. Various equations are used to calculate camera angles, movement, and physics. For example, to move the camera, “eye movements” are controlled by glLookAt, which takes an eye position with 3 points (x,y,z) and 2 vectors. One vectors is the up direction and the other is the forward direction.

5. 5 Paintball Frenzy! Optimized Minimax Agent AI The purpose of this project is to create an innovative and enjoyable graphical game and program a minimax AI agent that performs optimally.

6. 6 Using Machine Translation in a German – English Translator This project attempts to take the beginning steps towards the goal of creating a translator program that operates within the scope of translating between English and German.

7. 7 A Study of Balanced Search Trees This project investigates four different balanced search trees for their advantages and disadvantages, thus ultimately their efficiency. Runtime and memory space management are two main aspects under the study. Statistical analysis is provided to distinguish subtle difference if there is any. A new balanced search tree is suggested and compared with the four balanced search trees.