In the past studies on Othello, most were based on the traditional game tree searching algorithms, but only few were based on Monte Carlo algorithm, because it lacks Othello patterns which derives the simulations in Monte Carlo algorithm being almost pure randomized. In this thesis, we propose a matrix directed approach for Monte Carlo algorithms. We use a weighted matrix to represent the probabilities of the board positions during the simulations. Combining with opening book and MinMax searching in the endgame, we build an Othello program named Mothello. We use an open program WZebra as a template for experiments. The experiments show that the matrix directed approach with larger UCB constant increases the win rate of Mothello.