Programming Project: Bizarre Scrabble The board game scrabble works by assigning
ID: 664584 • Letter: P
Question
Programming Project: Bizarre Scrabble
The board game scrabble works by assigning points to wooden tiles arranged in cells on a board. It's described here: Scrabble.
We'll simplify this considerably, and consider the following question. We begin with the letter-scoring scheme from Scrabble:
a = 1, b = 3, c = 3, d = 2, ..., z = 10.
Given a text file - a novel for example, what is the highest-(or a highest-) scoring line in the the file? In keeping with the Scrabble style, we'll add double and triple letter scores: any letter that falls at a line (String) position that's evenly divisible by 4 will have its score doubled; and any letter that falls at a line (String) position that's evenly divisible by 9 will have its score tripled. A letter at a position that's evenly divisible by 4 and 9 will have its score doubled, not tripled. All non-letters (e.g., space, comma, etc.) have score 0.
Example: the line "now is the time" has a Scrabble score (by our rules) of 29. (Important: verify this with pencil and paper. Note that "n" is at position 0, which is a double letter score.)
Your solution is in two classes: A driver class called LineScrabbleDriver, and a class called LineScrabble, which does the heavy lifting for the application. The LineScrabble class should extend Echo, in the standard way we've indicated (it could also extend the LineReader class from Chapter 11 of the text). Submit the code to these classes in the boxes below.
Output: your program should report the (or a) highest scoring line in the input file, along with the score for that line.
Tips:
Make sure you master Chapter 10 of the text as a prelude to doing this problem.
Here is a list from a to z of the letter scores from Scrabble:
{1,3,3,2,1,4,2,4,1,8,5,1,3,1,1,3,10,1,1,1,1,4,4,8,4,10}
Notice that this list is in proper format for copying and pasting directly into your program as an int array.
It's far easier to convert lines of text to lowercase before processing.
You MUST use a try-catch harness in the driver class.
You MUST comment every method with a one line description of the job that method does, and your description must be placed just below the method header line.
Two sample files are provided: sampletext.txt is silly but useful, and HeartOfDarkness.txt is the famous novella by Joseph Conrad.
Some sample output:
IMPORTANT NOTE: Do not include ANY import statements in your code. The proper classes have been imported for you.
Submit your LineScrabbleDriver class here:
import java.util.Scanner;
import java.io.*;
Here comes the box
____________________________________________________________________________
_____________________________________________________________________________________
The box ends here.
Submit your LineScrabble class here:
import java.io.IOException;
The box__________________________________________________________________________
_______________________________________________________Ends here.
Explanation / Answer
import java.util.Scanner; import java.io.*; public class LineScrabbleDriver { public static void main(String args[]) throws IOException { String fileName; Scanner nameReader = new Scanner(System.in); System.out.println("Enter a file name"); fileName = nameReader.nextLine(); LineScrabble e = new LineScrabble(fileName); e.readLines(); e.results(); } } import java.io.*; public class LineScrabble extends Echo{ double max = 0.0; String bestWord = ""; int lineNumer = 0; public LineScrabble(String f) throws IOException { super(f); } //scrabbles int[] scrabbles = {1,3,3,2,1,4,2,4,1,8,5,1,3,1,1,3,10,1,1,1,1,4,4,8,4,10}; //process the given line public void processLine(String s) { s.toLowerCase(); int score = 0; for(int i = 0; i max){ max = score; bestWord = s; } } //displays the winner and score public void results() { System.out.println("Winner: " + bestWord); System.out.println("score: " + max/bestWord.length()); } }Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.