1
C Sc 227: Boggle
Collaboration This final project must be completed alone
Due Dates:
Required Iteration 1: Tuesday 5-May 8:00pm (100pts)
Optional Iteration 2: Wednesday 6-May 5:00pm (100pts)
o This will replace your lowest project score, assuming this score is larger
For this project you are asked to complete part or optionally all of a computer version of Boggle.
Boggle the Game
Boggle is a word game designed by Allan Turoff and
trademarked by Parker Brothers and Hasbro. The game
of Boggle has a container that holds 16 dice that can be
"rolled". Each six-sided die has letters from which players
try to find words. Words are possible if letters line up next
to each other horizontally vertically or diagonally without
being reused. There are 3 letters that can be connected to
any letter on a corner 5 for the other six letters on the
borders and 8 for the middle four letters (there is no
wraparound). To make up one word no letter may be used
more than once (this include the "Qu”). A word is accepted
and the score increased if all of the following are true:
The word made up from the dice follows the letter connection rules of Boggle
The word exists in our official list of words: BoggleWords
http://www.cs.arizona.edu/classes/cs227/spring09/projects/BoggleWords
The word contains 3 to 16 characters (one and two letter words are not allowed)
The word is not already in the accepted list (no duplicate words allowed)
The player's score is determined by summing the points for all words found in a dictionary according
to these Boggle rules.
Word Length Points
3 1
4 1
5 2
6 3
7 5
8+ 11
Simulate Boggle's dice rolls with the 16 dice. The same die must not always appear in the same
location. Here are the letters of each of the 16 six-sided dice where each:
L R Y T T E V T H R W E E G H W N E S E O T I S
A N A E E G I D S Y T T O A T T O W M T O I C U
A F P K F S X L D E R I H C P O A S E N S I E U
Y L D E V R Z N R N H L N M I H U Qu O B B A O J
Iteration 1 : Required of all
As with other projects you are asked to first develop a well-tested model. To get started immediately
begin with a type named DiceTray that determines if a given String can be found in the collection of
the current dice values using the rules of Boggle. DiceTray must have these 2 methods:
