Project and textbook

# Project and textbook - CS61BL Summer 2011 Project 2 Boggle...

This preview shows pages 1–4. Sign up to view the full content.

CS61BL Summer 2011 Project 2: Boggle! I. Introduction and Rules Boggle is a multiplayer word-finding game designed by Alan Turoff and trademarked by Parker Brothers. You can find out all the details here on the Wikipedia page: http://en.wikipedia.org/wiki/Boggle The rules portion of the above article are copied below: The game begins by shaking a covered tray of sixteen cubic dice, each with a different letter printed on each of its sides. The dice settle into a 4x4 tray so that only the top letter of each cube is visible. After the dice have settled into the grid, a three-minute timer is started and all players simultaneously begin the main phase of play. Each player searches for words that can be constructed from the letters of sequentially adjacent cubes, where "adjacent" cubes are those horizontally, vertically or diagonally neighboring. Words must be at least three letters long, may include singular and plural (or other derived forms) separately, but may not use the same letter cube more than once per word For example, consider this board: .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Here, we can make the word “Peace” as follows Note that the word "PLACE" is not legal, since after the "L" you would need to jump over the "H" to get to the "A". The same die cannot be reused in the same word (but can be reused again in a different word). Similarly, it is not possible to make the word POPE , because doing so would require reusing the P . Words are scored by the following formula: Word Length Points 3 1 4 1 5 2 6 3 7 5 8+ 11 Each player records all the words he or she finds by writing on a private sheet of paper. After three minutes have elapsed, all players must immediately stop writing and the game enters the scoring phase. In the scoring phase, each player reads off his or her list of discovered words. If two or more players wrote the same word, it is removed from all players' lists. Any player may challenge the validity of a word, in which case a previously nominated dictionary is used to verify or refute it.
For all words remaining after duplicates have been eliminated, points are awarded based on the length of the word. The winner is the player whose point total is highest, with any ties typically broken by count of long words. One cube is printed with Qu . This is because Q is nearly always followed by U in English words (see exceptions), and if there were a Q in Boggle, it would be unusable if a U did not, by chance, appear next to it. For the purposes of scoring Qu counts as two letters: squid would score two points (for a five-letter word) despite being formed from a chain of only four cubes. II. Assignment Your assignment is to write a program that plays a fun, graphical rendition of Boggle, adapted to allow the human and machine to play pitted against one another. By the end, you will have a program that will perform like the picture at the top of the first page, consistently destroying any and every human opponent. Start by downloading the source code package here:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

Project and textbook - CS61BL Summer 2011 Project 2 Boggle...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online