Building a recursion algorithm to check a 2d array of words

Question

I am trying to build a Sudoku game with letters instead of numbers. There will be boxes like the following: 3 by 3 box

And the user will try to find the right permuta