In order to understand and display mastery of the waterflow method of software engineering in class I took part of a group project to design and create an online bookstore.
During this process we covered :
Our final project documentation can be found here.
Other collaborators: Keiler Schroeder, Ryan Kessler, Patrick Hughes, Logan Hill
The Problem: Place an N number of queens on an N x N chess board so that no queen can attack another.
The Method: Use a genetic algorithm to find a solution.
Why a Genetic Algorithm: Depending on the size of N, there are many solutions. Genetic algorithms are very good at finding a solution to a problem that has many solutions or no definitive best solution.
Constraining the problem: Even though genetic algorithms are good at finding solutions in large domains, they will function more effectively with a smaller domain. I constrained the search space by:
My implementation can be found here.
A simple library implemented in C++ and exported as a console application.
The program is required to:
An executable and my implementation can be found here. It is based off of the assignment here.