Consider a game where you search for words in a grid:
GRID:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
0 M F G R D C Z C O M P A N Y C R N L K B
1 S M S X A G W T P V C W L D K N S G S U
2 Q Y U W J E X S Y R I O D I S K N M O I
3 C S D D Z M A Y W J I S U H M U I V M L
4 F T R I A S Q Q H W D D H N E R K M F D
5 B E G P A B M L Q M I C Q J T Q L I Z I
6 G R U I E M E X A M I N E J W R Q N N N
7 C Y M I O N E Y M O R N I N G F Y I D G
8 I O X P L P V T V L E F Z X F P O M I F
9 T D M Y R J R E E Q I L H D I Y U A S I
10 J X E F G G D E L R J K E V N K K L A N
11 E S P S O I P H C O R X E C I G Y G B I
12 G T A G I R V Q J E P P I W T G C Z L S
13 O E Q N H G T F N L I E T J I R T J E H
14 H R Q R O B N R I Z B V A M A S I V D E
15 D L U M X N E E Z U F D E D T S E C W D
16 R I V C M A G O R C E U P D E I K N Y N
17 C N L I G H T I N G Y K G R M W S O D X
18 I G B K I G P J C T U D F I J U D V O S
19 I N C L U D E Q Y M Y K N B R I T D S I
WORDS TO FIND:
FINISHED
COUNTRY
ENVELOPE
DIAMETER
DESIGNER
INITIATE
LIKEWISE
MINIMAL
INCLUDE
STERLING
RECEIVED
MORNING
DISABLED
COMPANY
LIGHTING
ELECTRIC
COMFORT
MYSTERY
EXAMINE
BUILDING
Here is a program that generates such a game: Github Project
- Download and run this program. Exam the code and see how it works.
- Come up with an algorithm to find the words in the grid. Assume the grid is represented as follows:
vector<string>& grid
And the words to find are stored in:vector<string>& words - As you search, how do you keep track of where you have been? What direction you are going? The words you have found?
Words to use:
OldKenyon
Peirce
Ascension
Ransom
Rosse
Gund
Chalmers
MiddlePath
Gambier
Kokosing
Horvitz
Mather
Leonard
Kokosingers
HillTheater
Philander
Ransom
Delbert
Newman
KenyonReview