Artificial intelligence search techniques has been the main method for creating seemingly unbeatable computer players. Recent history has explored machine learning to play real time games such as DOTA 2 or Jeopardy. However, this method requires a huge amount of data prior to running the algorithm. As a result this project will mainly focus on deterministic approaches to multiplayer games. These methods include Minimax, Paranoid, Max-n, and Best Reply Search with Alpha-beta pruning. The game under question will be Scrabble. Several factors such as move generations and scoring heuristics plays a huge role in how well these search algorithms perform.