PREV INDEX NEXT

Author: Unknown
Subject: Valid Boggle Cubes and Tries
Date: Saturday, 18 Apr 2020, 17:57:28

I'm confused about the meaning of note 5 in the Hwk 6 specification. Do the elements of a valid Boggle board have to match the cubes specified in the note? If so, what are the cubes that would be used for different board sizes? If not, what are valid board inputs (do both uppercase and lowercase letters count)?

On a different note, what is the meaning of the note "Your implementation of Boggle should use tries to represent the dictionary. However, you need not create a Trie ADT"? Does this suggest we should define a trie struct directly in our main program?
PREV INDEX NEXT