Java Boggle Assignment
EXECUTE LIKE THIS: C:> java Boggledictionary.txt 4×4-board.txt (orany boggle file)
Use args[0] for the dictionary and args[1] as the input file
The output you produce must match exactly and in same order tothe 191 words HERE
ONLY WORDS OF LENGTH 3 or MORE ARE TO BE COUNTED/OUTPUTTED
ANY HEURISTIC YOU WRITE MUST BE SUB LINEAR COMPLEXITY W/RESPECTTO N, THE DICTIONARY SIZE
This means your heuristic is NOT a loop that looks at everyword in the dictionary. Think binarySearch (excellent) vssequential search (terrible)
Solving the game of Boggle can be done elegantly with recursionand backtracking. The solution code is almost identical to theSwamp program you
OR
OR