Computer Systems Lab TJHSST Current Projects InHouse, pt 4

1
Computer Systems LabTJHSSTCurrent
ProjectsIn-House, pt 4
2
Current Projects, pt. 4In-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

2
3
Study of Microevolution Using Agent-Based
Modeling in CAgent 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)
3
4
Creating a 3D Game With a Study of OpenGL
Textures and Lighting TechniquesTo 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.
4
5
Paintball Frenzy!Optimized Minimax Agent AIThe
purpose of this project is to create an
innovative and enjoyable graphical game and
program a minimax AI agent that performs
optimally.
5
6
Using Machine Translation in a German English
TranslatorThis 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.
6
7
A Study of Balanced Search TreesThis project
investigates four different balanced search trees
for their advantages anddisadvantages, thus
ultimately their efficiency. Runtime and memory
space management are two main aspects under the
study. Statistical analysis is provided to
distinguish subtledifference if there is any. A
new balanced search tree is suggested and
compared with the four balanced search trees.
7