A new Scrabble engine uses probability-based modeling to compete at championship levels. The system evaluates board states and move probabilities rather than relying on static heuristics. This approach optimizes word choice based on opponent tile tracking. It demonstrates how targeted probabilistic models outperform general search algorithms in constrained, adversarial game environments.