Team A Submission

[14gabe14]

CS Games 2023 Team A Application

Full Name

Gabriel Peralta

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

My solution uses a depth first search (DFS) algorithm. It iterates through the array and calls a helper function that performs DFS on every letter. If the first letter of the word does not match the letter in the board, or the indexes are out of bounds, it terminates the DFS function and returns false. In the next iteration, it calls DFS on all adjacent cells and passes a word with its first letter removed. In order to know if the algorithm already traversed a letter, it swaps the letter for a number before searching the adjacent cells. Once it finishes investigating the adjacent cells, it returns the number back to its original value.

To execute this code run the following command:

py solution.py

Then, insert the your input as shown in the example below and press enter to receive an output.