How can I figure out where words intersect in the following?
AAAA#BBBB
.#.##C##H
.#.##D##I
.#...E.#J
##.##F##K
###..G..L
'#' represents the black spots in a crossword where you cannot fill in.
'.' represents the spots with missing letters that need to be filled in.
I've read the puzzle into a
vector<string> Horizontal;
vector<string> Vertical;
I can merge it or read it into a 2D array of strings as well but I cannot figure out where words intersect :S
I've got a list of all possible words that can fit into the spots given the letters that are currently there but I need a way to figure out where words intersect and where they don't so I can start filling it in.
Any ideas??