Submission - Abel Anderson

[AbelSAnderson]

CS Games 2023 Team A Application

Full Name

Abel Anderson

UWindsor Email

[email protected]

Application Form

• I certify I have submitted the application form

Briefly explain how your solution works and how to run it

Explanation of solution

This is a fairly simple brute force approach to this problem.

First, we loop through the provided board until we find a letter that matches the first letter in the word. It will then call the findString function.

The findString function takes in four parameters:

• board: the board we are testing
• visited: the previous visited coordinates
• coord: the current coordinate
• word: the part of the word we are looking for

When we first enter this function it will check to see if we are searching for an empty word. If so, we have a valid solution.

If we have not found a valid solution yet, we add the current coordinate to the visited coordinates and recursively call this function on the four cardinal directions, first checking to see that:

• The coordinate in that direction is a valid coordinate
• The letter at the coordinate in that direction matches the next letter in the sequence
• The coordinate in that direction has not yet been visited

If we have searched all cardinal directions and have not found a valid solution, we remove this coordinate from the visited coordinates and return false.

Running & Testing

To test this solution, simply add your boards and associated tests to the testCases array.

This was built and tested on Python 3.7.9, so please test with an appropriate version.