The Scrabble Problem

A faster (sublinear) algorithm for the following problem.

You are given an unlimited supply of tiles. Each tile has one letter on it and has a point value. If the letter is A, the point value is 1. If the letter is B, the point value is 2. If the letter is C, the point value is 3. If the letter is D, the point value is 1. Each word that can be constructed from these tiles has a values obtained by adding the values of the tiles. For example, the word AABCAD has value 9.

Under Construction.

Back to Course Page

Back to Assignment Page

Back to Scrabble Problem Page