GAME PROJECTS
S.P.A.R.K.
This is the title screen of my Sophomore level game, S.P.A.R.K.
I took the role of Technical Director Things I worked on for the game: 1.) Engine 2.) Message System 3.) Memory Management 4.) Object Handling 5.) Component Based Architecture 6.) Object Serialization - XML 7.) Sound 8.) Installer 9.) Merging the groups code 10.) Bug Fixes |
To Download the Installer, click Download below. It will send you to my Google Docs page for a direct download of the executable file
The team's Game Designer has constructed some very useful information about the game, the link below will send you to his site
|
The official link to DigiPen's Spark page, you can also download the game from their site
|
S.P.A.R.K. Level Editor
Same project as above, I was responsible for creating our Level Editor
I used AntTweakBar and DirectX9.0c to construct the editor I am currently learning OpenGL and using GLUI/GLUT to create an user interface right now All together, I have a decent understanding of creating user interfaces for such programs. As well, I enjoy suiting the interface to all of the team's needs The Image is just something I threw together real quick to show some of the things that the editor can do. |
To Download the Level Editor Installer, just click the link below and download from my Google Docs page
Class Projects
Knights Tour
This project came from one of my primary C++ Programming classes. The class was all about understanding the speed, complexity and how to create complex algorithms.
We also covered many of the containers used in the every day programmers toolbox. That includes understanding them and creating them ourselves. This project was specifically about writing an algorithm to move a Knight on any size chess board (MxN) to every tile, only touching each tile once There were two methods to implement, static and heuristic methods. |
Other projects we worked on:
1.) Object Allocator
- Teaching the in depth detail and creation of Object Management
2.) Expression Tree
- Creating a Binary tree to evaluate semi-complex equations down to the smallest possible form
3.) Hash Table
- Created our own hash tables with provided hash functions
4.) Adjacency List Graph
- Created our own AL Graph and wrote our own version of Dijkstra's Algorithm to calculate all possible paths to each node from any node
1.) Object Allocator
- Teaching the in depth detail and creation of Object Management
2.) Expression Tree
- Creating a Binary tree to evaluate semi-complex equations down to the smallest possible form
3.) Hash Table
- Created our own hash tables with provided hash functions
4.) Adjacency List Graph
- Created our own AL Graph and wrote our own version of Dijkstra's Algorithm to calculate all possible paths to each node from any node