css games question A

[KeaganWhiston]

CS Games 2023 Team A Application

PLEASE FILL IN THE FOLLOWING!

Full Name

Keagan Whiston

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 works by first checking to see if the first character exists in the board. If this is the case, then examine the positions N, S, E and W of said character and see if the next character exists next to that starting letter. Repeat this process until all characters are found or until the next character cant be found.