1
edit
Changes
→Assignment 2
=== Assignment 2 ===
For our assignment 2 we chose to paralyze the searching for a letter inside the hangman game.
Because hangman usually uses a small word, paralyzing a search through a single word will not show a major increase. So we created a new game called letter search. In letter search, a "word" of length x is created at the beginning of a game. The word will contain all the letters of the alphabet chosen randomly minus 5 letters. One letter in the alphabet will be worth approximately double of the other letters.
The user tries to guess all the letters in the random character array for points.
The word can be anywhere from 1 letter, to 1000000 (The highest we have tested.)
With the parallelization, we noticed a massive increase in speed when searching through long words. The search through 1000000 letters is almost instant when parallelized, where as it took several seconds before it was parallelized.
The speed up times of the charts are below.
=== Assignment 3 ===
