Electronic Devices Jorge Hernandez, Karen Daza, Hector Florez 9 1 2020 https://doi.org/10.6025/ed/2020/9/1/1-12 http://www.dline.info/ed/fulltext/v9n1/edv9n1_1.pdf Algorithms play a major role in games. The algorithms pass a node in the board games, the heuristic function get involved. Thus we tried to understand the evaluation process where the domain is treated. We in this current work, provided an approach to find the best movement by deploying a game tree, with an implementation for the board game called Othello. To study the desired factors and the best movement is obtained through an in-depth search, according to the designed heuristic. We experimented with two algorithms. The former is Mini-Max and its evolution to Alpha-Beta. The latter is Scout, which presents better performance regarding time. In addition, we present the results, rules, and implementation features.