Word Search

The Brute Force algorithm is the most naive implementation we explored for solving a word search puzzle. This approach is very similar to how you would solve a word search with paper and pencil. It involves taking the first character of a word, let's’ say the word is CAT, and iterating over every single character in a board from the first ... ................
................