Professional Portfolio

Game Design

It's not much, and I made it a very long time ago for a class, but here is the first game I ever made when I was first learning to code: Temple Stand

I worked on a horror game with a team of friends called Embrasure. There are currently no links to this game online, I will post one as soon as one exists again!

I worked on another game project with a friend of mine, and that one was a lot bigger: Departed Defender

Later, I created a Android application called Figure Me Out. This app the proof of concept for a better, more polished version, but it's fully functional as is: Figure Me Out

Upon finishing grad school, I started working on my own game project. This early version is designed and programmed by myself alone: The Royal Hunt

A later version of this game with the majority of art assets done by an artist was published to Kongregate.com later that year: The Royal Hunt: Tournaments

Since then, I have created multiple games for a learning website called: Legends of Learning. As of right now, I have fully designed and submitted 6 math games for them. I'm afraid you need to make an account with them to see those games.

Art

Although my main focus is programming, I have from time to time done both 2D and 3D art, and have a minor degree in Art History from George Mason University.

I was very young when I started making logical designs like the one you can see to the left. With these pictures, I had no real clear idea of what the final product would look like, but I would pick a pattern and attempt to replicate it precisely and by hand over and over again. This picture for example is the simple repetition of a same pattern, 16 times.

Later in my academic years, I learned how to use multiple design software products. I have a light knowledge of how to use Adobe Photoshop and Aftereffects, and Maya. The holy hand grenade to the left was designed with Maya for a game project that was scrapped.

Class/Academic Experiences at George Mason University:

Game Design courses:

• CS 325 (Introduction to Game Design) • CS 351 (Introduction to Game Design) • CS 425 (Game Programming I) • CS 426 (Game Programming II)

General Science related courses:
- MATH 113, 114,125,203 (calculus I and II, discrete math, and Linear Algebra) • PHYS 160 and 161 (university Physics) • IT 103 (Introduction to Computing)
Graphic Design Courses • AVT 104 (Studio Fundamentals I) • AVT 382 (2D Experimental Animation) • AVT 383 (3D Experimental Animation) • GAME 332 (Story Design for Comp Games)
Art History Courses: • ARTH 103 (Introduction to Architecture) • ARTH 102 (Symbols/Stories in Western Art) • ARTH 201 (Survey of Western Art) • ARTH 324 (Alexander to Cleopatra) • ARTH 319 (Art of Ancient Near East) • ARTH 394 (The Museum) • ARTH 399 (Virginia Plantations)

Graduate Courses

CS 540 (Language Processors – Compilers)
CS 551 (Computer Graphics)
CS 571 (Operating Systems)
CS 580 (Introduction to AI)
CS 583 (Analysis of Algorithms)
CS 633 (Computational Geometry)
CS 684 (Graph Algorithms)
CS 685 (Autonomous Robotics)
CS 662 (Visual Computing, Game Tech)

Graduate level Projects:

➢ Decomposition of a convex polygon with triangulation. (Computational Geometry)

➢ Generating image hedcuts using weighted Voronoi Stippling. (Computational Geometry)

➢ Calculating the minimum bottleneck matching for points in convex positions (Computational Geometry)

➢ Designing and Implementing a compiler for Mython (Language Processors – Compilers)

➢ Simulating the movements of a deferentially driving robot (Autonomous Robotics)

➢ Path planning using Rapidly exploring Random Trees. (Autonomous Robotics)

➢ Some practice with Markov decision processes (Autonomous Robotics)

➢ Dynamic path finding. Comparing D* with dynamic Jump point search (Autonomous Robotics)

➢ Implementing K-nearest neighbors in lisp (Introduction to AI)

➢ Implementing a decision tree with an information-theoretic choose-feature heuristic (Introduction to AI)

➢ Implementing a two-layer back-propagation neural network for solving simple equations (Introduction to AI)

➢ Implementing a floating-point genetic algorithm (Introduction to AI)

➢ Implementing Inverse Kinematics using the Jacobian Method, and CCD, (Visual Computing, Game Tech)

Google Sites

Report abuse