I've found a couple posts about my question and they have helped but I'm still stuck. For a Boggle game I'm have issues with the part that searches my Hash Table for words. Well, full words i am fine with, its finding words that are partially there and continuing or backing out. Using ifstream, is there a piece of code im not aware of that does this?
I have the logic laid out the best i can for the SearchBoard Function.
Start on 0,0 of a  board.
save char to string
check to see if string is = word in Hash Table
see if partially there <- not sure of code
-continue searching word or back out and go a different way
-make sure next spot is a valid space on the board
rinse and repeat
putting all words that i find into a Binary Search Tree then printing when finished.
Any help would be appreciated. Thank you