| |
|
Projects
|
|
|
|
|
Sticky Notes
A tool for keeping notes on your desktop. There are many features in the current version:
- Each note is customizable. The user can change the color, opacity, and font of the note.
- Notes can be displayed and hidden by simply hitting ALT+F1.
- Saved notes are loaded when the program is started.
- All notes are automatically saved every five minutes to avoid loss of important information.
- New notes can be easily created by double clicking the system tray icon.
Eventually I will be adding an options feature that will enable the user to select defaults for note size, color, opacity, and font. I've included the source code in the download. The executable is in the bin/Debug directory.
Screenshots: 1 2
Download Sticky Notes (source included)
|
|
|
Falling Blocks
A basic Tetris clone. Created in Microsoft Visual Studio using C++ and OpenGL. It's still under development.
Features to be added:
- Add textures to Tetris pieces.
- Create scoring system.
- Implement two player mode: Human vs. Human and Human vs. Computer (with A.I.)
Download Falling Blocks
View Demo
|
|
|
N Queens Problem
This a solution to the N Queens Problem for any N up to 10.
The basic idea behind my solution is to create a tree containing only valid solutions. My initial idea was to first create
a tree containing every possible board state and then search for valid solutions, but such a tree proved to be too large.
The program is fairly simple. There is a datatype named board which holds a 2D boolean array
of 10x10 (or whatever the maximum size may be). A true element in the array indicates a queen,
false, no queen. The node data type is used for the tree. It contains one board and a list
of node pointers (the subtree).
The most important functions are create_tree() and add_piece(). Together, they create a tree
that has valid solutions at each leaf. This is done by checking to see that each
time a queen is added, the spot that it is being added to is valid.
The output_results() function is used to print all of the results to a file. It calls the
find_solutions() function to traverse the tree and prints the solutions located at the leaves
of the tree.
Download Source Code
View Sample Output
|
|
|
|
