Algorithm Word Searching Puzzle using DLB trees

**Word searching

**Write a program to solve word searching puzzles, where words from a dictionary are to be found in a two-dimensional array of letters. For example, you might be given the following array:

M V J L I X A P E

J H B X E E N P P

H K T T H B S W Y

R W A I N U Y Z H

P P F X R D Z K Q

T P N L Q O Y J Y

A N H A P F G B G

H X M S H W Y L Y

U J F J H R S O A

Your program is to find words from the dictionary that can be spelled out in the puzzle by starting at any character, then moving in a straight line up, down, left, right, or on any of the four diagonals. For example, the above array contains the word ALGORITHM because it can be spelled out by starting the lower right corner and moving up and to the left; and it contains the word SYZYGY because it can be spelled out by starting at the s on the third row and moving down.

The full description can be found here....[url removed, login to view]~kirk/cs1501/assignments/wordsearch/[url removed, login to view]

Data files and dictionary are attached also

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

3) All source files of program, all Java .class files (or .jar file), Well written/formatted 2 page double-spaced paper describing results/how the program works.

## Platform

Java

Μηχανολογία Java MySQL PHP Αρχιτεκτονική Λογισμικού Δοκιμή Λογισμικού

Ταυτότητα Εργασίας: #3366111

Σχετικά με την εργασία