Consider a standard game of Scrabble® using the csw19 dictionary.
Many board-states exist where ZERO possible next moves exist. That is, no combination of 1-7 remaining letters can make a legal move.
My question is, how fast can you legally get the board into this state? I have a solution with an answer of FOUR moves, and will award the check to the first to provide one such solution.
Note: Better solutions may exist.
- The 'players' obviously will not be playing intelligently or even logically, just legally.
- The moves may take certain tiles out of play that would have been the only way to make a valid word later