Kata

Boggle is a word game where, given a grid of letters, you have to find as many words as you can, the longer words the better. In this kata, you will build a Boggle solver.

function boggleSolver(grid, dict) {
    // Return the list of all words found on grid
}

The boggleSolver function will take two parameters :

• The grid, represented as a 4x4 array of uppercased letters, e.g :

    [['H','U','N','S'],
     ['N','B','I','E'],
     ['E','A','M','L'],
     ['T','S','S','O']]
  

• The dictionary of known words, as an array of uppercased words, e.g :

    ["AAH","AAHED","AAHING","AAHS","AARDVARK","AARDVARKS",...,"ZYMURGY","ZYZZYVA","ZYZZYVAS"]]
  

The boggleSolver function must return an array of all found words, sorted alphabetically by length descending.

Words are built using adjacent letters on the grid (vertically, horizontally or diagonally) and each letter must only be used once.

For example, using the grid given previously, the result should be something like

["BAILSMEN", "SNUBNESS", "BATSMEN", ..., "TAN", "TEA", "TEN"]