Chapter 4
Polishing the Word Game
Section 3
Searching the Grid Recursively
In the previous video, we saw that the search functions couldn't be refactored in a simplistic, mechanical way. We now have to think about how to change a simple string search using 'isInfixOf' into something that searches on characters, but returns a complex Cell type. - Simplify the problem into a search on a prefix and break that down recursively - Once that's done, find the word anywhere in the line, for example, as an "infix" search, again recursively - Update test cases to make sure that our code is still doing the right thing